Changeset 921:818510fa3d99 in lemon-0.x for src/work/athos/old/minlengthpaths.h
- Timestamp:
- 09/29/04 17:30:04 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/athos/old/minlengthpaths.h
r607 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_MINLENGTHPATHS_H3 #define HUGO_MINLENGTHPATHS_H2 #ifndef LEMON_MINLENGTHPATHS_H 3 #define LEMON_MINLENGTHPATHS_H 4 4 5 5 ///\ingroup galgs … … 8 8 9 9 #include <iostream> 10 #include < hugo/dijkstra.h>11 #include < hugo/graph_wrapper.h>12 #include < hugo/maps.h>10 #include <lemon/dijkstra.h> 11 #include <lemon/graph_wrapper.h> 12 #include <lemon/maps.h> 13 13 #include <vector> 14 14 15 15 16 namespace hugo{16 namespace lemon { 17 17 18 18 /// \addtogroup galgs … … 22 22 /// of minimal total length 23 23 /// 24 /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements24 /// The class \ref lemon::MinLengthPaths "MinLengthPaths" implements 25 25 /// an algorithm for finding k edge-disjoint paths 26 26 /// from a given source node to a given target node in an … … 198 198 ///@} 199 199 200 } //namespace hugo201 202 #endif // HUGO_MINLENGTHPATHS_H200 } //namespace lemon 201 202 #endif //LEMON_MINLENGTHPATHS_H
Note: See TracChangeset
for help on using the changeset viewer.