-
When using `MultiGraph` the determining of subgraph monomorphisms doesn't work as expected when having multiple edges with different "colors" between two nodes.
### Current Behavior
A gr…
-
I believe digraphs doesn't currently do subgraph isomorphism.
Probably the best open source subgraph isomorphism solver around is https://github.com/ciaranm/glasgow-subgraph-solver . I was wanting …
-
bluss updated
6 years ago
-
## Discription
This project currently finds induced subgraph isomorphism only. Is it possible to add the subgraph isomorphism, which is a **superset** of induced subgraph isomorphism? This will be us…
-
Hi,
This is a new-feature request or consultation (since i may try to implement this myself).
I wish to use GraphMatcher.subgraph_isomorphisms_iter() in order to retrieve candidates from a (graph…
-
I am considering an example: finding all isomorphic copies of the claw $K_{1,3}$ as subgraphs in the complete multipartite graph $K_{2,2,2,2}$, and, of course, counting their number.
claw:
```
4…
-
I did some digging around and found that VF3L works with non-induced subgraphs, which means look-ahead in VF3 probably breaks monomorphism. Disabling that for non-induced subgraphs in `IsFeasiblePair`…
-
**Summary:**
Hello. I got out of memory error when I run the subgraph isomorphism app. The query graph I used is the query_sm.mtx in your code directory(triangle graph) and the data graph is gowalla.…
-
Hi,
I'm wondering if in networkx or this library I'm limited to DiGraph subgraph isomorphism search?
I need multi.
Thanks.
-
Hello,
I am trying to address the following problem with the Glasgow Solver: Given a possibly large undirected and unlabelled graph G, I need to enumerate all the (not-induced) subgraphs, t, that are…