1.1 --- a/src/work/list_graph.hh	Tue Feb 17 11:46:27 2004 +0000
     1.2 +++ b/src/work/list_graph.hh	Tue Feb 17 12:26:25 2004 +0000
     1.3 @@ -380,7 +380,8 @@
     1.4      
     1.5      class EachNodeIt : public NodeIt {
     1.6        friend class ListGraph;
     1.7 -    protected:
     1.8 +      //protected:
     1.9 +    public: //for alpar
    1.10        EachNodeIt(const ListGraph& G) : NodeIt(G._first_node) { }
    1.11      public:
    1.12        EachNodeIt() : NodeIt() { }
    1.13 @@ -418,7 +419,8 @@
    1.14      
    1.15      class EachEdgeIt : public EdgeIt {
    1.16        friend class ListGraph;
    1.17 -    protected:
    1.18 +      //protected: 
    1.19 +    public: //for alpar
    1.20        EachEdgeIt(const ListGraph& G) {
    1.21  	node_item* v=G._first_node;
    1.22  	if (v) edge=v->_first_out_edge; else edge=0;
    1.23 @@ -438,7 +440,8 @@
    1.24      class OutEdgeIt : public EdgeIt {
    1.25        friend class ListGraph;
    1.26        //node_item* v;
    1.27 -    protected:
    1.28 +      //protected: 
    1.29 +    public: //for alpar
    1.30        OutEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
    1.31      public:
    1.32        OutEdgeIt() : EdgeIt()/*, v(0)*/ { }
    1.33 @@ -452,7 +455,8 @@
    1.34      class InEdgeIt : public EdgeIt {
    1.35        friend class ListGraph;
    1.36        //node_item* v;
    1.37 -    protected:
    1.38 +      //protected:
    1.39 +    public: //for alpar
    1.40        InEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
    1.41      public:
    1.42        InEdgeIt() : EdgeIt()/*, v(0)*/ { }
    1.43 @@ -467,7 +471,8 @@
    1.44        friend class ListGraph;
    1.45        bool out_or_in; //1 iff out, 0 iff in
    1.46        //node_item* v;
    1.47 -    protected:
    1.48 +      //protected:
    1.49 +    public: //for alpar
    1.50        SymEdgeIt(const NodeIt& _v) /*: v(_v.node)*/ { 
    1.51  	out_or_in=1;
    1.52  	edge=_v.node->_first_out_edge;