18
I Use This!
High Activity

Commits : Listings

Analyzed about 21 hours ago. based on code collected about 22 hours ago.
May 26, 2023 — May 26, 2024
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Replace tabs with spaces in base.py
Dan Schult
as dschult
More... about 18 years ago
comments added, dead_code removed in bidirectional_shortest_path2 More... about 18 years ago
Minor doc changes and removing **kwds unless needed (as per style guide). Also rewrite of cluster.py to discontinue neighbors(...,with_label=True)
Dan Schult
as dschult
More... about 18 years ago
Rewrite code that uses neighbors(...,with_labels=True) to see how much of a pain it is to use edges instead of neighbors. I don't see any deficiency created by getting rid of the with_labels keyword on neighbors(). I'll start working on doing that in base.py and xbase.py if no one objects.
Dan Schult
as dschult
More... about 18 years ago
I looked through the classic.py generators in response to trac ticket #39. Only two had clear edge directions: path_graph and cycle_graph. We create the nodes as ints so without loss of generality the paths and cycles get directed up the nodes. Some test updates too. This should close ticket #39.
Dan Schult
as dschult
More... about 18 years ago
Speedup for bidirectional_shortest_path2. Now faster than bidirectional_shortest_path More... about 18 years ago
Small update to bidirectional_path_2 More... about 18 years ago
alternative rewire algorithms double_edge_swap connected_double_edge_swap that attempt to use less memory by choosing edges without generating an edge list. More... about 18 years ago
change name to bidirectional_shortest_path added alternative bidirectional_shortest_path2 that is the same algorithm in a different coding style More... about 18 years ago
add explicit periodic=True keyword in test of 2d_grid_graph More... about 18 years ago
Added s-metric from lun-2005 (see code) and code that generates a graph with maximal s-metric from a degree sequence. More... about 18 years ago
Test code now tests generator code by default. Fixed some generator tests. Added random rewire code and random rewire for connected graphs More... about 18 years ago
Small bug-fix shortest-path Increase readability of dijkstra_bi and added some improvements More... about 18 years ago
Fixed an error and updated tests for shortest_path_bi More... about 18 years ago
Determined level-wise was faster than previous que based approach for bidirectional search. Incorporated speedups from Dan Schultz. Also some slight memory reduction. More... about 18 years ago
In regard to discussions with Sverre Sundsdal I put in a second version of shortest_path_bi called shortest_path_bi2 for speed testing. I will remove it when testing is done.
Dan Schult
as dschult
More... about 18 years ago
Faster is_connected() More... about 18 years ago
Added bidirectional version of shortest_path and dijkstra. They should be a lot faster the the unidirectional ones. More... about 18 years ago
hack: pass **kwds through complete graph so I can generate a complete XGraph() More... about 18 years ago
subgraph methods in XGraph and XDiGraph should use simpler code to demolish nodes for inplace=True like in base.py More... about 18 years ago
another version of subgraph that is More... about 18 years ago
Avoid checking explicitly for iterator and making a copy to nbunch dictionary in subgraph. More... about 18 years ago
hack iterable to check for __iter__ as well as len() to work with python2.5 More... about 18 years ago
bad numbering, should be networkx-0.30-svn More... about 18 years ago
networkx-0.29-svn More... about 18 years ago
update for release 0.29 More... about 18 years ago
documentation formatting More... about 18 years ago
Fixed typos. Added some documentation. More... about 18 years ago
eccentricity raises exception for disconnected graphs fixes #35 More... about 18 years ago
use numpy if available or else try Numeric If neither, attempt to fail gracefully and allow tests to run correctly in that case More... about 18 years ago