We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d78f492 commit 5e2d8f7Copy full SHA for 5e2d8f7
src/Advanced.Algorithms/Graph/Matching/HopcroftKarp.cs
@@ -43,20 +43,20 @@ private HashSet<MatchEdge<T>> getMaxBiPartiteMatching(IGraph<T> graph,
43
while (freeVerticesOnRight.Count > 0)
44
{
45
var visited = new HashSet<T>();
46
- var paths = new HashSet<MatchEdge<T>>();
+ var path = new HashSet<MatchEdge<T>>();
47
48
foreach (var vertex in freeVerticesOnRight)
49
50
- var path = dfs(graph,
+ var currentPath = dfs(graph,
51
leftToRightMatchEdges, rightToLeftMatchEdges, vertex, default, visited, true);
52
53
- if (path != null)
+ if (currentPath != null)
54
55
- union(paths,path);
+ union(path,currentPath);
56
}
57
58
59
- xor(matches, paths, leftToRightMatchEdges, rightToLeftMatchEdges);
+ xor(matches, path, leftToRightMatchEdges, rightToLeftMatchEdges);
60
61
freeVerticesOnRight = bfs(graph, partitions, leftToRightMatchEdges, rightToLeftMatchEdges);
62
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments