equal
deleted
inserted
replaced
160 |
160 |
161 |
161 |
162 static int id(Node v) { return v.id; } |
162 static int id(Node v) { return v.id; } |
163 static int id(Edge e) { return e.id; } |
163 static int id(Edge e) { return e.id; } |
164 |
164 |
|
165 static Node fromId(int id, Node) { return Node(id);} |
|
166 static Edge fromId(int id, Edge) { return Edge(id);} |
|
167 |
165 /// Adds a new node to the graph. |
168 /// Adds a new node to the graph. |
166 |
169 |
167 /// \warning It adds the new node to the front of the list. |
170 /// \warning It adds the new node to the front of the list. |
168 /// (i.e. the lastly added node becomes the first.) |
171 /// (i.e. the lastly added node becomes the first.) |
169 Node addNode() { |
172 Node addNode() { |