Module isomorphism
petgraph
0.6.5
Module isomorphism
Module Items
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
isomorphism
Copy item path
Settings
Help
Summary
Source
Functions
§
is_
isomorphic
[Generic] Return
true
if the graphs
g0
and
g1
are isomorphic.
is_
isomorphic_
matching
[Generic] Return
true
if the graphs
g0
and
g1
are isomorphic.
is_
isomorphic_
subgraph
[Generic] Return
true
if
g0
is isomorphic to a subgraph of
g1
.
is_
isomorphic_
subgraph_
matching
[Generic] Return
true
if
g0
is isomorphic to a subgraph of
g1
.
subgraph_
isomorphisms_
iter
Using the VF2 algorithm, examine both syntactic and semantic graph isomorphism (graph structure and matching node and edge weights) and, if
g0
is isomorphic to a subgraph of
g1
, return the mappings between them.