python-graph - Project Hosting on Google Code

Last 7 days Dec 14, 2009 Example (python-graph usage example.) Wiki page commented on by EscribanoRuben - I use Ubuntu 9.10 and python2.6 The symbolic link /usr/lib/pyshared/python2.6/_gv is broken, but it could fix it sudo mv /usr/lib/pyshared/python2.6/_gv.so /usr/lib/pyshared/python2.6/_gv.so.bak sudo ln -s /usr/lib/pyshared/python2.6/libgv_python.so /usr/lib/pyshared/python2.6/_gv.so I use Ubuntu 9.10 and python2.6 The symbolic link /usr/lib/pyshared/python2.6/_gv is broken, but it could fix it sudo mv /usr/lib/pyshared/python2.6/_gv.so /usr/lib/pyshared/python2.6/_gv.so.bak sudo ln -s /usr/lib/pyshared/python2.6/libgv_python.so /usr/lib/pyshared/python2.6/_gv.so Dec 13, 2009 Example (python-graph usage example.) Wiki page edited by pmatiello - Revision r665 Edited wiki page through web user interface. Revision r665 Edited wiki page through web user interface. Dec 13, 2009 r664 (Starting 1.7.0.) committed by pmatiello - Starting 1.7.0. Starting 1.7.0. Dec 13, 2009 Credits (Authors and contributors.) Wiki page edited by pmatiello - Revision r663 Edited wiki page through web user interface. Revision r663 Edited wiki page through web user interface. Dec 13, 2009 Changelog (python-graph most important changes across releases.) Wiki page edited by pmatiello - Revision r662 Edited wiki page through web user interface. Revision r662 Edited wiki page through web user interface. Dec 13, 2009 python-graph-1.6.3.tar.bz2 (Release 1.6.3 [tar.bz2 package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.zip (Release 1.6.3 [zip package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.tar.bz2 (Release 1.6.3 [tar.bz2 package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.zip (Release 1.6.3 [zip package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-core-1.6.3.tar.gz (Core module [sdist package]) file uploaded by pmatiello - Labels: Featured Type-Package OpSys-All Labels: Featured Type-Package OpSys-All Dec 13, 2009 python-graph-dot-1.6.3.tar.gz (Dot-language support [sdist package]) file uploaded by pmatiello - Labels: Featured Type-Package OpSys-All Labels: Featured Type-Package OpSys-All Dec 13, 2009 r661 (Tagging release 1.6.3) committed by pmatiello - Tagging release 1.6.3 Tagging release 1.6.3 Dec 13, 2009 r660 (Updating Changelog.) committed by pmatiello - Updating Changelog. Updating Changelog. Dec 13, 2009 r659 (Tagging release 1.6.3) committed by pmatiello - Tagging release 1.6.3 Tagging release 1.6.3 Dec 13, 2009 python-graph-1.6.3.tar.bz2 (Release 1.6.3 [tar.bz2 package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.zip (Release 1.6.3 [zip package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.tar.bz2 (Release 1.6.3 [tar.bz2 package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.zip (Release 1.6.2 [zip package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-core-1.6.3.tar.gz (Core module [sdist package]) file uploaded by pmatiello - Labels: Type-Package OpSys-All Labels: Type-Package OpSys-All Dec 13, 2009 python-graph-dot-1.6.3.tar.gz (Dot-language support [sdist package]) file uploaded by pmatiello - Labels: Featured Type-Package OpSys-All Labels: Featured Type-Package OpSys-All Dec 13, 2009 r658 (Updating README.) committed by pmatiello - Updating README. Updating README. Dec 13, 2009 python-graph-1.6.3.tar.bz2 (Release 1.6.3 [tar.bz2 package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-1.6.3.zip (Release 1.6.2 [zip package]) file uploaded by pmatiello - Labels: Featured Type-Source OpSys-All Labels: Featured Type-Source OpSys-All Dec 13, 2009 python-graph-core-1.6.3.tar.gz (Core module [sdist package]) file uploaded by pmatiello - Labels: Featured Type-Package OpSys-All Labels: Featured Type-Package OpSys-All Dec 13, 2009 python-graph-dot-1.6.3.tar.gz (Dot-language support [sdist package]) file uploaded by pmatiello - Labels: Featured Type-Package OpSys-All Labels: Featured Type-Package OpSys-All Last 30 days Dec 05, 2009 issue 62 (Graph equality test) commented on by anand.ib...@gmail.com - @pedro: do you mind if i start work on this one?? @pedro: do you mind if i start work on this one?? Dec 04, 2009 r657 (Changelog updated.) committed by pmatiello - Changelog updated. Changelog updated. Dec 03, 2009 r656 (Fixing XML reading.) committed by pmatiello - Fixing XML reading. Fixing XML reading. Dec 02, 2009 r655 (Test stubs for shortest path.) committed by pmatiello - Test stubs for shortest path. Test stubs for shortest path. Dec 02, 2009 r654 (Correct test class naming.) committed by pmatiello - Correct test class naming. Correct test class naming. Dec 02, 2009 r653 (Test for Minimal Spanning Tree.) committed by pmatiello - Test for Minimal Spanning Tree. Test for Minimal Spanning Tree. Nov 30, 2009 issue 62 (Graph equality test) reported by pmatiello - Add __eq__ operator to graph / digraph / hypergraph. What to check: 1. If nodes names match 2. If edges match 3. If edge weigths match 4. If labels match 5. If attributes match Add __eq__ operator to graph / digraph / hypergraph. What to check: 1. If nodes names match 2. If edges match 3. If edge weigths match 4. If labels match 5. If attributes match Nov 30, 2009 issue 60 (Suggestion: G.nodes() and G.edges() should return an iterato...) commented on by christian.muise - @salim: Whats the issue with using the iterators as they are currently accessible? @salim: Whats the issue with using the iterators as they are currently accessible? Nov 30, 2009 r652 (Fixing hypergraph dot I/O error (at the cost of breaking com...) committed by pmatiello - Fixing hypergraph dot I/O error (at the cost of breaking compatibility with older stored hypegraphs). Fixing hypergraph dot I/O error (at the cost of breaking compatibility with older stored hypegraphs). Nov 30, 2009 r651 (Small, very small, clarification on docs about what an edge ...) committed by pmatiello - Small, very small, clarification on docs about what an edge is in graphs and digraphs. Small, very small, clarification on docs about what an edge is in graphs and digraphs. Nov 30, 2009 r650 (_cut_hypernodes and _cut_hyperedges are private now (as cut_...) committed by pmatiello - _cut_hypernodes and _cut_hyperedges are private now (as cut_edges and cut_nodes delegate the job just fine when dealing with hypergraphs). _cut_hypernodes and _cut_hyperedges are private now (as cut_edges and cut_nodes delegate the job just fine when dealing with hypergraphs). Nov 30, 2009 issue 44 (accessibility.py testing) Status changed by pmatiello - Done with r649. Status: Fixed Done with r649. Status: Fixed Nov 30, 2009 r649 (Testing cut-nodes/cut-edges in hypergraphs.) committed by pmatiello - Testing cut-nodes/cut-edges in hypergraphs. Testing cut-nodes/cut-edges in hypergraphs. Nov 30, 2009 r648 (Testing sparse graphs and some minor fixes (test names and p...) committed by pmatiello - Testing sparse graphs and some minor fixes (test names and printing). Testing sparse graphs and some minor fixes (test names and printing). Nov 30, 2009 r647 (Testing cut-nodes and cut-edges in graphs (fixed).) committed by pmatiello - Testing cut-nodes and cut-edges in graphs (fixed). Testing cut-nodes and cut-edges in graphs (fixed). Nov 30, 2009 issue 60 (Suggestion: G.nodes() and G.edges() should return an iterato...) commented on by salimfadhley - Not going to re-open, however I think the problem is that the default method is not great for large graphs. G.nodes() and g.edges() are the main ways of accessing every member of the whole graph. Returning a list is fine for len(G) < 1000, but once we start dealing with big graphs it's a pain. It's utterly horrible if the underlying storage for G is not in memory - you'd have to load in every record from an index or database to produce g.nodes(), even if you only wanted to do G.nodes()[:3] - IMO, this is an API design issue which limits the long-term usefulness of the classes which implement it. In general, I feel we should try to return iterators where possible, Not going to re-open, however I think the problem is that the default method is not great for large graphs. G.nodes() and g.edges() are the main ways of accessing every member of the whole graph. Returning a list is fine for len(G) < 1000, but once we start dealing with big graphs it's a pain. It's utterly horrible if the underlying storage for G is not in memory - you'd have to load in every record from an index or database to produce g.nodes(), even if you only wanted to do G.nodes()[:3] - IMO, this is an API design issue which limits the long-term usefulness of the classes which implement it. In general, I feel we should try to return iterators where possible, Nov 30, 2009 issue 60 (Suggestion: G.nodes() and G.edges() should return an iterato...) changed by pmatiello - I'm closing this issue, Salim. If you have any objection, feel free to reopen it. Status: Invalid Labels: Type-Enhancement −Type-Defect I'm closing this issue, Salim. If you have any objection, feel free to reopen it. Status: Invalid Labels: Type-Enhancement −Type-Defect Nov 30, 2009 r646 (Fixing hypergraph class docs. Removing unused imports.) committed by pmatiello - Fixing hypergraph class docs. Removing unused imports. Fixing hypergraph class docs. Removing unused imports. Nov 30, 2009 r645 (Adding credits to Anand. Stating project commiters.) committed by pmatiello - Adding credits to Anand. Stating project commiters. Adding credits to Anand. Stating project commiters. Nov 30, 2009 issue 61 (Delete edge function for hypergraphs) Status changed by christian.muise - Status: Fixed Status: Fixed Nov 30, 2009 issue 61 (Delete edge function for hypergraphs) commented on by christian.muise - Thanks anand! With a few bug fixes, it's currently put into r644. Marking as closed. Thanks anand! With a few bug fixes, it's currently put into r644. Marking as closed. Nov 30, 2009 r644 (Adding the ability to delete hyperedges, along with appropri...) committed by christian.muise - Adding the ability to delete hyperedges, along with appropriate testing. This closes issue 61 . Adding the ability to delete hyperedges, along with appropriate testing. This closes issue 61 . Nov 30, 2009 issue 49 (Bellman-Ford algorithm) commented on by anand.ib...@gmail.com - Oops..... my bad..am kinda newbie to googlecode... and the last time i was part of a programming team was almost 3 years ago at guess?? IBM ..ironically enough it is known for its process :D i will then take up some other issue then.. Oops..... my bad..am kinda newbie to googlecode... and the last time i was part of a programming team was almost 3 years ago at guess?? IBM ..ironically enough it is known for its process :D i will then take up some other issue then.. Nov 30, 2009 issue 49 (Bellman-Ford algorithm) commented on by tomaz.kovacic - Since it's status was labelled as "started" I thought it was obvious ;) It's nearly finished, but I'm very busy at he moment. Since it's status was labelled as "started" I thought it was obvious ;) It's nearly finished, but I'm very busy at he moment. Nov 30, 2009 issue 49 (Bellman-Ford algorithm) commented on by anand.ib...@gmail.com - Anyone working on this issue?? I would like to take it up next. Anyone working on this issue?? I would like to take it up next.

issue 60 (Suggestion: G.nodes() and G.edges() should return an iterato...) commented on by salimfadhley - Not going to re-open, however I think the problem is that the default method is not great for large graphs. G.nodes() and g.edges() are the main ways of accessing every member of the whole graph. Returning a list is fine for len(G) < 1000, but once we start dealing with big graphs it's a pain. It's utterly horrible if the underlying storage for G is not in memory - you'd have to load in every record from an index or database to produce g.nodes(), even if you only wanted to do G.nodes()[:3] - IMO, this is an API design issue which limits the long-term usefulness of the classes which implement it. In general, I feel we should try to return iterators where possible,

Not going to re-open, however I think the problem is that the default method is not great for large graphs. G.nodes() and g.edges() are the main ways of accessing every member of the whole graph. Returning a list is fine for len(G) < 1000, but once we start dealing with big graphs it's a pain. It's utterly horrible if the underlying storage for G is not in memory - you'd have to load in every record from an index or database to produce g.nodes(), even if you only wanted to do G.nodes()[:3] - IMO, this is an API design issue which limits the long-term usefulness of the classes which implement it. In general, I feel we should try to return iterators where possible,

Last 7 days

Last 30 days