jacint [Fri, 04 Nov 2005 13:53:22 +0000] rev 1762
throwing an exception if s=t
deba [Fri, 04 Nov 2005 13:20:24 +0000] rev 1761
Hiding :) todos
klao [Fri, 04 Nov 2005 12:01:40 +0000] rev 1760
concept/graph.h: graphs defined by using components (_*Graph) need no
documentation
deba [Fri, 04 Nov 2005 10:55:13 +0000] rev 1759
Increment and decrement operator for IterableIntMap::Reference
deba [Fri, 04 Nov 2005 10:51:35 +0000] rev 1758
Doc fix
alpar [Wed, 02 Nov 2005 16:43:18 +0000] rev 1757
Spellcheck
alpar [Wed, 02 Nov 2005 16:32:29 +0000] rev 1756
GRAPH_TYPEDEFS and UNDIRGRAPH_TYPEDEFS macros added to graph_utils.h.
deba [Wed, 02 Nov 2005 15:28:37 +0000] rev 1755
Make constructor explicit
Indentation changed
deba [Wed, 02 Nov 2005 15:27:38 +0000] rev 1754
Documentation modified
deba [Wed, 02 Nov 2005 15:26:04 +0000] rev 1753
Some change on the clear
deba [Wed, 02 Nov 2005 15:25:13 +0000] rev 1752
IterableIntMap
todo: documentation need
deba [Wed, 02 Nov 2005 15:24:38 +0000] rev 1751
Swap col and row map
deba [Wed, 02 Nov 2005 15:23:46 +0000] rev 1750
Connected components, etc...
Based on the dfs visitor interface
deba [Wed, 02 Nov 2005 15:22:28 +0000] rev 1749
Visitor interface for the dfs algorithm.
klao [Wed, 02 Nov 2005 12:44:50 +0000] rev 1748
small svn:ignore fixups
deba [Fri, 28 Oct 2005 09:01:59 +0000] rev 1747
Faster implementation
deba [Fri, 28 Oct 2005 08:40:42 +0000] rev 1746
If the file does not exist LemonReader throws exception
deba [Wed, 26 Oct 2005 11:10:18 +0000] rev 1745
Upgrading tests
deba [Wed, 26 Oct 2005 11:09:29 +0000] rev 1744
Removing old input/output functions
deba [Wed, 26 Oct 2005 10:59:51 +0000] rev 1743
Filename can be given as std::string
deba [Wed, 26 Oct 2005 10:52:09 +0000] rev 1742
Show description of the file
deba [Wed, 26 Oct 2005 10:50:47 +0000] rev 1741
Some modifications on shortest path algoritms:
- heap traits
- checked execution
deba [Mon, 24 Oct 2005 17:03:02 +0000] rev 1740
Bug fix in connectedComponents
Strongly connected components
alpar [Mon, 24 Oct 2005 15:59:38 +0000] rev 1739
Computing the number of the connected components and the components themselves.