Re: Efficiently storing a directed graph
Gary Sandine <gars-w903wlVS/R9Wk0Htik3J/[email protected]>
| Newsgroups | gmane.org.user-groups.nmlug |
|---|---|
| Message-ID | <[email protected]> |
On Sat, Mar 01, 2008 at 02:09:45PM -0700, Kelly Jones wrote: > I have a directed graph (nodes and edges) that I want to store > "efficiently": given two nodes, I want to quickly find the > shortest path between them. The graph is NOT acyclic (it's not a > tree), is fairly "sparse" (about 10000 edges for 2500 nodes), and > changes occasionally. [..] Using NetworkX might be helpful for quickly doing this with Python: https://networkx.lanl.gov/ There are Debian packages (python-networkx, python-pygraphviz). Regards, -- Gary Sandine <gars-w903wlVS/R9Wk0Htik3J/[email protected]> _______________________________________________ NMLUG mailing list [email protected] http://lists.b9.com/cgi-bin/mailman/listinfo/nmlug