graph-implicit - algorithms for operating on implicitly-specified graphs

	Commit message (Collapse)	Author	Age	Files	Lines
*	cleanupsHEAD master	Jesse Luehrs	2010-01-02	1	-1/+1
\|
*	update Changes, and bump version0.03	Jesse Luehrs	2009-09-27	2	-1/+5
\|
*	switch to Heap::Fibonacci::Fast instead of Heap::Simple	Jesse Luehrs	2009-09-27	2	-9/+4
\|
*	update version number0.02	Jesse Luehrs	2009-06-30	1	-1/+1
\|
*	update Changes	Jesse Luehrs	2009-06-30	1	-0/+4
\|
*	make a note in the docs about installing Heap::Simple::XS	Jesse Luehrs	2009-06-30	1	-0/+4
\|
*	explicitly depend on Heap::Simple::Perl	Jesse Luehrs	2009-06-30	1	-0/+1
\| \| \| \| \| \| \|	just depending on Heap::Simple doesn't work, because Heap::Simple is just an interface class, and won't do anything without an implementation. it kinda sucks that the module author has to make this decision, but not really a good way around it.
*	add changelog	Jesse Luehrs	2009-06-30	1	-0/+4
\|
*	typo	Jesse Luehrs	2009-06-26	1	-1/+1
\|
*	i use Test::Deep	Jesse Luehrs	2009-06-24	1	-0/+1
\|
*	oops, Moose has nothing to do with this module	Jesse Luehrs	2009-06-21	1	-1/+1
\|
*	DESCRIPTION0.01	Jesse Luehrs	2009-06-21	1	-0/+19
\|
*	add some TODO items	Jesse Luehrs	2009-06-21	1	-0/+12
\|
*	make the dfs/bfs callback optional	Jesse Luehrs	2009-06-21	1	-1/+1
\|
*	document the methods	Jesse Luehrs	2009-06-21	1	-0/+71
\|
*	document constructor	Jesse Luehrs	2009-06-21	1	-0/+10
\|
*	vertices() and edges() require a vertex argument	Jesse Luehrs	2009-06-21	1	-2/+2
\|
*	add SYNOPSIS	Jesse Luehrs	2009-06-21	1	-12/+12
\|
*	turn make_path into a method	Jesse Luehrs	2009-06-21	2	-1/+2
\|
*	stub out some pod	Jesse Luehrs	2009-06-18	1	-5/+81
\|
*	modules don't need shebang	Jesse Luehrs	2009-06-18	1	-1/+0
\|
*	add test for dijkstra	Jesse Luehrs	2009-06-18	1	-0/+79
\|
*	add a test for solving the project euler problem	Jesse Luehrs	2009-05-17	1	-0/+128
\|
*	spanning tree tests shouldn't be using $traversal	doy	2009-02-07	1	-5/+5
\|
*	skip the mst tests, since the implementation is broken and i don't really ↵	doy	2009-02-07	1	-0/+3
\| \| \| \|	care about fixing it now
*	comment out functions i'm not planning on implementing for version 0.01	doy	2009-02-07	1	-23/+25
\|
*	add failing test - the algo for this fails with either directed graphs or ↵	doy	2009-02-07	1	-4/+6
\| \| \| \|	graphs with non-unique edge weights, need to look more into this
*	oops, edge calculator should return a list, not an arrayref	doy	2009-02-07	1	-1/+1
\|
*	initial mst test	doy	2009-02-07	1	-0/+80
\|
*	huh, didn't i add this before?	doy	2009-02-07	1	-0/+71
\|
*	add dist.ini	doy	2009-02-07	1	-0/+13
\|
*	add the starting vertex to the returned traversal tree	doy	2009-02-01	1	-0/+1
\|
*	reorganize the module a bit	doy	2008-12-15	1	-22/+22
\|
*	simplify edge calculation tests a bit	doy	2008-12-15	1	-16/+4
\|
*	remove testing comment	doy	2008-12-15	1	-1/+1
\|
*	add basic tests	doy	2008-12-15	1	-0/+65
\|
*	start adding tests	doy	2008-12-15	1	-0/+9
\|
*	implement prim in terms of _traversal	doy	2008-12-15	1	-2/+7
\|
*	refactor _traversal a bit to allow alternative bag data structures	doy	2008-12-15	1	-6/+10
\|
*	oops, need to add the edge here, not the vertex	doy	2008-12-15	1	-1/+1
\|
*	topological sort is another reasonable thing to implement	doy	2008-12-15	1	-0/+5
\|
*	add a helper function to build up a path from a hash of predecessors	doy	2008-12-15	1	-0/+12
\|
*	comment	doy	2008-12-14	1	-0/+2
\|
*	the edge calculator returns a pair of [vertex, weight], not just the vertex	doy	2008-12-14	1	-2/+2
\|
*	implement is_bipartite	doy	2008-12-14	1	-0/+20
\|
*	don't build the %pred hash if we aren't going to use it	doy	2008-12-14	1	-1/+1
\|
*	implement vertices and edges	doy	2008-12-14	1	-0/+10
\|
*	return the spanning tree generated by graph traversals	doy	2008-12-14	1	-5/+8
\|
*	we no longer store the path in the heap for dijkstra/astar	doy	2008-12-14	1	-1/+1
\|
*	todo comment	doy	2008-12-14	1	-0/+2
\|