Changeset 921:818510fa3d99 in lemon-0.x for src/work/marci/experiment
- Timestamp:
- 09/29/04 17:30:04 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
- Location:
- src/work/marci/experiment
- Files:
-
- 12 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/marci/experiment/bfs_iterator.h
r281 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_BFS_ITERATOR_H3 #define HUGO_BFS_ITERATOR_H2 #ifndef LEMON_BFS_ITERATOR_H 3 #define LEMON_BFS_ITERATOR_H 4 4 5 5 #include <queue> … … 8 8 #include <graph_wrapper.h> 9 9 10 namespace hugo{10 namespace lemon { 11 11 12 12 // template <typename Graph> … … 837 837 838 838 839 } // namespace hugo840 841 #endif // HUGO_BFS_ITERATOR_H839 } // namespace lemon 840 841 #endif //LEMON_BFS_ITERATOR_H -
src/work/marci/experiment/bfs_iterator_1.h
r298 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_BFS_ITERATOR_H3 #define HUGO_BFS_ITERATOR_H2 #ifndef LEMON_BFS_ITERATOR_H 3 #define LEMON_BFS_ITERATOR_H 4 4 5 5 #include <queue> … … 8 8 #include <graph_wrapper_1.h> 9 9 10 namespace hugo{10 namespace lemon { 11 11 12 12 // template <typename Graph> … … 832 832 833 833 834 } // namespace hugo835 836 #endif // HUGO_BFS_ITERATOR_H834 } // namespace lemon 835 836 #endif //LEMON_BFS_ITERATOR_H -
src/work/marci/experiment/edmonds_karp.h
r281 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_EDMONDS_KARP_H3 #define HUGO_EDMONDS_KARP_H2 #ifndef LEMON_EDMONDS_KARP_H 3 #define LEMON_EDMONDS_KARP_H 4 4 5 5 #include <algorithm> … … 10 10 #include <invalid.h> 11 11 12 namespace hugo{12 namespace lemon { 13 13 14 14 template<typename Graph, typename Number, typename FlowMap, typename CapacityMap> … … 1234 1234 1235 1235 1236 } // namespace hugo1237 1238 #endif // HUGO_EDMONDS_KARP_H1236 } // namespace lemon 1237 1238 #endif //LEMON_EDMONDS_KARP_H -
src/work/marci/experiment/edmonds_karp_1.h
r298 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_EDMONDS_KARP_H3 #define HUGO_EDMONDS_KARP_H2 #ifndef LEMON_EDMONDS_KARP_H 3 #define LEMON_EDMONDS_KARP_H 4 4 5 5 #include <algorithm> … … 11 11 #include <graph_wrapper_1.h> 12 12 13 namespace hugo{13 namespace lemon { 14 14 15 15 template<typename Graph, typename Number, typename FlowMap, typename CapacityMap> … … 1144 1144 1145 1145 1146 } // namespace hugo1147 1148 #endif // HUGO_EDMONDS_KARP_H1146 } // namespace lemon 1147 1148 #endif //LEMON_EDMONDS_KARP_H -
src/work/marci/experiment/edmonds_karp_demo.cc
r281 r921 15 15 }; 16 16 17 using namespace hugo;17 using namespace lemon; 18 18 19 19 // Use a DIMACS max flow file as stdin. -
src/work/marci/experiment/edmonds_karp_demo_1.cc
r281 r921 15 15 }; 16 16 17 using namespace hugo;17 using namespace lemon; 18 18 19 19 // Use a DIMACS max flow file as stdin. -
src/work/marci/experiment/graph_wrapper.h
r880 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_GRAPH_WRAPPER_H3 #define HUGO_GRAPH_WRAPPER_H2 #ifndef LEMON_GRAPH_WRAPPER_H 3 #define LEMON_GRAPH_WRAPPER_H 4 4 5 5 #include <invalid.h> 6 6 7 namespace hugo{7 namespace lemon { 8 8 9 9 template<typename Graph> … … 1702 1702 // }; 1703 1703 1704 } //namespace hugo1705 1706 #endif // HUGO_GRAPH_WRAPPER_H1707 1704 } //namespace lemon 1705 1706 #endif //LEMON_GRAPH_WRAPPER_H 1707 -
src/work/marci/experiment/graph_wrapper_1.h
r880 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_GRAPH_WRAPPER_H3 #define HUGO_GRAPH_WRAPPER_H2 #ifndef LEMON_GRAPH_WRAPPER_H 3 #define LEMON_GRAPH_WRAPPER_H 4 4 5 5 #include <invalid.h> 6 6 7 namespace hugo{7 namespace lemon { 8 8 9 9 template<typename Graph> … … 1343 1343 // }; 1344 1344 1345 } //namespace hugo1346 1347 #endif // HUGO_GRAPH_WRAPPER_H1348 1345 } //namespace lemon 1346 1347 #endif //LEMON_GRAPH_WRAPPER_H 1348 -
src/work/marci/experiment/graph_wrapper_st_ostream_op.h
r445 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_GRAPH_WRAPPER_H3 #define HUGO_GRAPH_WRAPPER_H2 #ifndef LEMON_GRAPH_WRAPPER_H 3 #define LEMON_GRAPH_WRAPPER_H 4 4 5 5 #include <invalid.h> 6 6 #include <iter_map.h> 7 7 8 namespace hugo{8 namespace lemon { 9 9 10 10 // Graph wrappers 11 11 12 12 /// \addtogroup gwrappers 13 /// A main parts of HUGOlibare the different graph structures,13 /// A main parts of LEMON are the different graph structures, 14 14 /// generic graph algorithms, graph concepts which couple these, and 15 15 /// graph wrappers. While the previous ones are more or less clear, the … … 1647 1647 ///@} 1648 1648 1649 } //namespace hugo1650 1651 1652 #endif // HUGO_GRAPH_WRAPPER_H1653 1649 } //namespace lemon 1650 1651 1652 #endif //LEMON_GRAPH_WRAPPER_H 1653 -
src/work/marci/experiment/iterator_bfs_demo.cc
r303 r921 9 9 #include <graph_wrapper.h> 10 10 11 using namespace hugo;11 using namespace lemon; 12 12 using std::cout; 13 13 using std::endl; -
src/work/marci/experiment/iterator_bfs_demo_1.cc
r303 r921 9 9 #include <graph_wrapper_1.h> 10 10 11 using namespace hugo;11 using namespace lemon; 12 12 using std::cout; 13 13 using std::endl; -
src/work/marci/experiment/list_graph.h
r281 r921 1 1 // -*- c++ -*- 2 #ifndef HUGO_LIST_GRAPH_H3 #define HUGO_LIST_GRAPH_H2 #ifndef LEMON_LIST_GRAPH_H 3 #define LEMON_LIST_GRAPH_H 4 4 5 5 #include <iostream> … … 8 8 #include <invalid.h> 9 9 10 namespace hugo{10 namespace lemon { 11 11 12 12 template <typename It> … … 566 566 567 567 568 } //namespace hugo569 570 #endif // HUGO_LIST_GRAPH_H568 } //namespace lemon 569 570 #endif //LEMON_LIST_GRAPH_H
Note: See TracChangeset
for help on using the changeset viewer.