-
Encountered an error when feeding in some motifs that had isolated nodes.
Code:
```python
import networkx as nx
from grandiso import find_motifs
host = nx.fast_gnp_random_graph(3, 0.5, dire…
-
Hi @j6k4m8,
There is an issue with `grand.Graph` and `grand.dialects.NetworkXDialect`.
Since NetworkXDialect is inherited from `networkx.Graph`, there happen to be discrepancies between `grand.…
-
Hello, I have a huge graph i want to calculate motifs from but for years i have been struggling to find a scalable library to calculate motifs. How does dotmotif scale ? Is there a Big O complexity an…
-
Hello, thank you for the great project :)
In how far are equijoins exactly supported?
Given that I have the following NetworkX graph:
```
G = nx.DiGraph()
G.add_node("x")
G.add_node("y")
…
-
Hi,
I am looking for an algorithm that can find the largest common monomorphic subgraph between two graphs. Specifically, I have two graphs G1 and G2, and I would like to identify the largest subgr…
-
Hi,
I'm wondering if in networkx or this library I'm limited to DiGraph subgraph isomorphism search?
I need multi.
Thanks.
-
Is their a way to match nodes by labels. eg. MATCH (p:Person) RETURN p.name?
-
I believe the license is Apache 2.0 but it comes up as MIT on PyPI due to this line: https://github.com/aplbrain/grandiso-networkx/blob/master/setup.py#L18?
-
Thank you for this very useful library, we will definitely consider it for our future research. In our specific case, we would need to count subgraph isomorphisms by edge and node labels. E.g., given …
-
My use case is a perfect fit for this feature. I do not know exactly the depth of a branch, so I would like to search for depth starting from a node all the way down or to a limit. It would be good i…