[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/erasable_graph_extender.h> |
---|
| 29 | #include <lemon/clearable_graph_extender.h> |
---|
| 30 | #include <lemon/extendable_graph_extender.h> |
---|
[937] | 31 | |
---|
[946] | 32 | #include <lemon/idmappable_graph_extender.h> |
---|
[919] | 33 | |
---|
[946] | 34 | #include <lemon/iterable_graph_extender.h> |
---|
[782] | 35 | |
---|
[946] | 36 | #include <lemon/alteration_observer_registry.h> |
---|
| 37 | #include <lemon/default_map.h> |
---|
| 38 | |
---|
| 39 | |
---|
| 40 | #include <lemon/graph_utils.h> |
---|
| 41 | |
---|
[782] | 42 | |
---|
[921] | 43 | namespace lemon { |
---|
[104] | 44 | |
---|
[946] | 45 | /// \addtogroup graphs |
---|
| 46 | /// @{ |
---|
[185] | 47 | |
---|
[946] | 48 | class SmartGraphBase { |
---|
[104] | 49 | |
---|
| 50 | struct NodeT |
---|
| 51 | { |
---|
| 52 | int first_in,first_out; |
---|
[157] | 53 | NodeT() : first_in(-1), first_out(-1) {} |
---|
[104] | 54 | }; |
---|
| 55 | struct EdgeT |
---|
| 56 | { |
---|
| 57 | int head, tail, next_in, next_out; |
---|
| 58 | //FIXME: is this necessary? |
---|
[157] | 59 | EdgeT() : next_in(-1), next_out(-1) {} |
---|
[104] | 60 | }; |
---|
| 61 | |
---|
| 62 | std::vector<NodeT> nodes; |
---|
[129] | 63 | |
---|
[104] | 64 | std::vector<EdgeT> edges; |
---|
| 65 | |
---|
[185] | 66 | |
---|
[104] | 67 | public: |
---|
[782] | 68 | |
---|
[946] | 69 | typedef SmartGraphBase Graph; |
---|
[104] | 70 | |
---|
[164] | 71 | class Node; |
---|
| 72 | class Edge; |
---|
[108] | 73 | |
---|
[104] | 74 | |
---|
| 75 | public: |
---|
| 76 | |
---|
[946] | 77 | SmartGraphBase() : nodes(), edges() { } |
---|
| 78 | SmartGraphBase(const SmartGraphBase &_g) : nodes(_g.nodes), edges(_g.edges) { } |
---|
[104] | 79 | |
---|
[813] | 80 | ///Number of nodes. |
---|
| 81 | int nodeNum() const { return nodes.size(); } |
---|
| 82 | ///Number of edges. |
---|
| 83 | int edgeNum() const { return edges.size(); } |
---|
[104] | 84 | |
---|
[813] | 85 | /// Maximum node ID. |
---|
| 86 | |
---|
| 87 | /// Maximum node ID. |
---|
| 88 | ///\sa id(Node) |
---|
| 89 | int maxNodeId() const { return nodes.size()-1; } |
---|
| 90 | /// Maximum edge ID. |
---|
| 91 | |
---|
| 92 | /// Maximum edge ID. |
---|
| 93 | ///\sa id(Edge) |
---|
| 94 | int maxEdgeId() const { return edges.size()-1; } |
---|
[108] | 95 | |
---|
[164] | 96 | Node tail(Edge e) const { return edges[e.n].tail; } |
---|
| 97 | Node head(Edge e) const { return edges[e.n].head; } |
---|
[104] | 98 | |
---|
[813] | 99 | /// Node ID. |
---|
| 100 | |
---|
| 101 | /// The ID of a valid Node is a nonnegative integer not greater than |
---|
| 102 | /// \ref maxNodeId(). The range of the ID's is not surely continuous |
---|
| 103 | /// and the greatest node ID can be actually less then \ref maxNodeId(). |
---|
| 104 | /// |
---|
| 105 | /// The ID of the \ref INVALID node is -1. |
---|
| 106 | ///\return The ID of the node \c v. |
---|
[713] | 107 | static int id(Node v) { return v.n; } |
---|
[813] | 108 | /// Edge ID. |
---|
| 109 | |
---|
| 110 | /// The ID of a valid Edge is a nonnegative integer not greater than |
---|
| 111 | /// \ref maxEdgeId(). The range of the ID's is not surely continuous |
---|
| 112 | /// and the greatest edge ID can be actually less then \ref maxEdgeId(). |
---|
| 113 | /// |
---|
| 114 | /// The ID of the \ref INVALID edge is -1. |
---|
| 115 | ///\return The ID of the edge \c e. |
---|
[713] | 116 | static int id(Edge e) { return e.n; } |
---|
[104] | 117 | |
---|
[164] | 118 | Node addNode() { |
---|
| 119 | Node n; n.n=nodes.size(); |
---|
[104] | 120 | nodes.push_back(NodeT()); //FIXME: Hmmm... |
---|
| 121 | return n; |
---|
| 122 | } |
---|
[108] | 123 | |
---|
[164] | 124 | Edge addEdge(Node u, Node v) { |
---|
| 125 | Edge e; e.n=edges.size(); edges.push_back(EdgeT()); //FIXME: Hmmm... |
---|
[104] | 126 | edges[e.n].tail=u.n; edges[e.n].head=v.n; |
---|
| 127 | edges[e.n].next_out=nodes[u.n].first_out; |
---|
| 128 | edges[e.n].next_in=nodes[v.n].first_in; |
---|
| 129 | nodes[u.n].first_out=nodes[v.n].first_in=e.n; |
---|
[108] | 130 | |
---|
[104] | 131 | return e; |
---|
| 132 | } |
---|
| 133 | |
---|
[774] | 134 | /// Finds an edge between two nodes. |
---|
| 135 | |
---|
| 136 | /// Finds an edge from node \c u to node \c v. |
---|
| 137 | /// |
---|
| 138 | /// If \c prev is \ref INVALID (this is the default value), then |
---|
| 139 | /// It finds the first edge from \c u to \c v. Otherwise it looks for |
---|
| 140 | /// the next edge from \c u to \c v after \c prev. |
---|
| 141 | /// \return The found edge or INVALID if there is no such an edge. |
---|
| 142 | Edge findEdge(Node u,Node v, Edge prev = INVALID) |
---|
| 143 | { |
---|
| 144 | int e = (prev.n==-1)? nodes[u.n].first_out : edges[prev.n].next_out; |
---|
| 145 | while(e!=-1 && edges[e].tail!=v.n) e = edges[e].next_out; |
---|
| 146 | prev.n=e; |
---|
| 147 | return prev; |
---|
| 148 | } |
---|
| 149 | |
---|
[782] | 150 | void clear() { |
---|
| 151 | edges.clear(); |
---|
| 152 | nodes.clear(); |
---|
| 153 | } |
---|
[104] | 154 | |
---|
[946] | 155 | |
---|
[164] | 156 | class Node { |
---|
[946] | 157 | friend class SmartGraphBase; |
---|
[104] | 158 | |
---|
| 159 | protected: |
---|
| 160 | int n; |
---|
[164] | 161 | Node(int nn) {n=nn;} |
---|
[104] | 162 | public: |
---|
[164] | 163 | Node() {} |
---|
[503] | 164 | Node (Invalid) { n=-1; } |
---|
[164] | 165 | bool operator==(const Node i) const {return n==i.n;} |
---|
| 166 | bool operator!=(const Node i) const {return n!=i.n;} |
---|
| 167 | bool operator<(const Node i) const {return n<i.n;} |
---|
[104] | 168 | }; |
---|
| 169 | |
---|
| 170 | |
---|
[164] | 171 | class Edge { |
---|
[946] | 172 | friend class SmartGraphBase; |
---|
[185] | 173 | |
---|
[104] | 174 | protected: |
---|
| 175 | int n; |
---|
[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 | |
---|
[104] | 217 | }; |
---|
[185] | 218 | |
---|
[946] | 219 | typedef AlterableGraphExtender<SmartGraphBase> AlterableSmartGraphBase; |
---|
| 220 | typedef IterableGraphExtender<AlterableSmartGraphBase> IterableSmartGraphBase; |
---|
| 221 | typedef IdMappableGraphExtender<IterableSmartGraphBase> IdMappableSmartGraphBase; |
---|
| 222 | typedef DefaultMappableGraphExtender<IdMappableSmartGraphBase> MappableSmartGraphBase; |
---|
| 223 | typedef ExtendableGraphExtender<MappableSmartGraphBase> ExtendableSmartGraphBase; |
---|
| 224 | typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase; |
---|
[937] | 225 | |
---|
[950] | 226 | ///A smart graph class. |
---|
[937] | 227 | |
---|
[950] | 228 | ///This is a simple and fast graph implementation. |
---|
| 229 | ///It is also quite memory efficient, but at the price |
---|
| 230 | ///that <b> it does not support node and edge deletion</b>. |
---|
| 231 | ///It conforms to |
---|
| 232 | ///the \ref skeleton::ExtendableGraph "ExtendableGraph" concept. |
---|
| 233 | ///\sa skeleton::ExtendableGraph. |
---|
| 234 | /// |
---|
| 235 | ///\todo Some member functions could be \c static. |
---|
| 236 | /// |
---|
| 237 | ///\todo A possibly useful functionality: a function saveState() |
---|
| 238 | ///(or snapshot() ) would |
---|
| 239 | ///give back a data sturcture X and then the function restoreState(X) |
---|
| 240 | ///(or rollBack() ) |
---|
| 241 | ///would remove the nodes and edges added after the call of saveState(). |
---|
| 242 | ///Of course it should be used as a stack. (Maybe X is not necessary.) |
---|
| 243 | /// |
---|
| 244 | ///\author Alpar Juttner |
---|
| 245 | class SmartGraph :public ClearableSmartGraphBase { }; |
---|
| 246 | |
---|
[946] | 247 | template <> |
---|
| 248 | int countNodes<SmartGraph>(const SmartGraph& graph) { |
---|
| 249 | return graph.nodeNum(); |
---|
| 250 | } |
---|
[937] | 251 | |
---|
[946] | 252 | template <> |
---|
| 253 | int countEdges<SmartGraph>(const SmartGraph& graph) { |
---|
| 254 | return graph.edgeNum(); |
---|
| 255 | } |
---|
[937] | 256 | |
---|
[407] | 257 | /// @} |
---|
[921] | 258 | } //namespace lemon |
---|
[104] | 259 | |
---|
[157] | 260 | |
---|
| 261 | |
---|
| 262 | |
---|
[921] | 263 | #endif //LEMON_SMART_GRAPH_H |
---|