[906] | 1 | /* -*- C++ -*- |
---|
[921] | 2 | * src/lemon/smart_graph.h - Part of LEMON, a generic C++ optimization library |
---|
[906] | 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 | */ |
---|
[105] | 16 | |
---|
[921] | 17 | #ifndef LEMON_SMART_GRAPH_H |
---|
| 18 | #define LEMON_SMART_GRAPH_H |
---|
[104] | 19 | |
---|
[491] | 20 | ///\ingroup graphs |
---|
[242] | 21 | ///\file |
---|
| 22 | ///\brief SmartGraph and SymSmartGraph classes. |
---|
| 23 | |
---|
[104] | 24 | #include <vector> |
---|
| 25 | |
---|
[921] | 26 | #include <lemon/invalid.h> |
---|
[157] | 27 | |
---|
[946] | 28 | #include <lemon/clearable_graph_extender.h> |
---|
| 29 | #include <lemon/extendable_graph_extender.h> |
---|
| 30 | #include <lemon/iterable_graph_extender.h> |
---|
[1039] | 31 | #include <lemon/alteration_notifier.h> |
---|
[946] | 32 | #include <lemon/default_map.h> |
---|
| 33 | |
---|
[1034] | 34 | #include <lemon/undir_graph_extender.h> |
---|
| 35 | |
---|
[977] | 36 | #include <lemon/utility.h> |
---|
[782] | 37 | |
---|
[921] | 38 | namespace lemon { |
---|
[104] | 39 | |
---|
[946] | 40 | /// \addtogroup graphs |
---|
| 41 | /// @{ |
---|
[185] | 42 | |
---|
[973] | 43 | class SmartGraph; |
---|
[969] | 44 | ///Base of SmartGraph |
---|
| 45 | |
---|
| 46 | ///Base of SmartGraph |
---|
| 47 | /// |
---|
[946] | 48 | class SmartGraphBase { |
---|
[104] | 49 | |
---|
[973] | 50 | friend class SmatGraph; |
---|
| 51 | |
---|
| 52 | protected: |
---|
[104] | 53 | struct NodeT |
---|
| 54 | { |
---|
| 55 | int first_in,first_out; |
---|
[157] | 56 | NodeT() : first_in(-1), first_out(-1) {} |
---|
[104] | 57 | }; |
---|
| 58 | struct EdgeT |
---|
| 59 | { |
---|
[986] | 60 | int target, source, next_in, next_out; |
---|
[104] | 61 | //FIXME: is this necessary? |
---|
[157] | 62 | EdgeT() : next_in(-1), next_out(-1) {} |
---|
[104] | 63 | }; |
---|
| 64 | |
---|
| 65 | std::vector<NodeT> nodes; |
---|
[129] | 66 | |
---|
[104] | 67 | std::vector<EdgeT> edges; |
---|
| 68 | |
---|
[185] | 69 | |
---|
[104] | 70 | public: |
---|
[782] | 71 | |
---|
[946] | 72 | typedef SmartGraphBase Graph; |
---|
[104] | 73 | |
---|
[164] | 74 | class Node; |
---|
| 75 | class Edge; |
---|
[108] | 76 | |
---|
[104] | 77 | |
---|
| 78 | public: |
---|
| 79 | |
---|
[946] | 80 | SmartGraphBase() : nodes(), edges() { } |
---|
| 81 | SmartGraphBase(const SmartGraphBase &_g) : nodes(_g.nodes), edges(_g.edges) { } |
---|
[104] | 82 | |
---|
[977] | 83 | typedef True NodeNumTag; |
---|
| 84 | typedef True EdgeNumTag; |
---|
| 85 | |
---|
[813] | 86 | ///Number of nodes. |
---|
| 87 | int nodeNum() const { return nodes.size(); } |
---|
| 88 | ///Number of edges. |
---|
| 89 | int edgeNum() const { return edges.size(); } |
---|
[104] | 90 | |
---|
[813] | 91 | /// Maximum node ID. |
---|
| 92 | |
---|
| 93 | /// Maximum node ID. |
---|
| 94 | ///\sa id(Node) |
---|
[980] | 95 | int maxId(Node = INVALID) const { return nodes.size()-1; } |
---|
[813] | 96 | /// Maximum edge ID. |
---|
| 97 | |
---|
| 98 | /// Maximum edge ID. |
---|
| 99 | ///\sa id(Edge) |
---|
[980] | 100 | int maxId(Edge = INVALID) const { return edges.size()-1; } |
---|
[108] | 101 | |
---|
[986] | 102 | Node source(Edge e) const { return edges[e.n].source; } |
---|
| 103 | Node target(Edge e) const { return edges[e.n].target; } |
---|
[104] | 104 | |
---|
[813] | 105 | /// Node ID. |
---|
| 106 | |
---|
| 107 | /// The ID of a valid Node is a nonnegative integer not greater than |
---|
| 108 | /// \ref maxNodeId(). The range of the ID's is not surely continuous |
---|
| 109 | /// and the greatest node ID can be actually less then \ref maxNodeId(). |
---|
| 110 | /// |
---|
| 111 | /// The ID of the \ref INVALID node is -1. |
---|
| 112 | ///\return The ID of the node \c v. |
---|
[713] | 113 | static int id(Node v) { return v.n; } |
---|
[813] | 114 | /// Edge ID. |
---|
| 115 | |
---|
| 116 | /// The ID of a valid Edge is a nonnegative integer not greater than |
---|
| 117 | /// \ref maxEdgeId(). The range of the ID's is not surely continuous |
---|
| 118 | /// and the greatest edge ID can be actually less then \ref maxEdgeId(). |
---|
| 119 | /// |
---|
| 120 | /// The ID of the \ref INVALID edge is -1. |
---|
| 121 | ///\return The ID of the edge \c e. |
---|
[713] | 122 | static int id(Edge e) { return e.n; } |
---|
[104] | 123 | |
---|
[1106] | 124 | static Node fromId(int id, Node) { return Node(id);} |
---|
| 125 | |
---|
| 126 | static Edge fromId(int id, Edge) { return Edge(id);} |
---|
| 127 | |
---|
[164] | 128 | Node addNode() { |
---|
| 129 | Node n; n.n=nodes.size(); |
---|
[104] | 130 | nodes.push_back(NodeT()); //FIXME: Hmmm... |
---|
| 131 | return n; |
---|
| 132 | } |
---|
[108] | 133 | |
---|
[164] | 134 | Edge addEdge(Node u, Node v) { |
---|
| 135 | Edge e; e.n=edges.size(); edges.push_back(EdgeT()); //FIXME: Hmmm... |
---|
[986] | 136 | edges[e.n].source=u.n; edges[e.n].target=v.n; |
---|
[104] | 137 | edges[e.n].next_out=nodes[u.n].first_out; |
---|
| 138 | edges[e.n].next_in=nodes[v.n].first_in; |
---|
| 139 | nodes[u.n].first_out=nodes[v.n].first_in=e.n; |
---|
[108] | 140 | |
---|
[104] | 141 | return e; |
---|
| 142 | } |
---|
| 143 | |
---|
[782] | 144 | void clear() { |
---|
| 145 | edges.clear(); |
---|
| 146 | nodes.clear(); |
---|
| 147 | } |
---|
[104] | 148 | |
---|
[946] | 149 | |
---|
[164] | 150 | class Node { |
---|
[946] | 151 | friend class SmartGraphBase; |
---|
[973] | 152 | friend class SmartGraph; |
---|
[104] | 153 | |
---|
| 154 | protected: |
---|
| 155 | int n; |
---|
[973] | 156 | ///\todo It should be removed (or at least define a setToId() instead). |
---|
| 157 | /// |
---|
[164] | 158 | Node(int nn) {n=nn;} |
---|
[104] | 159 | public: |
---|
[164] | 160 | Node() {} |
---|
[503] | 161 | Node (Invalid) { n=-1; } |
---|
[164] | 162 | bool operator==(const Node i) const {return n==i.n;} |
---|
| 163 | bool operator!=(const Node i) const {return n!=i.n;} |
---|
| 164 | bool operator<(const Node i) const {return n<i.n;} |
---|
[104] | 165 | }; |
---|
| 166 | |
---|
| 167 | |
---|
[164] | 168 | class Edge { |
---|
[946] | 169 | friend class SmartGraphBase; |
---|
[973] | 170 | friend class SmartGraph; |
---|
[185] | 171 | |
---|
[104] | 172 | protected: |
---|
| 173 | int n; |
---|
[973] | 174 | ///\todo It should be removed (or at least define a setToId() instead). |
---|
| 175 | /// |
---|
[905] | 176 | Edge(int nn) {n=nn;} |
---|
[706] | 177 | public: |
---|
[164] | 178 | Edge() { } |
---|
[174] | 179 | Edge (Invalid) { n=-1; } |
---|
[164] | 180 | bool operator==(const Edge i) const {return n==i.n;} |
---|
| 181 | bool operator!=(const Edge i) const {return n!=i.n;} |
---|
| 182 | bool operator<(const Edge i) const {return n<i.n;} |
---|
[946] | 183 | }; |
---|
[905] | 184 | |
---|
[946] | 185 | void first(Node& node) const { |
---|
| 186 | node.n = nodes.size() - 1; |
---|
| 187 | } |
---|
| 188 | |
---|
| 189 | static void next(Node& node) { |
---|
| 190 | --node.n; |
---|
| 191 | } |
---|
| 192 | |
---|
| 193 | void first(Edge& edge) const { |
---|
| 194 | edge.n = edges.size() - 1; |
---|
| 195 | } |
---|
| 196 | |
---|
| 197 | static void next(Edge& edge) { |
---|
| 198 | --edge.n; |
---|
| 199 | } |
---|
| 200 | |
---|
| 201 | void firstOut(Edge& edge, const Node& node) const { |
---|
| 202 | edge.n = nodes[node.n].first_out; |
---|
| 203 | } |
---|
| 204 | |
---|
| 205 | void nextOut(Edge& edge) const { |
---|
| 206 | edge.n = edges[edge.n].next_out; |
---|
| 207 | } |
---|
| 208 | |
---|
| 209 | void firstIn(Edge& edge, const Node& node) const { |
---|
| 210 | edge.n = nodes[node.n].first_in; |
---|
| 211 | } |
---|
[104] | 212 | |
---|
[946] | 213 | void nextIn(Edge& edge) const { |
---|
| 214 | edge.n = edges[edge.n].next_in; |
---|
| 215 | } |
---|
[105] | 216 | |
---|
[969] | 217 | Edge _findEdge(Node u,Node v, Edge prev = INVALID) |
---|
| 218 | { |
---|
| 219 | int e = (prev.n==-1)? nodes[u.n].first_out : edges[prev.n].next_out; |
---|
[1082] | 220 | while(e!=-1 && edges[e].target!=v.n) e = edges[e].next_out; |
---|
[969] | 221 | prev.n=e; |
---|
| 222 | return prev; |
---|
| 223 | } |
---|
[973] | 224 | |
---|
[104] | 225 | }; |
---|
[185] | 226 | |
---|
[946] | 227 | typedef AlterableGraphExtender<SmartGraphBase> AlterableSmartGraphBase; |
---|
| 228 | typedef IterableGraphExtender<AlterableSmartGraphBase> IterableSmartGraphBase; |
---|
[980] | 229 | typedef DefaultMappableGraphExtender<IterableSmartGraphBase> MappableSmartGraphBase; |
---|
[946] | 230 | typedef ExtendableGraphExtender<MappableSmartGraphBase> ExtendableSmartGraphBase; |
---|
| 231 | typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase; |
---|
[937] | 232 | |
---|
[950] | 233 | ///A smart graph class. |
---|
[937] | 234 | |
---|
[950] | 235 | ///This is a simple and fast graph implementation. |
---|
| 236 | ///It is also quite memory efficient, but at the price |
---|
[974] | 237 | ///that <b> it does support only limited (only stack-like) |
---|
| 238 | ///node and edge deletions</b>. |
---|
[950] | 239 | ///It conforms to |
---|
[959] | 240 | ///the \ref concept::ExtendableGraph "ExtendableGraph" concept. |
---|
| 241 | ///\sa concept::ExtendableGraph. |
---|
[950] | 242 | /// |
---|
| 243 | ///\author Alpar Juttner |
---|
[980] | 244 | class SmartGraph : public ClearableSmartGraphBase { |
---|
[969] | 245 | public: |
---|
| 246 | /// Finds an edge between two nodes. |
---|
[973] | 247 | |
---|
[969] | 248 | /// Finds an edge from node \c u to node \c v. |
---|
| 249 | /// |
---|
| 250 | /// If \c prev is \ref INVALID (this is the default value), then |
---|
| 251 | /// it finds the first edge from \c u to \c v. Otherwise it looks for |
---|
| 252 | /// the next edge from \c u to \c v after \c prev. |
---|
| 253 | /// \return The found edge or \ref INVALID if there is no such an edge. |
---|
| 254 | /// |
---|
| 255 | /// Thus you can iterate through each edge from \c u to \c v as it follows. |
---|
| 256 | /// \code |
---|
| 257 | /// for(Edge e=G.findEdge(u,v);e!=INVALID;e=G.findEdge(u,v,e)) { |
---|
| 258 | /// ... |
---|
| 259 | /// } |
---|
| 260 | /// \endcode |
---|
| 261 | /// \todo Possibly it should be a global function. |
---|
| 262 | Edge findEdge(Node u,Node v, Edge prev = INVALID) |
---|
| 263 | { |
---|
| 264 | return _findEdge(u,v,prev); |
---|
| 265 | } |
---|
[973] | 266 | |
---|
[1011] | 267 | class SnapShot; |
---|
| 268 | friend class SnapShot; |
---|
[973] | 269 | |
---|
[1011] | 270 | protected: |
---|
| 271 | void restoreSnapShot(const SnapShot &s) |
---|
[973] | 272 | { |
---|
| 273 | while(s.edge_num>edges.size()) { |
---|
[1040] | 274 | Parent::getNotifier(Edge()).erase(Edge(edges.size()-1)); |
---|
[986] | 275 | nodes[edges.back().target].first_in=edges.back().next_in; |
---|
| 276 | nodes[edges.back().source].first_out=edges.back().next_out; |
---|
[973] | 277 | edges.pop_back(); |
---|
| 278 | } |
---|
| 279 | //nodes.resize(s.nodes_num); |
---|
| 280 | while(s.node_num>nodes.size()) { |
---|
[1040] | 281 | Parent::getNotifier(Node()).erase(Node(nodes.size()-1)); |
---|
[973] | 282 | nodes.pop_back(); |
---|
| 283 | } |
---|
[1011] | 284 | } |
---|
| 285 | |
---|
| 286 | public: |
---|
| 287 | ///Class to make a snapshot of the graph and to restrore to it later. |
---|
| 288 | |
---|
| 289 | ///Class to make a snapshot of the graph and to restrore to it later. |
---|
| 290 | /// |
---|
| 291 | ///The newly added nodes and edges can be removed using the |
---|
| 292 | ///restore() function. |
---|
| 293 | ///\note After you restore a state, you cannot restore |
---|
| 294 | ///a later state, in other word you cannot add again the edges deleted |
---|
| 295 | ///by restore() using another SnapShot instance. |
---|
| 296 | /// |
---|
| 297 | class SnapShot |
---|
| 298 | { |
---|
| 299 | SmartGraph *g; |
---|
| 300 | protected: |
---|
| 301 | friend class SmartGraph; |
---|
| 302 | unsigned int node_num; |
---|
| 303 | unsigned int edge_num; |
---|
| 304 | public: |
---|
| 305 | ///Default constructur. |
---|
| 306 | |
---|
| 307 | ///Default constructur. |
---|
| 308 | ///To actually make a snapshot you must call save(). |
---|
| 309 | /// |
---|
| 310 | SnapShot() : g(0) {} |
---|
| 311 | ///Constructor that immediately makes a snapshot |
---|
| 312 | |
---|
| 313 | ///This constructor immediately makes a snapshot of the graph. |
---|
| 314 | ///\param _g The graph we make a snapshot of. |
---|
| 315 | SnapShot(SmartGraph &_g) :g(&_g) { |
---|
| 316 | node_num=g->nodes.size(); |
---|
| 317 | edge_num=g->edges.size(); |
---|
| 318 | } |
---|
| 319 | |
---|
| 320 | ///Make a snapshot. |
---|
| 321 | |
---|
| 322 | ///Make a snapshot of the graph. |
---|
| 323 | /// |
---|
| 324 | ///This function can be called more than once. In case of a repeated |
---|
| 325 | ///call, the previous snapshot gets lost. |
---|
| 326 | ///\param _g The graph we make the snapshot of. |
---|
| 327 | void save(SmartGraph &_g) |
---|
| 328 | { |
---|
| 329 | g=&_g; |
---|
| 330 | node_num=g->nodes.size(); |
---|
| 331 | edge_num=g->edges.size(); |
---|
| 332 | } |
---|
| 333 | |
---|
| 334 | ///Undo the changes until a snapshot. |
---|
| 335 | |
---|
| 336 | ///Undo the changes until a snapshot created by save(). |
---|
| 337 | /// |
---|
| 338 | ///\param s an internal stucture given back by save() |
---|
| 339 | ///\note After you restored a state, you cannot restore |
---|
| 340 | ///a later state, in other word you cannot add again the edges deleted |
---|
| 341 | ///by restore(). |
---|
| 342 | /// |
---|
| 343 | ///\todo This function might be called undo(). |
---|
| 344 | |
---|
| 345 | void restore() |
---|
| 346 | { |
---|
| 347 | g->restoreSnapShot(*this); |
---|
| 348 | } |
---|
| 349 | }; |
---|
[973] | 350 | }; |
---|
[1034] | 351 | |
---|
| 352 | |
---|
| 353 | /**************** Undirected List Graph ****************/ |
---|
| 354 | |
---|
| 355 | typedef ClearableUndirGraphExtender< |
---|
| 356 | ExtendableUndirGraphExtender< |
---|
| 357 | MappableUndirGraphExtender< |
---|
| 358 | IterableUndirGraphExtender< |
---|
| 359 | AlterableUndirGraphExtender< |
---|
| 360 | UndirGraphExtender<SmartGraphBase> > > > > > UndirSmartGraphBase; |
---|
| 361 | |
---|
[1035] | 362 | ///A smart undirected graph class. |
---|
| 363 | |
---|
| 364 | ///This is a simple and fast undirected graph implementation. |
---|
| 365 | ///It is also quite memory efficient, but at the price |
---|
| 366 | ///that <b> it does support only limited (only stack-like) |
---|
| 367 | ///node and edge deletions</b>. |
---|
| 368 | ///Except from this it conforms to |
---|
| 369 | ///the \ref concept::UndirGraph "UndirGraph" concept. |
---|
| 370 | ///\sa concept::UndirGraph. |
---|
| 371 | /// |
---|
| 372 | ///\todo SnapShot hasn't been implemented yet. |
---|
| 373 | /// |
---|
[1034] | 374 | class UndirSmartGraph : public UndirSmartGraphBase { |
---|
| 375 | }; |
---|
| 376 | |
---|
[950] | 377 | |
---|
[407] | 378 | /// @} |
---|
[921] | 379 | } //namespace lemon |
---|
[104] | 380 | |
---|
[157] | 381 | |
---|
[921] | 382 | #endif //LEMON_SMART_GRAPH_H |
---|