- 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::BfsVisitDefaultTraits::ReachedMap
- named parameter to set this type, function to read and write.
- 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 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.
- Linestyles: dotted, dashed etc.
- A second color and percent value for the lines.
- 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::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::LpCplex::_getRowCoeffs (int i, RowIterator b) const
- implement
- Member lemon::LpGlpk::LpGlpk (const LpGlpk &)
- control function for this:
- Member lemon::LpGlpk::_solve ()
- It should be clarified
- Member lemon::LpGlpk::_getPrimalStatus () const
- 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::getRowBounds (Row c, Value &lower, Value &upper) const
- There is no separate function for the lower and the upper bound because we had problems with the implementation of the setting functions for CPLEX: check out whether this can be done for these functions.
- 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)
- 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::MipCplex::MipCplex ()
- The constant CPXPROB_MIP is called CPXPROB_MILP in later versions
- Class MipSolverBase
- Much more docs
- Member lemon::Random::gauss ()
- Consider using the "ziggurat" method instead.
- Class ReferenceMap
- Rethink this concept.
- Class SimpleMap
- Revise the misleading name
- Class SimpleWriteMap
- Revise the misleading name
- Member lemon::SmartGraph::split (Node n, bool connect=true)
- It could be implemented in a bit faster way.
- 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 dist_log.h
- Needs lot more docs
- 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 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 addMap
- How to call these type of functions?
- Member euler
- Test required
- Page Algorithms
- Demo for Bfs advanced control.
- Page Algorithms
- Check the linking of the demo file, the code samples are missing.
- 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.
- Page Graphs
- Don't we need SmartNodeSet and SmartEdgeSet?
- Page Graphs
- Some cross-refs are wrong.
Generated on Sat Apr 19 14:16:56 2008 for LEMON by
1.5.5