"William" <[EMAIL PROTECTED]> writes:

> Robert has been doing a little preliminary work about what is out
> there, and putting it here:
>
> http://sage.math.washington.edu/home/rlmill/graph_software.html
> 
> The idea of the above page is just to summarize what is currently
> available. 

Could be better on the wiki, so others can contribute?

For what it's worth, included below are my notes from when I searched
for graph theory software a few months ago.  For the problem I was
interested in, Eppstein's pure python PADS library worked very nicely.

Dan

- networkx looks very good.  handles 1M+ vertices.  python package.
    https://networkx.lanl.gov/    Seems to support various
  graph plotting libraries, e.g. matplotlib, pygraphviz, pydot.
  Had to install it in /usr, not /usr/local, to get it to
  import properly, since it is stored as an egg.
  Also needed to do "apt install python2.4-setuptools/testing"
  before "python2.4 setup.py install".
- pygraphviz http://networkx.lanl.gov/pygraphviz/ is part of networkx
  graphviz http://graphviz.org/
  graphviz is in Debian.
- pydot http://www.dkbza.org/pydot.html  Another interface to graphviz
- yet another python graphviz binding: http://yapgvb.sourceforge.net
- Eppstein's PADS library http://www.ics.uci.edu/~eppstein/PADS/
- Boost, BGL; has python bindings
    http://www.boost.org/libs/graph/doc/index.html
- pygraphlib http://pygraphlib.sourceforge.net/doc/index.html
  Can use graphviz; supplies pydot.
  Only implements a few algorithms.
- kjbuckets
  http://starship.python.net/crew/aaron_watters/kjbuckets/kjbuckets.html
- BFS?  PGL?
  http://pythonzweb.blogspot.com/2005_03_01_pythonzweb_archive.html
  http://fluidobjects.com/pgl/bfs.py
- igraph has a python interface.  Written in C, designed for
  extremely large graphs.  Home page doesn't mention any interesting
  algorithms.
  http://cneurocvs.rmki.kfki.hu/igraph/

Non-python:

- LEDA http://www.algorithmic-solutions.com/
  http://www.algorithmic-solutions.info/leda_manual/MANUAL.html
  Has maximum matching code.
- GTL http://ceu.fi.udc.es/SAL/E/0/GTL.html
- LGL, large graph layout
  http://bioinformatics.icmb.utexas.edu/lgl/
- nauty is a program for computing automorphism groups of graphs and
  digraphs. It can also produce a canonical labelling.
    http://cs.anu.edu.au/people/bdm/nauty/
- lots of links in graph theory section of
    http://www.kurnikov.org/links/math_links.htm
  and at
    http://www.google.com/Top/Science/Math/Combinatorics/Software/


--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---

Reply via email to