Todo List

Member state_enum
it is used nowhere

Class ConstMap
set could be used to set the value.

Class Dijkstra
We need a typedef-names should be standardized. (-:

Type of PredMap, PredNodeMap and DistMap should not be fixed. (Problematic to solve).

Member pred (Node v) const
predEdge could be a better name.

Class DirPath
Thoroughfully check all the range and consistency tests.

Class EdgeSet
Make it possible to add/delete edges from the base graph (and from EdgeSet, as well)

Member clear ()
It might belong to ErasableGraph.

Class FullGraph
What about loops?

Don't we need SymEdgeMap?

Member run (Node s, Node t, int k)
May be it does make sense to be able to start with a nonzero feasible primal-dual solution pair as well.

Member checkComplementarySlackness ()
better comparison is needed for real types, moreover, this comparison here is superfluous.

Class SmartGraph
Some member functions could be static.

A possibly useful functionality: a function saveState() would give back a data sturcture X and then the function restoreState(X) would remove the nodes and edges added after the call of saveState(). Of course it should be used as a stack. (Maybe X is not necessary.)

Member id (const Node &) const
Should each graph provide id?

Member id (const Edge &) const
Should each graph provide id?

Member nodeNum () const
Should it be in the concept?

Member edgeNum () const
Should it be in the concept?

Member operator< (Edge) const
Possibly we don't need it.

Member operator< (Node) const
Possibly we don't need it.

Class StdMap
Provide allocator parameter...

Member Edge (const typename Graph::Edge &e, bool _backward)
=false is needed, or causes problems? If _backward is false, then we get an edge corresponding to the original one, otherwise its oppositely directed pair is obtained.

Class SymListGraph
this date structure need some reconsiderations. Maybe it should be implemented independently from ListGraph.

Class Timer
This shouldn't be Unix (Linux) specific.

Class UndirPath
Thoroughfully check all the range and consistency tests.

Class UndirPath::EdgeIt
Its interface differs from the standard edge iterator. Yes, it shouldn't.

Class UndirPath::NodeIt
Its interface differs from the standard node iterator. Yes, it shouldn't.

Class VectorMap
It should use a faster initialization using the maxNodeId() or maxEdgeId() function of the graph instead of iterating through each edge/node.

File bfs.h
Revise Manual.

File bin_heap.h
It should be documented.

File dfs.h
Revise Manual.

File maps.h
This file has the same name as the concept file in skeletons, and this is not easily detectable in docs...

Member check (rc, msg)
It should be in error.h

Namespace lemon
Some more detailed description would be nice here.

Namespace lemon::skeleton
Some more detailed description would be nice here.

Page How to use graphs
Don't we need SmartNodeSet and SmartEdgeSet?

Some cross-refs are wrong.

Page Maps
For this, MapBase seems to be a better name then NullMap.

Generated on Thu Sep 30 12:18:36 2004 for LEMON by doxygen 1.3.8