[948] | 1 | /* -*- C++ -*- |
---|
| 2 | * src/lemon/list_graph.h - Part of LEMON, a generic C++ optimization library |
---|
| 3 | * |
---|
| 4 | * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
| 5 | * (Egervary Combinatorial Optimization Research Group, EGRES). |
---|
| 6 | * |
---|
| 7 | * Permission to use, modify and distribute this software is granted |
---|
| 8 | * provided that this copyright notice appears in all copies. For |
---|
| 9 | * precise terms see the accompanying LICENSE file. |
---|
| 10 | * |
---|
| 11 | * This software is provided "AS IS" with no warranty of any kind, |
---|
| 12 | * express or implied, and with no claim as to its suitability for any |
---|
| 13 | * purpose. |
---|
| 14 | * |
---|
| 15 | */ |
---|
[395] | 16 | |
---|
[921] | 17 | #ifndef LEMON_LIST_GRAPH_H |
---|
| 18 | #define LEMON_LIST_GRAPH_H |
---|
[395] | 19 | |
---|
[948] | 20 | ///\ingroup graphs |
---|
| 21 | ///\file |
---|
| 22 | ///\brief ListGraph, SymListGraph, NodeSet and EdgeSet classes. |
---|
| 23 | |
---|
[946] | 24 | #include <lemon/erasable_graph_extender.h> |
---|
| 25 | #include <lemon/clearable_graph_extender.h> |
---|
| 26 | #include <lemon/extendable_graph_extender.h> |
---|
[395] | 27 | |
---|
[946] | 28 | #include <lemon/iterable_graph_extender.h> |
---|
[395] | 29 | |
---|
[946] | 30 | #include <lemon/alteration_observer_registry.h> |
---|
[782] | 31 | |
---|
[946] | 32 | #include <lemon/default_map.h> |
---|
[782] | 33 | |
---|
| 34 | |
---|
[921] | 35 | namespace lemon { |
---|
[395] | 36 | |
---|
[946] | 37 | class ListGraphBase { |
---|
[406] | 38 | |
---|
[949] | 39 | protected: |
---|
[946] | 40 | struct NodeT { |
---|
[397] | 41 | int first_in,first_out; |
---|
| 42 | int prev, next; |
---|
[395] | 43 | }; |
---|
[946] | 44 | |
---|
| 45 | struct EdgeT { |
---|
[986] | 46 | int target, source; |
---|
[397] | 47 | int prev_in, prev_out; |
---|
| 48 | int next_in, next_out; |
---|
[395] | 49 | }; |
---|
| 50 | |
---|
| 51 | std::vector<NodeT> nodes; |
---|
[946] | 52 | |
---|
[397] | 53 | int first_node; |
---|
[946] | 54 | |
---|
[397] | 55 | int first_free_node; |
---|
[946] | 56 | |
---|
[395] | 57 | std::vector<EdgeT> edges; |
---|
[946] | 58 | |
---|
[397] | 59 | int first_free_edge; |
---|
[395] | 60 | |
---|
[782] | 61 | public: |
---|
[395] | 62 | |
---|
[946] | 63 | typedef ListGraphBase Graph; |
---|
[397] | 64 | |
---|
[946] | 65 | class Node { |
---|
[975] | 66 | friend class ListGraphBase; |
---|
[946] | 67 | protected: |
---|
[395] | 68 | |
---|
[946] | 69 | int id; |
---|
| 70 | Node(int pid) { id = pid;} |
---|
[395] | 71 | |
---|
[946] | 72 | public: |
---|
| 73 | Node() {} |
---|
| 74 | Node (Invalid) { id = -1; } |
---|
| 75 | bool operator==(const Node& node) const {return id == node.id;} |
---|
| 76 | bool operator!=(const Node& node) const {return id != node.id;} |
---|
| 77 | bool operator<(const Node& node) const {return id < node.id;} |
---|
| 78 | }; |
---|
[782] | 79 | |
---|
[946] | 80 | class Edge { |
---|
[975] | 81 | friend class ListGraphBase; |
---|
[946] | 82 | protected: |
---|
[782] | 83 | |
---|
[946] | 84 | int id; |
---|
| 85 | Edge(int pid) { id = pid;} |
---|
[395] | 86 | |
---|
[946] | 87 | public: |
---|
| 88 | Edge() {} |
---|
| 89 | Edge (Invalid) { id = -1; } |
---|
| 90 | bool operator==(const Edge& edge) const {return id == edge.id;} |
---|
| 91 | bool operator!=(const Edge& edge) const {return id != edge.id;} |
---|
| 92 | bool operator<(const Edge& edge) const {return id < edge.id;} |
---|
| 93 | }; |
---|
| 94 | |
---|
| 95 | |
---|
| 96 | |
---|
| 97 | ListGraphBase() |
---|
[782] | 98 | : nodes(), first_node(-1), |
---|
| 99 | first_free_node(-1), edges(), first_free_edge(-1) {} |
---|
| 100 | |
---|
[395] | 101 | |
---|
[813] | 102 | /// Maximum node ID. |
---|
| 103 | |
---|
| 104 | /// Maximum node ID. |
---|
| 105 | ///\sa id(Node) |
---|
[980] | 106 | int maxId(Node = INVALID) const { return nodes.size()-1; } |
---|
[946] | 107 | |
---|
[813] | 108 | /// Maximum edge ID. |
---|
| 109 | |
---|
| 110 | /// Maximum edge ID. |
---|
| 111 | ///\sa id(Edge) |
---|
[980] | 112 | int maxId(Edge = INVALID) const { return edges.size()-1; } |
---|
[395] | 113 | |
---|
[986] | 114 | Node source(Edge e) const { return edges[e.id].source; } |
---|
| 115 | Node target(Edge e) const { return edges[e.id].target; } |
---|
[395] | 116 | |
---|
| 117 | |
---|
[946] | 118 | void first(Node& node) const { |
---|
| 119 | node.id = first_node; |
---|
| 120 | } |
---|
| 121 | |
---|
| 122 | void next(Node& node) const { |
---|
| 123 | node.id = nodes[node.id].next; |
---|
| 124 | } |
---|
| 125 | |
---|
| 126 | |
---|
| 127 | void first(Edge& e) const { |
---|
| 128 | int n; |
---|
| 129 | for(n = first_node; |
---|
| 130 | n!=-1 && nodes[n].first_in == -1; |
---|
| 131 | n = nodes[n].next); |
---|
| 132 | e.id = (n == -1) ? -1 : nodes[n].first_in; |
---|
| 133 | } |
---|
| 134 | |
---|
| 135 | void next(Edge& edge) const { |
---|
| 136 | if (edges[edge.id].next_in != -1) { |
---|
| 137 | edge.id = edges[edge.id].next_in; |
---|
| 138 | } else { |
---|
| 139 | int n; |
---|
[986] | 140 | for(n = nodes[edges[edge.id].target].next; |
---|
[946] | 141 | n!=-1 && nodes[n].first_in == -1; |
---|
| 142 | n = nodes[n].next); |
---|
| 143 | edge.id = (n == -1) ? -1 : nodes[n].first_in; |
---|
| 144 | } |
---|
| 145 | } |
---|
| 146 | |
---|
| 147 | void firstOut(Edge &e, const Node& v) const { |
---|
| 148 | e.id = nodes[v.id].first_out; |
---|
| 149 | } |
---|
| 150 | void nextOut(Edge &e) const { |
---|
| 151 | e.id=edges[e.id].next_out; |
---|
| 152 | } |
---|
| 153 | |
---|
| 154 | void firstIn(Edge &e, const Node& v) const { |
---|
| 155 | e.id = nodes[v.id].first_in; |
---|
| 156 | } |
---|
| 157 | void nextIn(Edge &e) const { |
---|
| 158 | e.id=edges[e.id].next_in; |
---|
| 159 | } |
---|
| 160 | |
---|
[813] | 161 | |
---|
[946] | 162 | static int id(Node v) { return v.id; } |
---|
| 163 | static int id(Edge e) { return e.id; } |
---|
[395] | 164 | |
---|
[397] | 165 | /// Adds a new node to the graph. |
---|
| 166 | |
---|
[813] | 167 | /// \warning It adds the new node to the front of the list. |
---|
[397] | 168 | /// (i.e. the lastly added node becomes the first.) |
---|
[946] | 169 | Node addNode() { |
---|
[397] | 170 | int n; |
---|
| 171 | |
---|
[946] | 172 | if(first_free_node==-1) { |
---|
| 173 | n = nodes.size(); |
---|
| 174 | nodes.push_back(NodeT()); |
---|
| 175 | } else { |
---|
[397] | 176 | n = first_free_node; |
---|
| 177 | first_free_node = nodes[n].next; |
---|
| 178 | } |
---|
| 179 | |
---|
| 180 | nodes[n].next = first_node; |
---|
| 181 | if(first_node != -1) nodes[first_node].prev = n; |
---|
| 182 | first_node = n; |
---|
| 183 | nodes[n].prev = -1; |
---|
| 184 | |
---|
| 185 | nodes[n].first_in = nodes[n].first_out = -1; |
---|
| 186 | |
---|
[946] | 187 | return Node(n); |
---|
[395] | 188 | } |
---|
| 189 | |
---|
| 190 | Edge addEdge(Node u, Node v) { |
---|
[946] | 191 | int n; |
---|
| 192 | |
---|
| 193 | if (first_free_edge == -1) { |
---|
| 194 | n = edges.size(); |
---|
| 195 | edges.push_back(EdgeT()); |
---|
| 196 | } else { |
---|
[397] | 197 | n = first_free_edge; |
---|
| 198 | first_free_edge = edges[n].next_in; |
---|
| 199 | } |
---|
| 200 | |
---|
[986] | 201 | edges[n].source = u.id; |
---|
| 202 | edges[n].target = v.id; |
---|
[395] | 203 | |
---|
[946] | 204 | edges[n].next_out = nodes[u.id].first_out; |
---|
| 205 | if(nodes[u.id].first_out != -1) { |
---|
| 206 | edges[nodes[u.id].first_out].prev_out = n; |
---|
| 207 | } |
---|
| 208 | |
---|
| 209 | edges[n].next_in = nodes[v.id].first_in; |
---|
| 210 | if(nodes[v.id].first_in != -1) { |
---|
| 211 | edges[nodes[v.id].first_in].prev_in = n; |
---|
| 212 | } |
---|
| 213 | |
---|
[397] | 214 | edges[n].prev_in = edges[n].prev_out = -1; |
---|
| 215 | |
---|
[946] | 216 | nodes[u.id].first_out = nodes[v.id].first_in = n; |
---|
[397] | 217 | |
---|
[946] | 218 | return Edge(n); |
---|
[395] | 219 | } |
---|
[774] | 220 | |
---|
[946] | 221 | void erase(const Node& node) { |
---|
| 222 | int n = node.id; |
---|
| 223 | |
---|
| 224 | if(nodes[n].next != -1) { |
---|
| 225 | nodes[nodes[n].next].prev = nodes[n].prev; |
---|
| 226 | } |
---|
| 227 | |
---|
| 228 | if(nodes[n].prev != -1) { |
---|
| 229 | nodes[nodes[n].prev].next = nodes[n].next; |
---|
| 230 | } else { |
---|
| 231 | first_node = nodes[n].next; |
---|
| 232 | } |
---|
| 233 | |
---|
| 234 | nodes[n].next = first_free_node; |
---|
| 235 | first_free_node = n; |
---|
[395] | 236 | |
---|
[774] | 237 | } |
---|
| 238 | |
---|
[946] | 239 | void erase(const Edge& edge) { |
---|
| 240 | int n = edge.id; |
---|
[397] | 241 | |
---|
[946] | 242 | if(edges[n].next_in!=-1) { |
---|
[397] | 243 | edges[edges[n].next_in].prev_in = edges[n].prev_in; |
---|
[946] | 244 | } |
---|
| 245 | |
---|
| 246 | if(edges[n].prev_in!=-1) { |
---|
[397] | 247 | edges[edges[n].prev_in].next_in = edges[n].next_in; |
---|
[946] | 248 | } else { |
---|
[986] | 249 | nodes[edges[n].target].first_in = edges[n].next_in; |
---|
[946] | 250 | } |
---|
| 251 | |
---|
[397] | 252 | |
---|
[946] | 253 | if(edges[n].next_out!=-1) { |
---|
[397] | 254 | edges[edges[n].next_out].prev_out = edges[n].prev_out; |
---|
[946] | 255 | } |
---|
| 256 | |
---|
| 257 | if(edges[n].prev_out!=-1) { |
---|
[397] | 258 | edges[edges[n].prev_out].next_out = edges[n].next_out; |
---|
[946] | 259 | } else { |
---|
[986] | 260 | nodes[edges[n].source].first_out = edges[n].next_out; |
---|
[946] | 261 | } |
---|
[397] | 262 | |
---|
| 263 | edges[n].next_in = first_free_edge; |
---|
[695] | 264 | first_free_edge = n; |
---|
[397] | 265 | |
---|
| 266 | } |
---|
| 267 | |
---|
| 268 | void clear() { |
---|
[782] | 269 | edges.clear(); |
---|
| 270 | nodes.clear(); |
---|
[946] | 271 | first_node = first_free_node = first_free_edge = -1; |
---|
[937] | 272 | } |
---|
| 273 | |
---|
[949] | 274 | protected: |
---|
[986] | 275 | void _moveTarget(Edge e, Node n) |
---|
[949] | 276 | { |
---|
| 277 | if(edges[e.id].next_in != -1) |
---|
| 278 | edges[edges[e.id].next_in].prev_in = edges[e.id].prev_in; |
---|
| 279 | if(edges[e.id].prev_in != -1) |
---|
| 280 | edges[edges[e.id].prev_in].next_in = edges[e.id].next_in; |
---|
[986] | 281 | else nodes[edges[e.id].target].first_in = edges[e.id].next_in; |
---|
| 282 | edges[e.id].target = n.id; |
---|
[949] | 283 | edges[e.id].prev_in = -1; |
---|
| 284 | edges[e.id].next_in = nodes[n.id].first_in; |
---|
| 285 | nodes[n.id].first_in = e.id; |
---|
| 286 | } |
---|
[986] | 287 | void _moveSource(Edge e, Node n) |
---|
[949] | 288 | { |
---|
| 289 | if(edges[e.id].next_out != -1) |
---|
| 290 | edges[edges[e.id].next_out].prev_out = edges[e.id].prev_out; |
---|
| 291 | if(edges[e.id].prev_out != -1) |
---|
| 292 | edges[edges[e.id].prev_out].next_out = edges[e.id].next_out; |
---|
[986] | 293 | else nodes[edges[e.id].source].first_out = edges[e.id].next_out; |
---|
| 294 | edges[e.id].source = n.id; |
---|
[949] | 295 | edges[e.id].prev_out = -1; |
---|
| 296 | edges[e.id].next_out = nodes[n.id].first_out; |
---|
| 297 | nodes[n.id].first_out = e.id; |
---|
| 298 | } |
---|
| 299 | |
---|
[919] | 300 | }; |
---|
[909] | 301 | |
---|
[946] | 302 | typedef AlterableGraphExtender<ListGraphBase> AlterableListGraphBase; |
---|
| 303 | typedef IterableGraphExtender<AlterableListGraphBase> IterableListGraphBase; |
---|
[980] | 304 | typedef DefaultMappableGraphExtender<IterableListGraphBase> MappableListGraphBase; |
---|
[946] | 305 | typedef ExtendableGraphExtender<MappableListGraphBase> ExtendableListGraphBase; |
---|
| 306 | typedef ClearableGraphExtender<ExtendableListGraphBase> ClearableListGraphBase; |
---|
| 307 | typedef ErasableGraphExtender<ClearableListGraphBase> ErasableListGraphBase; |
---|
[400] | 308 | |
---|
[948] | 309 | /// \addtogroup graphs |
---|
| 310 | /// @{ |
---|
[400] | 311 | |
---|
[948] | 312 | ///A list graph class. |
---|
[400] | 313 | |
---|
[948] | 314 | ///This is a simple and fast erasable graph implementation. |
---|
| 315 | /// |
---|
| 316 | ///It conforms to the |
---|
[959] | 317 | ///\ref concept::ErasableGraph "ErasableGraph" concept. |
---|
| 318 | ///\sa concept::ErasableGraph. |
---|
[782] | 319 | |
---|
[948] | 320 | class ListGraph : public ErasableListGraphBase |
---|
| 321 | { |
---|
| 322 | public: |
---|
[986] | 323 | /// Moves the target of \c e to \c n |
---|
[948] | 324 | |
---|
[986] | 325 | /// Moves the target of \c e to \c n |
---|
[948] | 326 | /// |
---|
[986] | 327 | void moveTarget(Edge e, Node n) { _moveTarget(e,n); } |
---|
| 328 | /// Moves the source of \c e to \c n |
---|
[948] | 329 | |
---|
[986] | 330 | /// Moves the source of \c e to \c n |
---|
[948] | 331 | /// |
---|
[986] | 332 | void moveSource(Edge e, Node n) { _moveSource(e,n); } |
---|
[949] | 333 | |
---|
| 334 | ///Using this it possible to avoid the superfluous memory allocation. |
---|
| 335 | ///\todo more docs... |
---|
| 336 | void reserveEdge(int n) { edges.reserve(n); }; |
---|
| 337 | |
---|
| 338 | }; |
---|
| 339 | |
---|
[948] | 340 | /// @} |
---|
| 341 | } //namespace lemon |
---|
[946] | 342 | |
---|
[400] | 343 | |
---|
[946] | 344 | #endif |
---|