Todo List

Class _FixId
This might be implemented to be also usable in other places.

Member lemon::_FixId::insert (int n)
Multiple additions should also be handled.

Member lemon::_FixId::insert (int n)
Create an own exception type.

Member lemon::_FixId::maxFixId ()
Do we need this?

Class BellmanFordWizardBase
More named parameters are required...

Member lemon::Bfs::create_maps ()
Better memory allocation (instead of new).

Member lemon::BfsDefaultTraits::ProcessedMap
named parameter to set this type, function to read and write.

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

Member lemon::BfsDefaultTraits::createPredMap (const GR &G)
The graph alone may be insufficient to initialize

Member lemon::BfsWizardDefaultTraits::ProcessedMap
named parameter to set this type, function to read and write.

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

Member lemon::BfsWizardDefaultTraits::createPredMap (const GR &g)
The graph alone may be insufficient to initialize

Class BpUGraph::ANodeMap
Wrong documentation

Class BpUGraph::BNodeMap
Wrong documentation

Class BpUGraph::EdgeMap
Wrong documentation

Class BpUGraph::NodeMap
Wrong documentation

Class BpUGraph::UEdgeMap
Wrong documentation

Class CombineMap
Check the requirements.

Class ComposeMap
Check the requirements.

Class ConstMap
set could be used to set the value.

Class Counter
More doc

Member lemon::Counter::SubCounter
document please.

Member lemon::Counter::SubNoCounter
document please.

Member lemon::DagLongestPathTraits::createPredMap (const _Graph &graph)
The graph alone may be insufficient for the initialization

Member lemon::DagShortestPathDefaultTraits::createPredMap (const _Graph &graph)
The graph alone may be insufficient for the initialization

Class DagShortestPathWizardBase
More named parameters are required...

Member lemon::Dfs::create_maps ()
Better memory allocation (instead of new).

Member lemon::DfsDefaultTraits::ProcessedMap
named parameter to set this type, function to read and write.

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

Member lemon::DfsDefaultTraits::createPredMap (const GR &G)
The graph alone may be insufficient to initialize

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

Member lemon::DfsWizardDefaultTraits::ProcessedMap
named parameter to set this type, function to read and write.

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

Member lemon::DfsWizardDefaultTraits::createPredMap (const GR &g)
The graph alone may be insufficient to initialize

Member lemon::Dijkstra::create_maps ()
Better memory allocation (instead of new).

Member lemon::DijkstraDefaultTraits::ProcessedMap
If it is set to a real map, Dijkstra::processed() should read this.

Member lemon::DijkstraDefaultTraits::ProcessedMap
named parameter to set this type, function to read and write.

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

Class DijkstraWizardBase
More named parameters are required...

Member lemon::DijkstraWizardDefaultTraits::ProcessedMap
If it is set to a real map, Dijkstra::processed() should read this.

Member lemon::DijkstraWizardDefaultTraits::ProcessedMap
named parameter to set this type, function to read and write.

Member lemon::DijkstraWizardDefaultTraits::createHeapCrossRef (const GR &G)
The graph alone may be insufficient for the initialization

Member lemon::DijkstraWizardDefaultTraits::createPredMap (const GR &g)
The graph alone may be insufficient for the initialization

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

Class EulerIt
Test required

Class FloydWarshall
A function type interface would be nice.

Class FloydWarshall
Implement nextNode() and nextEdge()

Member lemon::FloydWarshall::DistMap
It should rather be called DistMatrix

Member lemon::FloydWarshallDefaultTraits::createPredMap (const _Graph &graph)
The graph alone may be insufficient for the initialization

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 lemon::GraphToEps::nodePsTexts (const X &x)
Offer the choise not to move to the centre but pass the coordinates to the Postscript block inserted.

Member lemon::GraphToEps::negateY (bool b=true)
More docs.

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

Member lemon::GraphToEps::run ()
better 'epsilon' would be nice here.

Member lemon::GraphToEps::run ()
better 'epsilon' would be nice here.

Member lemon::GraphToEps::run ()
better 'epsilon' would be nice here.

Member lemon::GraphToEps::run ()
better 'epsilon' would be nice here.

Member lemon::JohnsonDefaultTraits::createPredMap (const Graph &graph)
The graph alone may be insufficient for the initialization

Member lemon::ListGraph::split (Node n, bool connect=true)
It could be implemented in a bit faster way.

Member lemon::LpGlpk::LpGlpk ()
constrol function for this:

Member lemon::LpGlpk::_solve ()
It should be clarified

Member lemon::LpGlpk::_getPrimalStatus ()
It should be clarified

Class LpSolverBase
Much more docs

Member lemon::LpSolverBase::row (Row r, Value l, const Expr &e, Value u)
Option to control whether a constraint with a single variable is added or not.

Member lemon::LpSolverBase::eraseCol (Col c)
Please check this

