By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
440,551 Members | 1,142 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 440,551 IT Pros & Developers. It's quick & easy.

Graphs in Python

P: n/a
Hi.

I am a newbie to Python. I am trying to implement a
Python code for graph manipulation. My graphs are
about 200-500 nodes big. Excepting for the short basic
graph implementation info on Python.org, where can I
find more in depth info about how to express graphs in
python, and how to use them in a code?

Also, does anyone know of a easy way of creating the
dictionary for python for a 500-node graph, without
typing each and every node? I found some application
that recognize dot file Graphviz - but I am looking
for a program that can let me "draw" a graph and then
generate the lists automatically from the drawing.

Thanks.
-SM
Apr 10 '08 #1
Share this Question
Share on Google+
2 Replies


P: n/a
Sanhita Mallick>where can I find more in depth info about how to
express graphs in python, and how to use them in a code?<

You can look here:
https://networkx.lanl.gov/wiki
My version:
http://sourceforge.net/projects/pynetwork/

Bye,
bearophile
Apr 10 '08 #2

P: n/a
On Apr 10, 1:05*pm, Sanhita Mallick <sanhi...@yahoo.comwrote:
Hi.

I am a newbie to Python. I am trying to implement a
Python code for graph manipulation. My graphs are
about 200-500 nodes big. Excepting for the short basic
graph implementation info on Python.org, where can I
find more in depth info about how to express graphs in
python, and how to use them in a *code?

Also, does anyone know of a easy way of creating the
dictionary for python for a 500-node graph, without
typing each and every node? I found some application
that recognize dot file Graphviz - but I am looking
for a program that can let me "draw" a graph and then
generate the lists automatically from the drawing.

Thanks.
-SM
A pure python package such as those mentioned in other replies is most
likely fine for graphs of several hundreds nodes, but in case
performance matters, you can take a look at the Python bindings of the
Boost graph library [1].

George

[1] http://www.osl.iu.edu/~dgregor/bgl-python/
Apr 11 '08 #3

This discussion thread is closed

Replies have been disabled for this discussion.