src/lemon/full_graph.h
changeset 1153 4b0468de3a31
parent 1039 bd01c5a3f989
child 1161 1c9658d51c8d
equal deleted inserted replaced
10:c49ddca679ad 11:1e20253900de
   100     ///
   100     ///
   101     /// The ID of the \ref INVALID edge is -1.
   101     /// The ID of the \ref INVALID edge is -1.
   102     ///\return The ID of the edge \c e. 
   102     ///\return The ID of the edge \c e. 
   103     static int id(Edge e) { return e.id; }
   103     static int id(Edge e) { return e.id; }
   104 
   104 
       
   105     static Node fromId(int id, Node) { return Node(id);}
       
   106     
       
   107     static Edge fromId(int id, Edge) { return Edge(id);}
       
   108 
   105     /// Finds an edge between two nodes.
   109     /// Finds an edge between two nodes.
   106     
   110     
   107     /// Finds an edge from node \c u to node \c v.
   111     /// Finds an edge from node \c u to node \c v.
   108     ///
   112     ///
   109     /// If \c prev is \ref INVALID (this is the default value), then
   113     /// If \c prev is \ref INVALID (this is the default value), then