-
Notifications
You must be signed in to change notification settings - Fork 299
Closed
Description
Given a simple fully connected bipartite graph K_{3,3} the maximum matching algorithm crashes with an error:
assuming U={A, B, C} and V={D, E, F}
the exception is raised in the following line:
System.ArgumentException: 'An item with the same key has already been added. Key: E'
Since rightMatch dictionary already contains a mapping between E and A the algorithm cannot add a mapping between E and C on top of it
justcoding121
Metadata
Metadata
Assignees
Labels
No labels