# HG changeset patch # User marci # Date 1082990459 0 # Node ID 679e64913c5e8797462f8e9aec3697750d66b516 # Parent 3fd2eec272e0b81b3369512b267c402d7d74c8a2 for igcc-3.4.0 diff -r 3fd2eec272e0 -r 679e64913c5e src/include/smart_graph.h --- a/src/include/smart_graph.h Mon Apr 26 14:25:51 2004 +0000 +++ b/src/include/smart_graph.h Mon Apr 26 14:40:59 2004 +0000 @@ -53,8 +53,8 @@ protected: const SmartGraph* G; public: - virtual void add(const Key k) = NULL; - virtual void erase(const Key k) = NULL; + virtual void add(const Key k) = 0; + virtual void erase(const Key k) = 0; DynMapBase(const SmartGraph &_G) : G(&_G) {} virtual ~DynMapBase() {} friend class SmartGraph; diff -r 3fd2eec272e0 -r 679e64913c5e src/work/marci/bfs_iterator.h --- a/src/work/marci/bfs_iterator.h Mon Apr 26 14:25:51 2004 +0000 +++ b/src/work/marci/bfs_iterator.h Mon Apr 26 14:40:59 2004 +0000 @@ -127,9 +127,10 @@ } Bfs operator++() { Parent::operator++(); - if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached) { - pred.set(s, actual_edge); - dist.set(s, dist[this->aNode()]); + if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached) + { + pred.set(this->bNode(), this->actual_edge); + dist.set(this->bNode(), dist[this->aNode()]); } return *this; } diff -r 3fd2eec272e0 -r 679e64913c5e src/work/marci/edmonds_karp_demo.cc --- a/src/work/marci/edmonds_karp_demo.cc Mon Apr 26 14:25:51 2004 +0000 +++ b/src/work/marci/edmonds_karp_demo.cc Mon Apr 26 14:40:59 2004 +0000 @@ -3,7 +3,7 @@ #include #include -//#include +#include #include #include #include @@ -37,8 +37,8 @@ typedef ListGraph MutableGraph; -// typedef SmartGraph Graph; - typedef ListGraph Graph; + typedef SmartGraph Graph; + // typedef ListGraph Graph; typedef Graph::Node Node; typedef Graph::EdgeIt EdgeIt;