This is a library for solving the linear assignment
problem.
For this problem, it is helpful to think of the data as a bipartite
graph,
with weighted, undirected edges fully connecting all elements of set U
to all elements of set V
.
solver |
Find a solution to the assignment problem in matrix .
|
Edge |
An edge between U and V : (u, v)
|
Keyboard shortcuts
- ?
- Show this help dialog
- S
- Focus the search field
- ⇤
- Move up in search results
- ⇥
- Move down in search results
- ⏎
- Go to active search result
Search tricks
Prefix searches with a type followed by a colon (e.g.
fn:
) to restrict the search to a given type.
Accepted types are: fn
, mod
,
struct
, enum
,
trait
, typedef
(or
tdef
).
Search functions by type signature (e.g.
vec -> usize
)