HungarianAlgorithm
Namespace: QuickGraph.Algorithms.AssigmentProblem
Constructors
| Constructor | Description |
new(costs)
Signature: (costs:int [,]) -> unit
|
Instance members
| Instance member | Description |
GetIterations()
Signature: unit -> List<HungarianIteration>
|
Returns iterations that can be used to visualise the algorithm |
Run()
Signature: unit -> int []
|
Returns assigments without visualisation |
