grandiso-networkx
grandiso-networkx copied to clipboard
aplbrain
Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")
Hi, I'm wondering if in networkx or this library I'm limited to DiGraph subgraph isomorphism search? I need multi. Thanks.
Dear @j6k4m8, I am looking for a way to find matches that are larger than the input motif (possibly given a certain threshold). For instance, given the following motif: ```...
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...
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, directed=True) motif = nx.DiGraph()...
In case of no results, it's still useful to have something to report to the user. Our specific use case is the following: we use grandiso in our test framework...
