7 Commits

Author	SHA1	Message	Date
Stefan van der Walt	bc8ab59966	graph: mcp: Clean up long lines. Fix tests.	2010-01-01 13:24:32 +02:00
Zachary Pincus	ad141b680d	Finish commits of changes to graph: __init__ and setup and remove old cruft.	2009-12-29 13:31:55 -05:00
Zachary Pincus	8b2a8b5031	Rewrite spath.shortest_path to use new mcp classes ... spath.shortest_path presents the same interface, but now uses the new mcp classes internally, which means that it is now fully n-d, and can also find the shortest path along any given axis. The old output format has been retained, but is a bit weird for non-2d arrays. A more sensible n-d output format is available, but not enabled by default.	2009-12-29 13:17:18 -05:00
Zachary Pincus	6f39426485	Added classes for minimum-cost-pathfinding through n-d arrays. ... mcp.py presents the interface and a simple usage example; the classes of interest are in _mcp.pyx. Basic tests are included.	2009-12-29 13:05:53 -05:00
Zachary Pincus	4741c113ca	Add fast binary heap classes (from Almar Klein) ... cython classes for fast binary heaps (that store (value, reference) pairs) are now available from scikits.image.graph.heap	2009-12-29 13:04:22 -05:00
Stefan van der Walt	dc6715bc08	trace_path: Add tests.	2009-11-22 13:20:41 +02:00
Stefan van der Walt	ab90617cbe	Rename analysis -> graph.	2009-11-04 07:52:51 +02:00