| GraphMatcher.__init__(G1, G2) | Initialize GraphMatcher. |
| GraphMatcher.initialize() | Reinitializes the state of the algorithm. |
| GraphMatcher.is_isomorphic() | Returns True if G1 and G2 are isomorphic graphs. |
| GraphMatcher.subgraph_is_isomorphic() | Returns True if a subgraph of G1 is isomorphic to G2. |
| GraphMatcher.isomorphisms_iter() | Generator over isomorphisms between G1 and G2. |
| GraphMatcher.subgraph_isomorphisms_iter() | Generator over isomorphisms between a subgraph of G1 and G2. |
| GraphMatcher.candidate_pairs_iter() | Iterator over candidate pairs of nodes in G1 and G2. |
| GraphMatcher.match() | Extends the isomorphism mapping. |
| GraphMatcher.semantic_feasibility(G1_node, ...) | Returns True if adding (G1_node, G2_node) is symantically feasible. |
| GraphMatcher.syntactic_feasibility(G1_node, ...) | Returns True if adding (G1_node, G2_node) is syntactically feasible. |
| DiGraphMatcher.__init__(G1, G2) | Initialize DiGraphMatcher. |
| DiGraphMatcher.initialize() | Reinitializes the state of the algorithm. |
| DiGraphMatcher.is_isomorphic() | Returns True if G1 and G2 are isomorphic graphs. |
| DiGraphMatcher.subgraph_is_isomorphic() | Returns True if a subgraph of G1 is isomorphic to G2. |
| DiGraphMatcher.isomorphisms_iter() | Generator over isomorphisms between G1 and G2. |
| DiGraphMatcher.subgraph_isomorphisms_iter() | Generator over isomorphisms between a subgraph of G1 and G2. |
| DiGraphMatcher.candidate_pairs_iter() | Iterator over candidate pairs of nodes in G1 and G2. |
| DiGraphMatcher.match() | Extends the isomorphism mapping. |
| DiGraphMatcher.semantic_feasibility(G1_node, ...) | Returns True if adding (G1_node, G2_node) is symantically feasible. |
| DiGraphMatcher.syntactic_feasibility(...) | Returns True if adding (G1_node, G2_node) is syntactically feasible. |
| WeightedGraphMatcher.__init__(G1, G2[, ...]) | Initialize WeightedGraphMatcher. |
| WeightedGraphMatcher.initialize() | Reinitializes the state of the algorithm. |
| WeightedGraphMatcher.is_isomorphic() | Returns True if G1 and G2 are isomorphic graphs. |
| WeightedGraphMatcher.subgraph_is_isomorphic() | Returns True if a subgraph of G1 is isomorphic to G2. |
| WeightedGraphMatcher.isomorphisms_iter() | Generator over isomorphisms between G1 and G2. |
| WeightedGraphMatcher.subgraph_isomorphisms_iter() | Generator over isomorphisms between a subgraph of G1 and G2. |
| WeightedGraphMatcher.candidate_pairs_iter() | Iterator over candidate pairs of nodes in G1 and G2. |
| WeightedGraphMatcher.match() | Extends the isomorphism mapping. |
| WeightedGraphMatcher.semantic_feasibility(...) | Returns True if mapping G1_node to G2_node is semantically feasible. |
| WeightedGraphMatcher.syntactic_feasibility(...) | Returns True if adding (G1_node, G2_node) is syntactically feasible. |
| WeightedDiGraphMatcher.__init__(G1, G2[, ...]) | Initialize WeightedGraphMatcher. |
| WeightedDiGraphMatcher.initialize() | Reinitializes the state of the algorithm. |
| WeightedDiGraphMatcher.is_isomorphic() | Returns True if G1 and G2 are isomorphic graphs. |
| WeightedDiGraphMatcher.subgraph_is_isomorphic() | Returns True if a subgraph of G1 is isomorphic to G2. |
| WeightedDiGraphMatcher.isomorphisms_iter() | Generator over isomorphisms between G1 and G2. |
| WeightedDiGraphMatcher.subgraph_isomorphisms_iter() | Generator over isomorphisms between a subgraph of G1 and G2. |
| WeightedDiGraphMatcher.candidate_pairs_iter() | Iterator over candidate pairs of nodes in G1 and G2. |
| WeightedDiGraphMatcher.match() | Extends the isomorphism mapping. |
| WeightedDiGraphMatcher.semantic_feasibility(...) | Returns True if mapping G1_node to G2_node is semantically feasible. |
| WeightedDiGraphMatcher.syntactic_feasibility(...) | Returns True if adding (G1_node, G2_node) is syntactically feasible. |
| WeightedMultiGraphMatcher.__init__(G1, G2[, ...]) | Initialize WeightedGraphMatcher. |
| WeightedMultiGraphMatcher.initialize() | Reinitializes the state of the algorithm. |
| WeightedMultiGraphMatcher.is_isomorphic() | Returns True if G1 and G2 are isomorphic graphs. |
| WeightedMultiGraphMatcher.subgraph_is_isomorphic() | Returns True if a subgraph of G1 is isomorphic to G2. |
| WeightedMultiGraphMatcher.isomorphisms_iter() | Generator over isomorphisms between G1 and G2. |
| WeightedMultiGraphMatcher.subgraph_isomorphisms_iter() | Generator over isomorphisms between a subgraph of G1 and G2. |
| WeightedMultiGraphMatcher.candidate_pairs_iter() | Iterator over candidate pairs of nodes in G1 and G2. |
| WeightedMultiGraphMatcher.match() | Extends the isomorphism mapping. |
| WeightedMultiGraphMatcher.semantic_feasibility(...) | Returns True if mapping G1_node to G2_node is semantically feasible. |
| WeightedMultiGraphMatcher.syntactic_feasibility(...) | Returns True if adding (G1_node, G2_node) is syntactically feasible. |
| WeightedMultiDiGraphMatcher.__init__(G1, G2) | Initialize WeightedGraphMatcher. |
| WeightedMultiDiGraphMatcher.initialize() | Reinitializes the state of the algorithm. |
| WeightedMultiDiGraphMatcher.is_isomorphic() | Returns True if G1 and G2 are isomorphic graphs. |
| WeightedMultiDiGraphMatcher.subgraph_is_isomorphic() | Returns True if a subgraph of G1 is isomorphic to G2. |
| WeightedMultiDiGraphMatcher.isomorphisms_iter() | Generator over isomorphisms between G1 and G2. |
| WeightedMultiDiGraphMatcher.subgraph_isomorphisms_iter() | Generator over isomorphisms between a subgraph of G1 and G2. |
| WeightedMultiDiGraphMatcher.candidate_pairs_iter() | Iterator over candidate pairs of nodes in G1 and G2. |
| WeightedMultiDiGraphMatcher.match() | Extends the isomorphism mapping. |
| WeightedMultiDiGraphMatcher.semantic_feasibility(...) | Returns True if mapping G1_node to G2_node is semantically feasible. |
| WeightedMultiDiGraphMatcher.syntactic_feasibility(...) | Returns True if adding (G1_node, G2_node) is syntactically feasible. |