-
For creating subgraphs (https://github.com/igraph/xdata-igraph/issues/39) and more.
-
The problem of finding equivalent graphs is essentially the graph isomorphism problem. That's a hard problem. Approaching this will have to come in a few steps.
1. Find an algorithm (or dear god com…
-
This issue is meant for crowdsourcing knowledge about joining NGS/VCF-derived variant databases, which the GA4GH schemas are oriented towards, and clinical variation databases, which tend to prefer [H…
-
With certain graphs, subgraph isomorphism returns False even when it should return True. For example, here is an example:
import networkx
import re
ingraph = "0 5 0 8 1 4 1 6 3 7 2 7 | 3 5 3 8…
-
Hi there,
This is to discuss a potential feature which could be used in the analysis of hydrogen bonding networks and the nanoreactor.
I would like to have a time series of connectivity graphs, in…
-
Original ticket https://networkx.lanl.gov/trac/ticket/566
Reported 2011-06-06 by trac user Mikk, assigned to @chebee7i.
It may be nice if all the VF2 isomorphisms implementations consider a special a…
-
Hi group,
I have two questions with relation to this title:
1. I have AdjGraph class as following:
class AdjGraph(nx.Graph):
def **init**(self):
super(AdjGraph,self).**init**()
self.ax=None
self…
-
See http://liris.cnrs.fr/csolnon/LAD.html
License is OK, because instead of CeCill v1 one can just use v2, and v2 is explicitly GPL compatible.
---
Imported from Launchpad using lp2gh.
- date creat…
-
Should be easy.
---
Imported from Launchpad using lp2gh.
- date created: 2009-01-26T16:19:05Z
- owner: gabor.csardi
- assignee: gabor.csardi
- the launchpad url was https://bugs.launchpad.net/bugs/3…
-
right now the full text search in postgres will only search (and match) whole strings