Member lemon::LpSolverBase::eraseRow (Row r)
Please check this

Member lemon::LpSolverBase::solve ()
Which method is used to solve the problem

Member lemon::LpSolverBase::UNDEFINED
NOTFOUND might be a better name.

Member lemon::LpSolverBase::INFINITE
Give a feasible solution and an infinite ray (and the corresponding bases)

Member lemon::LpSolverBase::_copyLp ()
This should be implemented here, too, when we have problem retrieving routines. It can be overriden.

Member lemon::LpSolverBase::_getProblemType ()=0
This could be implemented here, too, using _getPrimalStatus() and _getDualStatus()

Class LpSolverBase::Col
Document what can one do with a Col (INVALID, comparing, it is similar to Node/Edge)

Member operator<=
Create an own exception type.

Member operator<=
Create an own exception type.

Member operator>=
Create an own exception type.

Member operator>=
Create an own exception type.

Class LpSolverBase::Row
Document what can one do with a Row (INVALID, comparing, it is similar to Node/Edge)

Member lemon::concepts::MappableBpUGraphComponent::ANodeMap::ANodeMap (const MappableBpUGraphComponent &graph)
call the right parent class constructor

Member lemon::concepts::MappableBpUGraphComponent::BNodeMap::BNodeMap (const MappableBpUGraphComponent &graph)
call the right parent class constructor

Member lemon::concepts::MappableGraphComponent::EdgeMap::EdgeMap (const MappableGraphComponent &graph)
call the right parent class constructor

Member lemon::concepts::MappableGraphComponent::NodeMap::NodeMap (const MappableGraphComponent &graph)
call the right parent class constructor

Member lemon::concepts::MappableUGraphComponent::UEdgeMap::UEdgeMap (const MappableUGraphComponent &graph)
call the right parent class constructor

Member lemon::MipCplex::MipCplex ()
The constant CPXPROB_MIP is called CPXPROB_MILP in later versions

Class MipSolverBase
Much more docs

Class Path
Thoroughfully check all the range and consistency tests.

Class Preflow
Second template parameter is superfluous

Member lemon::SmartGraph::split (Node n, bool connect=true)
It could be implemented in a bit faster way.

Member lemon::SspMinCostFlow::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 lemon::SspMinCostFlow::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 lemon::SspMinCostFlow::checkComplementarySlackness ()
better comparison is needed for real types, moreover, this comparison here is superfluous.

Class StdMap
Provide allocator parameter...

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

Class TimeReport
There is no test case for this

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

Class UEulerIt
Test required

Member lemon::UndirGraphExtender::direction (const Edge &e)
reference to the corresponding point of the undirected graph concept. "What does the direction of an undirected edge mean?"

File utility.h
Please rethink the organisation of the basic files like this. E.g. this file might be merged with invalid.h.

File dijkstra.h
dijkstraZero() solution should be revised.

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

Member LEMON_ASSERT
This whole 'assert' business should be placed in a separate include file. The boost assert is not guarded by header sentries which may help to change the behaviour of the assertions in the files.

Member LEMON_ASSERT
__PRETTY_FUNCTION__ should be replaced by something compiler-independent, like BOOST_CURRENT_FUNCTION

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

Member LEMON_FIXME
__PRETTY_FUNCTION__ should be replaced by something compiler-independent, like BOOST_CURRENT_FUNCTION

File kruskal.h
The file still needs some clean-up.

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

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

File path.h
Iterators have obsolete style

File refptr.h
Undocumented

File simann.h
A test and some demo should be added

File simann.h
Doc should be improved

File tolerance.h
It should be in a module like "Basic tools"

Member check
It should be in error.h

Member convertMap
The order of the template parameters are changed.

Member addMap
How to call these type of functions?

Member addMap
Wrong scope in Doxygen when \relates is used

Member shiftMap
A better name is required.

Member scaleMap
A better name is required.

Member forkMap
How to call these type of functions?

Member forkMap
Wrong scope in Doxygen when \relates is used

Member countNodes
refer how to specialize it

Member countANodes
refer how to specialize it

Member countBNodes
refer how to specialize it

Member euler
Test required

Member biNodeConnected
Make it faster.

Member biEdgeConnected
Make it faster.

Member kruskal
Discuss the case of undirected graphs: In this case the algorithm also require Edges instead of UEdges, as some people would expect. So, one should be careful not to add both of the Edges belonging to a certain UEdge. (kruskal() and KruskalMapInput are kind enough to do so.)

Page Algorithms
demo for bfs advanced control

Page Graphs
Write a new Graphs page. I think it should be contain the Graph, UGraph and BpUGraph concept. It should be describe the iterators and the basic functions and the differences of the implementations.

Some cross-refs are wrong.

Page Graphs
Don't we need SmartNodeSet and SmartEdgeSet?

Generated on Tue Oct 31 09:49:38 2006 for LEMON by  doxygen 1.5.1