equal
deleted
inserted
replaced
144 bool finished() const { return dfs_stack.empty(); } |
144 bool finished() const { return dfs_stack.empty(); } |
145 operator OutEdgeIt () const { return actual_edge; } |
145 operator OutEdgeIt () const { return actual_edge; } |
146 bool isBNodeNewlyReached() const { return b_node_newly_reached; } |
146 bool isBNodeNewlyReached() const { return b_node_newly_reached; } |
147 bool isANodeExamined() const { return !(graph->valid(actual_edge)); } |
147 bool isANodeExamined() const { return !(graph->valid(actual_edge)); } |
148 Node aNode() const { return actual_node; /*FIXME*/} |
148 Node aNode() const { return actual_node; /*FIXME*/} |
149 Node bNode() const { return G.bNode(actual_edge); } |
149 Node bNode() const { return graph->bNode(actual_edge); } |
150 const ReachedMap& getReachedMap() const { return reached; } |
150 const ReachedMap& getReachedMap() const { return reached; } |
151 const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; } |
151 const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; } |
152 }; |
152 }; |
153 |
153 |
154 } // namespace hugo |
154 } // namespace hugo |