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

Bug List

Class AbsMap
We need a unified way to handle the situation below:
       struct _UnConvertible {};
       template<class A> inline A t_abs(A a) {return _UnConvertible();}
       template<> inline int t_abs<>(int n) {return abs(n);}
       template<> inline long int t_abs<>(long int n) {return labs(n);}
       template<> inline long long int t_abs<>(long long int n) {return ::llabs(n);}
       template<> inline float t_abs<>(float n) {return fabsf(n);}
       template<> inline double t_abs<>(double n) {return fabs(n);}
       template<> inline long double t_abs<>(long double n) {return fabsl(n);}

Class AlterableUndirGraphExtender
This should be done some other way. Possibilities: template specialization (not very easy, if at all possible); some kind of enable_if boost technique?

Class BaseGraphComponent
This is not true. The minimal graph concept is the BaseIterableGraphComponent.

Member operator< (GraphItem) const
This is a technical requirement. Do we really need this?

Member ~SnapShot ()
Is it necessary?

Member erase (const Node &)
Exception...

Member erase (const Edge &)
Exception...

Class UnionFind
It is not clear what the constructor parameter is used for.

File unionfind.h
unionfind_test.cc doesn't work with Intel compiler. It compiles but fails to run (Segmentation fault).

Member findEdge (const Graph &g, typename Graph::Node u, typename Graph::Node v, typename Graph::Edge prev=INVALID)
Untested ...

Member kruskalEdgeMap_IteratorOut (const GR &G, const IN &in, RET out)
its name does not follow the coding style.

Generated on Sat Mar 19 10:58:46 2005 for LEMON by  doxygen 1.4.1