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 _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?

Member lemon::concept::_StaticGraph::UndirTag
undocumented

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

Class AlterableUndirGraphExtender
Document.

Class Bfs
A compare object would be nice.

Member lemon::Bfs::getPath (P &p, Node t)
Is it the right way to handle unreachable nodes?
Returns:
Returns true if a path to t was actually copied to p, false otherwise.
See also:
DirPath

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

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 CombineMap
Check the requirements.

Class ComposeMap
Check the requirements.

Class ConstMap
set could be used to set the value.

Class Dfs
A compare object would be nice.

Member lemon::Dfs::getPath (P &p, Node t)
Is this the right way to handle unreachable nodes?

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

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::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

Class Dijkstra
A compare object would be nice.

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

The heaps should be able to make themselves empty directly.

Member lemon::Dijkstra::getPath (P &p, Node t)
Is it the right way to handle unreachable nodes?
Returns:
Returns true if a path to t was actually copied to p, false otherwise.
See also:
DirPath

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

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

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.

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

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

Class DirPath
Thoroughfully check all the range and consistency tests.

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

Member lemon::concept::ExtendableGraph::clear ()
It might belong to ErasableGraph.

Member lemon::GraphAdaptorBase::BaseGraph
Is it needed?

Class GraphIncIterator
Is this a good name for this concept?

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

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

Useful new features.

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

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::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::concept::IterableGraphComponent::oppositeNode (const Node &, const Edge &) const
It should not be here.

Member lemon::ListGraph::reserveEdge (int n)
more docs...

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

Class ListGraph::SnapShot
SnapShot or Snapshot?

Member lemon::ListGraph::SnapShot::restore ()
This function might be called undo().

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::setRow (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.

Member lemon::LpSolverBase::DualExpr::operator+= (const DualExpr &e)
it might be speeded up using "hints"

Member operator+
Doesn't STL have some special 'merge' algorithm?

Member operator-
Doesn't STL have some special 'merge' algorithm?

Member operator *
Doesn't STL have some special 'merge' algorithm?

Member operator *
Doesn't STL have some special 'merge' algorithm?

Member operator/
Doesn't STL have some special 'merge' algorithm?

Member lemon::LpSolverBase::Expr::operator+= (const Expr &e)
it might be speeded up using "hints"

Member operator+
Doesn't STL have some special 'merge' algorithm?

Member operator-
Doesn't STL have some special 'merge' algorithm?

Member operator *
Doesn't STL have some special 'merge' algorithm?

Member operator *
Doesn't STL have some special 'merge' algorithm?

Member operator/
Doesn't STL have some special 'merge' algorithm?

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

Member lemon::concept::MappableGraphComponent::EdgeMap::EdgeMap (const Graph &)
call the right parent class constructor

Member lemon::concept::MappableGraphComponent::NodeMap::NodeMap (const Graph &)
call the right parent class constructor

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

Class Preflow
Second template parameter is superfluous

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

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

Member lemon::SmartGraph::SnapShot::restore ()
This function might be called undo().

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

Member lemon::concept::StaticGraph::UndirTag
undocumented

Class StaticGraph::EdgeMap
Wrong documentation

Class StaticGraph::NodeMap
Wrong documentation

Class StdMap
Provide allocator parameter...

Member lemon::SubBidirGraphAdaptorBase::Edge::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 lemon::concept::UndirGraph::UndirTag
undocumented

Class UndirGraph::EdgeMap
Wrong documentation

Class UndirGraph::NodeMap
Wrong documentation

Class UndirGraph::UndirEdgeMap
Wrong documentation

Class UndirListGraph
SnapShot, reverseEdge(), changeTarget(), changeSource(), 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 dijkstra.h
getPath() should be implemented! (also for BFS and DFS)

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.

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 concept/, and this is not easily detectable in docs...

File path.h
Iterators have obsolete style

File path.h
Iterators have obsolete style

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

Doc should be improved

Author:
Akos Ladanyi

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

Member check
It should be in error.h

Namespace lemon
Some more detailed description would be nice here.

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

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 kruskal
Discuss the case of undirected graphs: In this case the algorithm also require Edges instead of UndirEdges, as some people would expect. So, one should be careful not to add both of the Edges belonging to a certain UndirEdge. (kruskal() and KruskalMapInput are kind enough to do so.)

Page 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 Sat Aug 27 14:14:56 2005 for LEMON by  doxygen 1.4.4