/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/isomorphism/ |
H A D | vf2userfunc.py | 48 if self.edge_match is not None: 54 edge_match = self.edge_match 59 if G2_node in G2nbrs and not edge_match( 65 if G2_nbr in G2nbrs and not edge_match( 77 def __init__(self, G1, G2, node_match=None, edge_match=None): argument 112 self.edge_match = edge_match 124 def __init__(self, G1, G2, node_match=None, edge_match=None): argument 159 self.edge_match = edge_match
|
H A D | isomorph.py | 127 def is_isomorphic(G1, G2, node_match=None, edge_match=None): argument 231 gm = GM(G1, G2, node_match=node_match, edge_match=edge_match)
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/isomorphism/tests/ |
H A D | test_vf2userfunc.py | 23 assert nx.is_isomorphic(g1, g2, edge_match=em) 54 assert not nx.is_isomorphic(g1, g2, edge_match=em) 66 assert nx.is_isomorphic(g1, g2, edge_match=em) 68 assert not nx.is_isomorphic(g1, g2, edge_match=em) 72 assert nx.is_isomorphic(g1, g2, edge_match=em) 102 assert nx.is_isomorphic(self.g1, self.g2, edge_match=self.em) 121 self.g1, self.g2, node_match=self.nm, edge_match=self.em 170 gm = self.GM(self.g1, self.g2, edge_match=self.emc) 174 gm = self.GM(self.g1, self.g2, edge_match=self.emcm) 178 gm = self.GM(self.g1, self.g2, edge_match=self.emg1) [all …]
|
/dports/cad/verilator/verilator-4.216/nodist/ |
H A D | dot_importer | 28 edge_match = re.search(edge_re, line) 38 elif edge_match: 39 fromv = edge_match.group(1) 40 tov = edge_match.group(2)
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/tests/ |
H A D | test_similarity.py | 112 G1, G2, edge_match=lambda e1, e2: e1["color"] == e2["color"] 382 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 0 393 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1 404 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1 416 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1 431 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1 444 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 2 456 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 3 470 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 4 500 assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 2 [all …]
|
/dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/algo/ |
H A D | isomorphism.rs | 284 edge_match: &mut EM, in is_feasible() 415 if !edge_match.eq( in is_feasible() 442 if !edge_match.eq( in is_feasible() 557 edge_match: &mut EM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 677 mut edge_match: EM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 763 mut edge_match: EM, in is_isomorphic_subgraph_matching() 786 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_subgraph_matching()
|
/dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/algo/ |
H A D | isomorphism.rs | 284 edge_match: &mut EM, in is_feasible() 415 if !edge_match.eq( in is_feasible() 442 if !edge_match.eq( in is_feasible() 557 edge_match: &mut EM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 677 mut edge_match: EM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 763 mut edge_match: EM, in is_isomorphic_subgraph_matching() 786 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_subgraph_matching()
|
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/algo/ |
H A D | isomorphism.rs | 284 edge_match: &mut EM, in is_feasible() 415 if !edge_match.eq( in is_feasible() 442 if !edge_match.eq( in is_feasible() 557 edge_match: &mut EM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 677 mut edge_match: EM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 763 mut edge_match: EM, in is_isomorphic_subgraph_matching() 786 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_subgraph_matching()
|
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/algo/ |
H A D | isomorphism.rs | 284 edge_match: &mut EM, in is_feasible() 415 if !edge_match.eq( in is_feasible() 442 if !edge_match.eq( in is_feasible() 557 edge_match: &mut EM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 677 mut edge_match: EM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 763 mut edge_match: EM, in is_isomorphic_subgraph_matching() 786 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_subgraph_matching()
|
/dports/sysutils/dua-cli/dua-cli-2.14.11/cargo-crates/petgraph-0.6.0/src/algo/ |
H A D | isomorphism.rs | 284 edge_match: &mut EM, in update_neighbour_node_buckets() 415 if !edge_match.eq( in update_neighbour_node_buckets() 442 if !edge_match.eq( in update_neighbour_node_buckets() 557 edge_match: &mut EM, 608 if is_feasible(&mut st, nodes, node_match, edge_match) { 677 mut edge_match: EM, 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) 763 mut edge_match: EM, 786 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false)
|
/dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/petgraph-0.4.13/src/ |
H A D | isomorphism.rs | 188 mut edge_match: G) -> bool in is_isomorphic_matching() 199 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 228 edge_match: &mut G) 400 if !edge_match.eq(&g[j][n_edge], &g[1-j][m_edge]) { 421 if !edge_match.eq(&g[j][n_edge], &g[1-j][m_edge]) { 443 match try_match(st, g0, g1, node_match, edge_match) {
|
/dports/textproc/ripgrep-all/ripgrep-all-0.9.6/cargo-crates/petgraph-0.4.13/src/ |
H A D | isomorphism.rs | 188 mut edge_match: G) -> bool in is_isomorphic_matching() 199 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 228 edge_match: &mut G) 400 if !edge_match.eq(&g[j][n_edge], &g[1-j][m_edge]) { 421 if !edge_match.eq(&g[j][n_edge], &g[1-j][m_edge]) { 443 match try_match(st, g0, g1, node_match, edge_match) {
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.4.13/src/ |
H A D | isomorphism.rs | 188 mut edge_match: G) -> bool in is_isomorphic_matching() 199 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 228 edge_match: &mut G) 400 if !edge_match.eq(&g[j][n_edge], &g[1-j][m_edge]) { 421 if !edge_match.eq(&g[j][n_edge], &g[1-j][m_edge]) { 443 match try_match(st, g0, g1, node_match, edge_match) {
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/ |
H A D | similarity.py | 44 edge_match=None, argument 194 edge_match, 215 edge_match=None, argument 355 edge_match, 377 edge_match=None, argument 510 edge_match, 527 edge_match=None, argument 1124 elif edge_match: 1127 1 - int(edge_match(G1.edges[g], G2.edges[h]))
|
/dports/math/py-networkx/networkx-2.6.3/doc/release/ |
H A D | api_1.6.rst | 67 checks via the 'node_match' and 'edge_match' parameters. As part of this 77 is_isomorphic(g1, g2, node_match=None, edge_match=None) 80 and 'edge_match' functions, users are encouraged to work with::
|
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.5.0/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/petgraph/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/net/krill/krill-0.9.4/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/lang/rust/rustc-1.58.1-src/vendor/petgraph/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/petgraph/src/ |
H A D | isomorphism.rs | 185 mut edge_match: G, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 239 edge_match: &mut G, 427 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) { 447 if !edge_match.eq(&g[j][n_edge], &g[1 - j][m_edge]) {
|