Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 43fbaeb

Browse files
Add comments
1 parent a9936c7 commit 43fbaeb

File tree

1 file changed

+2
-1
lines changed

1 file changed

+2
-1
lines changed

‎src/Advanced.Algorithms/Graph/Matching/HopcroftKarp.cs‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -127,7 +127,8 @@ private List<T> bfs(IGraph<T> graph,
127127

128128
/// <summary>
129129
/// Find an augmenting path that start from a given free vertex on right and ending
130-
/// at a free vertex on left. Return the matching edges along that path.
130+
/// at a free vertex on left, via Matched (right -> left) and UnMatched (left -> right) edges alternatively.
131+
/// Return the matching edges along that path.
131132
/// </summary>
132133
private HashSet<MatchEdge<T>> dfs(IGraph<T> graph,
133134
Dictionary<T, T> leftToRightMatchEdges,

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /