delta/python-packages/networkx.git/networkx/algorithms/mst.py, branch docdraft

Handle unorderable nodes in functions using heapq

2014-05-31T04:49:08+00:00

Dijkstra implementations in networkx.algorithms.centrality.betweenness
and networkx.algorithms.shortest_paths.weighted are affected. The Prim
implementation in networkx.algorithms.mst is also affected.

Although the A* implementation in astar.py already handles unorderable
nodes, it is also modified to avoid expensive hashing for tie breaking.

PEP8 format {betweenness,mst,test_weighted,weighted}.py with automation

2014-05-31T04:47:05+00:00

Even more imports cleanup and exceptions fixed.

2011-02-11T02:55:34+00:00

Change names to avoid conflicts

2011-01-16T15:06:56+00:00

Even better while loops.

2010-11-17T01:23:09+00:00

Addresses #421

Better while loop in prim_mst_edges.

2010-10-24T14:40:16+00:00

Added Prim's algorithm for mst. Fixes #421

2010-10-24T03:20:00+00:00

Update (failing) MST doctests

2010-10-18T14:53:38+00:00

Allow speification of attribute to use as weight in MST.

2010-10-17T03:57:44+00:00

Allow optional data=True|False keyword for mst edges.
Propagate all graph/node/edge attributes of original graph to spanning tree.
Fixes #416

Add nx prefix to doctests

2010-08-21T01:06:02+00:00

--HG--
extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%401931