Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

Todo List

Class AlterableGraphExtender
Document what "alteration observing" is. And probably find a better (shorter) name.

Class AlterableUndirGraphExtender
Document.

Class BinHeap
Please document...

Member state_enum
it is used nowhere

Class ComposeMap
Check the requirements.

Class ConstMap
set could be used to set the value.

Member _file
Much better solution is boost::shared_ptr

Class Dijkstra
A compare object would be nice.

Member init ()
_heap_map's type could also be in the traits class.

Member init ()
*_reached is not set to false.

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

Member ReachedMap
If it is set to a real map, Dijkstra::reached() should read this.

Member ReachedMap
named parameter to set this type, function to read and write.

Member createPredMap (const GR &G)
The graph alone may be insufficient for the initialization

Class DirPath
Thoroughfully check all the range and consistency tests.

Member buf
The good solution is boost:shared_ptr...

Member clear ()
It might belong to ErasableGraph.

Member clear ()
It might belong to ErasableGraph.

Class GraphIncIterator
Is this a good name for this concept?

Member GraphIterator ()
Don't we need the Item type as typedef?

Class GraphToEps
Is 'helper class' a good name for this?

Class GraphToEps
Follow PostScript's DSC. Use own dictionary.

Class GraphToEps
Useful new features.

Member nodePsTexts (const X &x)
Offer the choise not to move to the centre but pass the coordinates to the Postscript block inserted.

Member enableParallel (bool b=true)
Partially implemented

Member copyright (const std::string &t)
Multiline copyright notice could be supported.

Member run ()
: Chech whether the graph is empty.

Member reserveEdge (int n)
more docs...

Class ListGraph::SnapShot
SnapShot or Snapshot?

Member restore ()
This function might be called undo().

Member EdgeMap (const Graph &)
call the right parent class constructor

Member NodeMap (const Graph &)
call the right parent class constructor

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

Member run (int k)
If the actual flow value is bigger than k, then everything is cleared and the algorithm starts from zero flow. Is it a good approach?

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

Member findEdge (Node u, Node v, Edge prev=INVALID)
Possibly it should be a global function.

Member restore ()
This function might be called undo().

Class StaticGraph
A pages describing the concept of concept description would be nice.

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

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

Member id (const SymEdge &) 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 symEdgeNum () 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.

Member operator< (SymEdge) 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 Timer
This shouldn't be Unix (Linux) specific.

Class True
This should go to a separate "basic_types.h" (or something) file.

Member forward (Edge) const
"What does the direction of an undirected edge mean?"

Member oppositeNode (Node, UndirEdge) const
What should we do if given Node and Edge are not incident?

Class UndirListGraph
SnapShot, reverseEdge(), moveTarget(), moveSource(), contract() haven't been implemented yet.

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 UndirSmartGraph
SnapShot hasn't been implemented yet.

File bfs.h
Revise Manual.

File bin_heap.h
It should be documented.

File dfs.h
Revise Manual.

Member LEMON_ASSERT (exp, msg)
We should provide some way to reset to the default behaviour, shouldn't we?

Member LEMON_ASSERT (exp, msg)
This whole 'assert' business should be placed in a separate include file.

Member LEMON_ASSERT (exp, msg)
__PRETTY_FUNCTION__ should be replaced by something compiler-independant, like BOOST_CURRENT_FUNCTION

Member LEMON_FIXME (msg)
Is this the right place for this? It should be used only in modules under development.

Member LEMON_FIXME (msg)
__PRETTY_FUNCTION__ should be replaced by something compiler-independant, like BOOST_CURRENT_FUNCTION

File graph_utils.h
Please revise the documentation.

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

File path.h
Iterators have obsolete style

File path.h
Iterators have obsolete style

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

Namespace lemon
Some more detailed description would be nice here.

Namespace lemon
fix exceptions

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

Member addMap (const M1 &m1, const M2 &m2)
How to call these type of functions?

Member addMap (const M1 &m1, const M2 &m2)
Wrong scope in Doxygen when \relates is used

Member shiftMap (const M &m, const typename M::Value &v)
A better name is required.

Member scaleMap (const M &m, const typename M::Value &v)
A better name is required.

Member countNodes (const Graph &g)
refer how to specialize it

Member findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge prev=INVALID)
We may want to use the GraphBase interface here...

Member countOutEdges (const Graph &_g, const typename Graph::Node &_n)
Please document.

Member countInEdges (const Graph &_g, const typename Graph::Node &_n)
Please document.

Member dijkstra (const GR &g, const LM &l, typename GR::Node s=INVALID)
Please document...

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

Page How to use graphs
Some cross-refs are wrong.

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

Generated on Mon Feb 21 15:02:28 2005 for LEMON by  doxygen 1.4.1