Changeset 415:679e64913c5e in lemon-0.x for src
- Timestamp:
- 04/26/04 16:40:59 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@555
- Location:
- src
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
src/include/smart_graph.h
r407 r415 54 54 const SmartGraph* G; 55 55 public: 56 virtual void add(const Key k) = NULL;57 virtual void erase(const Key k) = NULL;56 virtual void add(const Key k) = 0; 57 virtual void erase(const Key k) = 0; 58 58 DynMapBase(const SmartGraph &_G) : G(&_G) {} 59 59 virtual ~DynMapBase() {} -
src/work/marci/bfs_iterator.h
r414 r415 128 128 Bfs<Graph, ReachedMap, PredMap, DistMap> operator++() { 129 129 Parent::operator++(); 130 if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached) { 131 pred.set(s, actual_edge); 132 dist.set(s, dist[this->aNode()]); 130 if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached) 131 { 132 pred.set(this->bNode(), this->actual_edge); 133 dist.set(this->bNode(), dist[this->aNode()]); 133 134 } 134 135 return *this; -
src/work/marci/edmonds_karp_demo.cc
r390 r415 4 4 5 5 #include <list_graph.h> 6 //#include <smart_graph.h>6 #include <smart_graph.h> 7 7 #include <dimacs.h> 8 8 #include <edmonds_karp.h> … … 38 38 typedef ListGraph MutableGraph; 39 39 40 //typedef SmartGraph Graph;41 typedef ListGraph Graph;40 typedef SmartGraph Graph; 41 // typedef ListGraph Graph; 42 42 typedef Graph::Node Node; 43 43 typedef Graph::EdgeIt EdgeIt;
Note: See TracChangeset
for help on using the changeset viewer.