/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/isomorphism/ |
H A D | vf2userfunc.py | 42 if self.node_match is not None: 43 nm = self.node_match(self.G1.nodes[G1_node], self.G2.nodes[G2_node]) 77 def __init__(self, G1, G2, node_match=None, edge_match=None): argument 111 self.node_match = node_match 124 def __init__(self, G1, G2, node_match=None, edge_match=None): argument 158 self.node_match = node_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/security/snort/snort-2.9.18/src/dynamic-preprocessors/sdf/ |
H A D | sdf_pattern_match.c | 493 int node_match = 1; in FindPiiRecursively() local 513 node_match ) in FindPiiRecursively() 533 node_match = isdigit( (int)(*(buf + *buf_index)) ); in FindPiiRecursively() 537 node_match = !isdigit( (int)(*(buf + *buf_index)) ); in FindPiiRecursively() 542 node_match = isalnum( (int)(*(buf + *buf_index)) ); in FindPiiRecursively() 546 node_match = !isalnum( (int)(*(buf + *buf_index)) ); in FindPiiRecursively() 551 node_match = isalpha( (int)(*(buf + *buf_index)) ); in FindPiiRecursively() 555 node_match = !isalpha( (int)(*(buf + *buf_index)) ); in FindPiiRecursively() 571 if (node_match) in FindPiiRecursively() 574 node_match = 1; in FindPiiRecursively() [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/isomorphism/tests/ |
H A D | test_ismags.py | 63 graph, graph, node_match=iso.categorical_node_match("name", None) 101 graph, graph, node_match=iso.categorical_node_match("name", None) 156 ismags = iso.ISMAGS(g2, g1, node_match=lambda x, y: x == y) 246 graph1, graph2, node_match=iso.categorical_node_match("color", None) 257 graph2, graph1, node_match=iso.categorical_node_match("color", None) 278 graph1, graph2, node_match=iso.categorical_node_match("color", None) 287 graph2, graph1, node_match=iso.categorical_node_match("color", None)
|
H A D | test_vf2userfunc.py | 95 assert not nx.is_isomorphic(self.g1, self.g2, node_match=self.nm) 99 assert nx.is_isomorphic(self.g1, self.g2, node_match=self.nm) 109 iso = nx.is_isomorphic(self.g1, self.g2, node_match=self.nm, edge_match=self.em) 114 iso = nx.is_isomorphic(self.g1, self.g2, node_match=self.nm, edge_match=self.em) 121 self.g1, self.g2, node_match=self.nm, edge_match=self.em
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/tests/ |
H A D | test_similarity.py | 97 G1, G2, node_match=lambda n1, n2: n1["color"] == n2["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/editors/hnb/hnb-1.9.18/src/ |
H A D | path.c | 46 node = node_match (token, node); in matchpath2node() 50 node = node_match (token, node); in matchpath2node() 60 node = node_match (token, node); in matchpath2node()
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/ |
H A D | similarity.py | 43 node_match=None, argument 193 node_match, 214 node_match=None, argument 354 node_match, 376 node_match=None, argument 509 node_match, 526 node_match=None, argument 1074 elif node_match: 1077 1 - int(node_match(G1.nodes[u], G2.nodes[v])) 1083 initial_cost = 1 - node_match(G1.nodes[root_u], G2.nodes[root_v])
|
/dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/algo/ |
H A D | isomorphism.rs | 283 node_match: &mut NM, in is_feasible() 389 if NM::enabled() && !node_match.eq(st.0.graph, st.1.graph, nodes.0, nodes.1) { in is_feasible() 556 node_match: &mut NM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 676 mut node_match: NM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 762 mut node_match: NM, 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 | 283 node_match: &mut NM, in is_feasible() 389 if NM::enabled() && !node_match.eq(st.0.graph, st.1.graph, nodes.0, nodes.1) { in is_feasible() 556 node_match: &mut NM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 676 mut node_match: NM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 762 mut node_match: NM, 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 | 283 node_match: &mut NM, in is_feasible() 389 if NM::enabled() && !node_match.eq(st.0.graph, st.1.graph, nodes.0, nodes.1) { in is_feasible() 556 node_match: &mut NM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 676 mut node_match: NM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 762 mut node_match: NM, 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 | 283 node_match: &mut NM, in is_feasible() 389 if NM::enabled() && !node_match.eq(st.0.graph, st.1.graph, nodes.0, nodes.1) { in is_feasible() 556 node_match: &mut NM, in try_match() 608 if is_feasible(&mut st, nodes, node_match, edge_match) { in try_match() 676 mut node_match: NM, in is_isomorphic_matching() 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 762 mut node_match: NM, 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 | 283 node_match: &mut NM, in update_neighbour_node_buckets() 389 if NM::enabled() && !node_match.eq(st.0.graph, st.1.graph, nodes.0, nodes.1) { in update_neighbour_node_buckets() 556 node_match: &mut NM, 608 if is_feasible(&mut st, nodes, node_match, edge_match) { 676 mut node_match: NM, 700 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false) 762 mut node_match: NM, 786 self::matching::try_match(&mut st, &mut node_match, &mut edge_match).unwrap_or(false)
|
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/circuits/ |
H A D | circuit_dag.py | 140 def node_match(attr1: Dict[Any, Any], attr2: Dict[Any, Any]) -> bool: function 143 return networkx.is_isomorphic(g1, g2, node_match=node_match)
|
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/circuits/ |
H A D | circuit_dag.py | 140 def node_match(attr1: Dict[Any, Any], attr2: Dict[Any, Any]) -> bool: function 143 return networkx.is_isomorphic(g1, g2, node_match=node_match)
|
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/circuits/ |
H A D | circuit_dag.py | 140 def node_match(attr1: Dict[Any, Any], attr2: Dict[Any, Any]) -> bool: function 143 return networkx.is_isomorphic(g1, g2, node_match=node_match)
|
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/circuits/ |
H A D | circuit_dag.py | 140 def node_match(attr1: Dict[Any, Any], attr2: Dict[Any, Any]) -> bool: function 143 return networkx.is_isomorphic(g1, g2, node_match=node_match)
|
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/circuits/ |
H A D | circuit_dag.py | 140 def node_match(attr1: Dict[Any, Any], attr2: Dict[Any, Any]) -> bool: function 143 return networkx.is_isomorphic(g1, g2, node_match=node_match)
|
/dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/petgraph-0.4.13/src/ |
H A D | isomorphism.rs | 187 mut node_match: F, in is_isomorphic_matching() 199 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 227 node_match: &mut F, 379 if F::enabled() && !node_match.eq(&g[0][nodes[0]], &g[1][nodes[1]]) { 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 | 187 mut node_match: F, in is_isomorphic_matching() 199 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 227 node_match: &mut F, 379 if F::enabled() && !node_match.eq(&g[0][nodes[0]], &g[1][nodes[1]]) { 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 | 187 mut node_match: F, in is_isomorphic_matching() 199 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 227 node_match: &mut F, 379 if F::enabled() && !node_match.eq(&g[0][nodes[0]], &g[1][nodes[1]]) { 443 match try_match(st, g0, g1, node_match, edge_match) {
|
/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) 79 See its docstring for more details. To aid in the creation of 'node_match'
|
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 184 mut node_match: F, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 238 node_match: &mut F, 407 if F::enabled() && !node_match.eq(&g[0][nodes[0]], &g[1][nodes[1]]) {
|
/dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 184 mut node_match: F, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 238 node_match: &mut F, 407 if F::enabled() && !node_match.eq(&g[0][nodes[0]], &g[1][nodes[1]]) {
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/petgraph-0.5.1/src/ |
H A D | isomorphism.rs | 184 mut node_match: F, in is_isomorphic_matching() 198 try_match(&mut st, g0, g1, &mut node_match, &mut edge_match).unwrap_or(false) in is_isomorphic_matching() 238 node_match: &mut F, 407 if F::enabled() && !node_match.eq(&g[0][nodes[0]], &g[1][nodes[1]]) {
|