1.1 --- a/lemon/list_bpugraph.h Fri Jun 30 12:14:36 2006 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,398 +0,0 @@
1.4 -/* -*- C++ -*-
1.5 - *
1.6 - * This file is a part of LEMON, a generic C++ optimization library
1.7 - *
1.8 - * Copyright (C) 2003-2006
1.9 - * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 - * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 - *
1.12 - * Permission to use, modify and distribute this software is granted
1.13 - * provided that this copyright notice appears in all copies. For
1.14 - * precise terms see the accompanying LICENSE file.
1.15 - *
1.16 - * This software is provided "AS IS" with no warranty of any kind,
1.17 - * express or implied, and with no claim as to its suitability for any
1.18 - * purpose.
1.19 - *
1.20 - */
1.21 -
1.22 -#ifndef LEMON_LIST_BPUGRAPH_H
1.23 -#define LEMON_LIST_BPUGRAPH_H
1.24 -
1.25 -///\ingroup graphs
1.26 -///\file
1.27 -///\brief ListBpUGraph classes.
1.28 -
1.29 -#include <lemon/bits/bpugraph_extender.h>
1.30 -
1.31 -#include <lemon/error.h>
1.32 -
1.33 -#include <vector>
1.34 -#include <list>
1.35 -
1.36 -namespace lemon {
1.37 -
1.38 - class ListBpUGraphBase {
1.39 - public:
1.40 -
1.41 - class NodeSetError : public LogicError {
1.42 - virtual const char* exceptionName() const {
1.43 - return "lemon::ListBpUGraph::NodeSetError";
1.44 - }
1.45 - };
1.46 -
1.47 - protected:
1.48 -
1.49 - struct NodeT {
1.50 - int first_edge, prev, next;
1.51 - };
1.52 -
1.53 - struct UEdgeT {
1.54 - int aNode, prev_out, next_out;
1.55 - int bNode, prev_in, next_in;
1.56 - };
1.57 -
1.58 - std::vector<NodeT> aNodes;
1.59 - std::vector<NodeT> bNodes;
1.60 -
1.61 - std::vector<UEdgeT> edges;
1.62 -
1.63 - int first_anode;
1.64 - int first_free_anode;
1.65 -
1.66 - int first_bnode;
1.67 - int first_free_bnode;
1.68 -
1.69 - int first_free_edge;
1.70 -
1.71 - public:
1.72 -
1.73 - class Node {
1.74 - friend class ListBpUGraphBase;
1.75 - protected:
1.76 - int id;
1.77 -
1.78 - explicit Node(int _id) : id(_id) {}
1.79 - public:
1.80 - Node() {}
1.81 - Node(Invalid) { id = -1; }
1.82 - bool operator==(const Node i) const {return id==i.id;}
1.83 - bool operator!=(const Node i) const {return id!=i.id;}
1.84 - bool operator<(const Node i) const {return id<i.id;}
1.85 - };
1.86 -
1.87 - class UEdge {
1.88 - friend class ListBpUGraphBase;
1.89 - protected:
1.90 - int id;
1.91 -
1.92 - explicit UEdge(int _id) { id = _id;}
1.93 - public:
1.94 - UEdge() {}
1.95 - UEdge (Invalid) { id = -1; }
1.96 - bool operator==(const UEdge i) const {return id==i.id;}
1.97 - bool operator!=(const UEdge i) const {return id!=i.id;}
1.98 - bool operator<(const UEdge i) const {return id<i.id;}
1.99 - };
1.100 -
1.101 - ListBpUGraphBase()
1.102 - : first_anode(-1), first_free_anode(-1),
1.103 - first_bnode(-1), first_free_bnode(-1),
1.104 - first_free_edge(-1) {}
1.105 -
1.106 - void firstANode(Node& node) const {
1.107 - node.id = first_anode != -1 ? (first_anode << 1) : -1;
1.108 - }
1.109 - void nextANode(Node& node) const {
1.110 - node.id = aNodes[node.id >> 1].next;
1.111 - }
1.112 -
1.113 - void firstBNode(Node& node) const {
1.114 - node.id = first_bnode != -1 ? (first_bnode << 1) + 1 : -1;
1.115 - }
1.116 - void nextBNode(Node& node) const {
1.117 - node.id = bNodes[node.id >> 1].next;
1.118 - }
1.119 -
1.120 - void first(Node& node) const {
1.121 - if (first_anode != -1) {
1.122 - node.id = (first_anode << 1);
1.123 - } else if (first_bnode != -1) {
1.124 - node.id = (first_bnode << 1) + 1;
1.125 - } else {
1.126 - node.id = -1;
1.127 - }
1.128 - }
1.129 - void next(Node& node) const {
1.130 - if (aNode(node)) {
1.131 - node.id = aNodes[node.id >> 1].next;
1.132 - if (node.id == -1) {
1.133 - if (first_bnode != -1) {
1.134 - node.id = (first_bnode << 1) + 1;
1.135 - }
1.136 - }
1.137 - } else {
1.138 - node.id = bNodes[node.id >> 1].next;
1.139 - }
1.140 - }
1.141 -
1.142 - void first(UEdge& edge) const {
1.143 - int aNodeId = first_anode;
1.144 - while (aNodeId != -1 && aNodes[aNodeId].first_edge == -1) {
1.145 - aNodeId = aNodes[aNodeId].next != -1 ?
1.146 - aNodes[aNodeId].next >> 1 : -1;
1.147 - }
1.148 - if (aNodeId != -1) {
1.149 - edge.id = aNodes[aNodeId].first_edge;
1.150 - } else {
1.151 - edge.id = -1;
1.152 - }
1.153 - }
1.154 - void next(UEdge& edge) const {
1.155 - int aNodeId = edges[edge.id].aNode >> 1;
1.156 - edge.id = edges[edge.id].next_out;
1.157 - if (edge.id == -1) {
1.158 - aNodeId = aNodes[aNodeId].next != -1 ?
1.159 - aNodes[aNodeId].next >> 1 : -1;
1.160 - while (aNodeId != -1 && aNodes[aNodeId].first_edge == -1) {
1.161 - aNodeId = aNodes[aNodeId].next != -1 ?
1.162 - aNodes[aNodeId].next >> 1 : -1;
1.163 - }
1.164 - if (aNodeId != -1) {
1.165 - edge.id = aNodes[aNodeId].first_edge;
1.166 - } else {
1.167 - edge.id = -1;
1.168 - }
1.169 - }
1.170 - }
1.171 -
1.172 - void firstFromANode(UEdge& edge, const Node& node) const {
1.173 - LEMON_ASSERT((node.id & 1) == 0, NodeSetError());
1.174 - edge.id = aNodes[node.id >> 1].first_edge;
1.175 - }
1.176 - void nextFromANode(UEdge& edge) const {
1.177 - edge.id = edges[edge.id].next_out;
1.178 - }
1.179 -
1.180 - void firstFromBNode(UEdge& edge, const Node& node) const {
1.181 - LEMON_ASSERT((node.id & 1) == 1, NodeSetError());
1.182 - edge.id = bNodes[node.id >> 1].first_edge;
1.183 - }
1.184 - void nextFromBNode(UEdge& edge) const {
1.185 - edge.id = edges[edge.id].next_in;
1.186 - }
1.187 -
1.188 - static int id(const Node& node) {
1.189 - return node.id;
1.190 - }
1.191 - static Node nodeFromId(int id) {
1.192 - return Node(id);
1.193 - }
1.194 - int maxNodeId() const {
1.195 - return aNodes.size() > bNodes.size() ?
1.196 - aNodes.size() * 2 - 2 : bNodes.size() * 2 - 1;
1.197 - }
1.198 -
1.199 - static int id(const UEdge& edge) {
1.200 - return edge.id;
1.201 - }
1.202 - static UEdge uEdgeFromId(int id) {
1.203 - return UEdge(id);
1.204 - }
1.205 - int maxUEdgeId() const {
1.206 - return edges.size();
1.207 - }
1.208 -
1.209 - static int aNodeId(const Node& node) {
1.210 - return node.id >> 1;
1.211 - }
1.212 - static Node fromANodeId(int id) {
1.213 - return Node(id << 1);
1.214 - }
1.215 - int maxANodeId() const {
1.216 - return aNodes.size();
1.217 - }
1.218 -
1.219 - static int bNodeId(const Node& node) {
1.220 - return node.id >> 1;
1.221 - }
1.222 - static Node fromBNodeId(int id) {
1.223 - return Node((id << 1) + 1);
1.224 - }
1.225 - int maxBNodeId() const {
1.226 - return bNodes.size();
1.227 - }
1.228 -
1.229 - Node aNode(const UEdge& edge) const {
1.230 - return Node(edges[edge.id].aNode);
1.231 - }
1.232 - Node bNode(const UEdge& edge) const {
1.233 - return Node(edges[edge.id].bNode);
1.234 - }
1.235 -
1.236 - static bool aNode(const Node& node) {
1.237 - return (node.id & 1) == 0;
1.238 - }
1.239 -
1.240 - static bool bNode(const Node& node) {
1.241 - return (node.id & 1) == 1;
1.242 - }
1.243 -
1.244 - Node addANode() {
1.245 - int aNodeId;
1.246 - if (first_free_anode == -1) {
1.247 - aNodeId = aNodes.size();
1.248 - aNodes.push_back(NodeT());
1.249 - } else {
1.250 - aNodeId = first_free_anode;
1.251 - first_free_anode = aNodes[first_free_anode].next;
1.252 - }
1.253 - if (first_anode != -1) {
1.254 - aNodes[aNodeId].next = first_anode << 1;
1.255 - aNodes[first_anode].prev = aNodeId << 1;
1.256 - } else {
1.257 - aNodes[aNodeId].next = -1;
1.258 - }
1.259 - aNodes[aNodeId].prev = -1;
1.260 - first_anode = aNodeId;
1.261 - aNodes[aNodeId].first_edge = -1;
1.262 - return Node(aNodeId << 1);
1.263 - }
1.264 -
1.265 - Node addBNode() {
1.266 - int bNodeId;
1.267 - if (first_free_bnode == -1) {
1.268 - bNodeId = bNodes.size();
1.269 - bNodes.push_back(NodeT());
1.270 - } else {
1.271 - bNodeId = first_free_bnode;
1.272 - first_free_bnode = bNodes[first_free_bnode].next;
1.273 - }
1.274 - if (first_bnode != -1) {
1.275 - bNodes[bNodeId].next = (first_bnode << 1) + 1;
1.276 - bNodes[first_bnode].prev = (bNodeId << 1) + 1;
1.277 - } else {
1.278 - bNodes[bNodeId].next = -1;
1.279 - }
1.280 - first_bnode = bNodeId;
1.281 - bNodes[bNodeId].first_edge = -1;
1.282 - return Node((bNodeId << 1) + 1);
1.283 - }
1.284 -
1.285 - UEdge addEdge(const Node& source, const Node& target) {
1.286 - LEMON_ASSERT(((source.id ^ target.id) & 1) == 1, NodeSetError());
1.287 - int edgeId;
1.288 - if (first_free_edge != -1) {
1.289 - edgeId = first_free_edge;
1.290 - first_free_edge = edges[edgeId].next_out;
1.291 - } else {
1.292 - edgeId = edges.size();
1.293 - edges.push_back(UEdgeT());
1.294 - }
1.295 - if ((source.id & 1) == 0) {
1.296 - edges[edgeId].aNode = source.id;
1.297 - edges[edgeId].bNode = target.id;
1.298 - } else {
1.299 - edges[edgeId].aNode = target.id;
1.300 - edges[edgeId].bNode = source.id;
1.301 - }
1.302 - edges[edgeId].next_out = aNodes[edges[edgeId].aNode >> 1].first_edge;
1.303 - edges[edgeId].prev_out = -1;
1.304 - if (aNodes[edges[edgeId].aNode >> 1].first_edge != -1) {
1.305 - edges[aNodes[edges[edgeId].aNode >> 1].first_edge].prev_out = edgeId;
1.306 - }
1.307 - aNodes[edges[edgeId].aNode >> 1].first_edge = edgeId;
1.308 - edges[edgeId].next_in = bNodes[edges[edgeId].bNode >> 1].first_edge;
1.309 - edges[edgeId].prev_in = -1;
1.310 - if (bNodes[edges[edgeId].bNode >> 1].first_edge != -1) {
1.311 - edges[bNodes[edges[edgeId].bNode >> 1].first_edge].prev_in = edgeId;
1.312 - }
1.313 - bNodes[edges[edgeId].bNode >> 1].first_edge = edgeId;
1.314 - return UEdge(edgeId);
1.315 - }
1.316 -
1.317 - void erase(const Node& node) {
1.318 - if (aNode(node)) {
1.319 - int aNodeId = node.id >> 1;
1.320 - if (aNodes[aNodeId].prev != -1) {
1.321 - aNodes[aNodes[aNodeId].prev >> 1].next = aNodes[aNodeId].next;
1.322 - } else {
1.323 - first_anode = aNodes[aNodeId].next >> 1;
1.324 - }
1.325 - if (aNodes[aNodeId].next != -1) {
1.326 - aNodes[aNodes[aNodeId].next >> 1].prev = aNodes[aNodeId].prev;
1.327 - }
1.328 - aNodes[aNodeId].next = first_free_anode;
1.329 - first_free_anode = aNodeId;
1.330 - } else {
1.331 - int bNodeId = node.id >> 1;
1.332 - if (bNodes[bNodeId].prev != -1) {
1.333 - bNodes[bNodes[bNodeId].prev >> 1].next = bNodes[bNodeId].next;
1.334 - } else {
1.335 - first_bnode = bNodes[bNodeId].next >> 1;
1.336 - }
1.337 - if (bNodes[bNodeId].next != -1) {
1.338 - bNodes[bNodes[bNodeId].next >> 1].prev = bNodes[bNodeId].prev;
1.339 - }
1.340 - bNodes[bNodeId].next = first_free_bnode;
1.341 - first_free_bnode = bNodeId;
1.342 - }
1.343 - }
1.344 -
1.345 - void erase(const UEdge& edge) {
1.346 -
1.347 - if (edges[edge.id].prev_out != -1) {
1.348 - edges[edges[edge.id].prev_out].next_out = edges[edge.id].next_out;
1.349 - } else {
1.350 - aNodes[edges[edge.id].aNode >> 1].first_edge = edges[edge.id].next_out;
1.351 - }
1.352 - if (edges[edge.id].next_out != -1) {
1.353 - edges[edges[edge.id].next_out].prev_out = edges[edge.id].prev_out;
1.354 - }
1.355 -
1.356 - if (edges[edge.id].prev_in != -1) {
1.357 - edges[edges[edge.id].prev_in].next_in = edges[edge.id].next_in;
1.358 - } else {
1.359 - bNodes[edges[edge.id].bNode >> 1].first_edge = edges[edge.id].next_in;
1.360 - }
1.361 - if (edges[edge.id].next_in != -1) {
1.362 - edges[edges[edge.id].next_in].prev_in = edges[edge.id].prev_in;
1.363 - }
1.364 -
1.365 - edges[edge.id].next_out = first_free_edge;
1.366 - first_free_edge = edge.id;
1.367 - }
1.368 -
1.369 - void clear() {
1.370 - aNodes.clear();
1.371 - bNodes.clear();
1.372 - edges.clear();
1.373 - first_anode = -1;
1.374 - first_free_anode = -1;
1.375 - first_bnode = -1;
1.376 - first_free_bnode = -1;
1.377 - first_free_edge = -1;
1.378 - }
1.379 -
1.380 - };
1.381 -
1.382 -
1.383 - typedef BpUGraphExtender< ListBpUGraphBase > ExtendedListBpUGraphBase;
1.384 -
1.385 - /// \ingroup graphs
1.386 - ///
1.387 - /// \brief A smart bipartite undirected graph class.
1.388 - ///
1.389 - /// This is a bipartite undirected graph implementation.
1.390 - /// It is conforms to the \ref concept::ErasableBpUGraph "ErasableBpUGraph"
1.391 - /// concept.
1.392 - /// \sa concept::BpUGraph.
1.393 - ///
1.394 - class ListBpUGraph : public ExtendedListBpUGraphBase {};
1.395 -
1.396 -
1.397 - /// @}
1.398 -} //namespace lemon
1.399 -
1.400 -
1.401 -#endif