-
When running ./main.sh 16 I see the following:
verifying KS candidates of order 16 in 16.exhaust...
checking solutions are unique up to isomorphism...
0 candidates do not satisfy some constraints…
-
### Test Case
```rust
#[test]
fn test_my() {
let mut g = Graph::::new();
let e1 = g.add_node("l1".to_string());
let e2 = g.add_node("l2".to_string());
g.add_edge(e1,…
-
In GitLab by @bjthehun on Feb 2, 2023, 17:05
_Merges general_graph_tests -> main_
Updated Tests and fixed Subgraph Isomorphism.
Closes #53.
-
Hi, I am really interested in your proposed MCS algorithm, and I want to try some extensions on it. I wonder if it is possible that I can have a look of the implementations of several algorithms being…
-
In GitLab by @bjthehun on Dec 1, 2022, 15:28
Catch-All Issue for Pattern Matching Implementation with RustGQL.
-
It looks like `igraph` fails to build in the Windows environment of R-universe, see the corresponding [Github Actions logs here](https://github.com/r-universe/igraph/actions/runs/3685509786/jobs/62366…
-
e.g CCDC ref VATTOC
-
In https://github.com/py-why/dodiscover/blob/5f5003ecaef7133a25919c72718cd671b9cd49fc/dodiscover/constraint/fcialg.py#L557-L559, the check is incorrect. I should've caught this, but to check `A -> u` …
-
### Current Behavior
```
import networkx as nx
g = nx.MultiDiGraph({0: [1, 1, 2, 2, 3], 1: [2, 3, 3], 2: [3]})
h = nx.MultiDiGraph({0: [1, 1, 2, 2, 3], 1: [2, 3, 3], 3: [2]})
print(nx.is_…
-
Graphs.jl doesn't have a function such as `relabel_nodes` in NetworkX. I think the function is useful for nodes rearranging and graph shrinkage.
Would a PR for the implementation be welcome?