Module matching
petgraph
0.6.5
Module matching
Module Items
Structs
Functions
In petgraph::
algo
Modules
astar
bellman_ford
dijkstra
dominators
feedback_arc_set
floyd_warshall
ford_fulkerson
isomorphism
k_shortest_path
matching
min_spanning_tree
page_rank
simple_paths
tred
Structs
Cycle
DfsSpace
NegativeCycle
TarjanScc
Traits
BoundedMeasure
FloatMeasure
Measure
PositiveMeasure
UnitMeasure
Functions
condensation
connected_components
has_path_connecting
is_bipartite_undirected
is_cyclic_directed
is_cyclic_undirected
kosaraju_scc
scc
tarjan_scc
toposort
petgraph
::
algo
Module
matching
Copy item path
Settings
Help
Summary
Source
Structs
§
Matched
Edges
Matched
Nodes
Matching
Computed
matching
of the graph.
Functions
§
greedy_
matching
[Generic] Compute a
matching
using a greedy heuristic.
maximum_
matching
[Generic] Compute the
maximum matching
using
Gabow’s algorithm
.