# HG changeset patch # User marci # Date 1082468616 0 # Node ID 0e8eb96c22ca1617b6a5a00694049024df3a354c # Parent eeae2f4a0d74d0f3a1c68ce551b16a58293a4f63 UndirListGraph, somebody should try it. diff -r eeae2f4a0d74 -r 0e8eb96c22ca src/work/list_graph.h --- a/src/work/list_graph.h Tue Apr 20 12:10:36 2004 +0000 +++ b/src/work/list_graph.h Tue Apr 20 13:43:36 2004 +0000 @@ -505,7 +505,7 @@ bool out_or_in; //1 iff out, 0 iff in //node_item* v; //protected: - public: //for alpar + protected: //for alpar SymEdgeIt(const Node& _v) /*: v(_v.node)*/ { out_or_in=1; edge=_v.node->_first_out_edge; @@ -536,46 +536,12 @@ Node bNode() const { return (out_or_in) ? Node(edge->_head) : Node(edge->_tail); } }; - }; -// template< typename T > -// T ListGraph::first() const { -// std::cerr << "Invalid use of template T ListGraph::first();" << std::endl; -// return T(); -// } - -// template<> -// ListGraph::NodeIt ListGraph::first() const { -// return firstNode(); -// } - -// template<> -// ListGraph::EdgeIt ListGraph::first() const { -// return firstEdge(); -// } - -// template< typename T > -// T ListGraph::first(ListGraph::Node v) const { -// std::cerr << "Invalid use of template T ListGraph::first(ListGRaph::Node);" << std::endl; -// return T(); -// } - -// template<> -// ListGraph::OutEdgeIt ListGraph::first(const ListGraph::Node v) const { -// return firstOutEdge(v); -// } - -// template<> -// ListGraph::InEdgeIt ListGraph::first(const ListGraph::Node v) const { -// return firstInEdge(v); -// } - -// template<> -// ListGraph::SymEdgeIt ListGraph::first(const ListGraph::Node v) const { -// return firstSymEdge(v); -// } - + class UndirListGraph : public ListGraph { + typedef SymEdgeIt OutEdgeIt; + typedef SymEdgeIt InEdgeIt; + }; } //namespace hugo