Changeset 1106:0a7d604a9763 in lemon-0.x

Timestamp:

01/28/05 16:37:08 (20 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1505

Message:

Concept modification to resolve the item by its ID.

Location:

src/lemon

Files:

• concept/graph_component.h (modified) (2 diffs)
• full_graph.h (modified) (1 diff)
• list_graph.h (modified) (1 diff)
• smart_graph.h (modified) (1 diff)

src/lemon/concept/graph_component.h

@@ -298 +298 @@
       int id(const Node&) const { return -1;}
 
+      /// \brief Gives back the node by the unique id.
+      ///
+      /// Gives back the node by the unique id.
+      /// If the graph does not contain node with the given id
+      /// then the result of the function is undetermined. 
+      Node fromId(int id, Node) const { return INVALID;}
+
+      /// \brief Gives back an unique integer id for the Edge. 
+      ///
       /// Gives back an unique integer id for the Edge. 
-
-      /// Gives back an unique integer id for the Edge. 
       ///
       int id(const Edge&) const { return -1;}
+
+      /// \brief Gives back the edge by the unique id.
+      ///
+      /// Gives back the edge by the unique id.
+      /// If the graph does not contain edge with the given id
+      /// then the result of the function is undetermined. 
+      Edge fromId(int id, Edge) const { return INVALID;}
 
       template <typename _Graph>
@@ -312 +326 @@
           int nid = graph.id(node);
           nid = graph.id(node);
+          node = graph.fromId(nid, Node());
           typename _Graph::Edge edge;
           int eid = graph.id(edge);
           eid = graph.id(edge);
+          edge = graph.fromId(eid, Edge());
         }
 

src/lemon/full_graph.h

@@ -103 +103 @@
     static int id(Edge e) { return e.id; }
 
+    static Node fromId(int id, Node) { return Node(id);}
+    
+    static Edge fromId(int id, Edge) { return Edge(id);}
+
     /// Finds an edge between two nodes.
     

src/lemon/list_graph.h

@@ -163 +163 @@
     static int id(Edge e) { return e.id; }
 
+    static Node fromId(int id, Node) { return Node(id);}
+    static Edge fromId(int id, Edge) { return Edge(id);}
+
     /// Adds a new node to the graph.
 

src/lemon/smart_graph.h

@@ -122 +122 @@
     static int id(Edge e) { return e.n; }
 
+    static Node fromId(int id, Node) { return Node(id);}
+
+    static Edge fromId(int id, Edge) { return Edge(id);}
+
     Node addNode() {
       Node n; n.n=nodes.size();