1.1 --- a/lemon/bits/extendable_graph_extender.h Wed Feb 22 12:45:59 2006 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,166 +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_EXTENDABLE_GRAPH_EXTENDER_H
1.23 -#define LEMON_EXTENDABLE_GRAPH_EXTENDER_H
1.24 -
1.25 -namespace lemon {
1.26 -
1.27 - template <typename _Base>
1.28 - class ExtendableGraphExtender : public _Base {
1.29 - public:
1.30 -
1.31 - typedef ExtendableGraphExtender Graph;
1.32 - typedef _Base Parent;
1.33 -
1.34 - typedef typename Parent::Node Node;
1.35 - typedef typename Parent::Edge Edge;
1.36 -
1.37 - Node addNode() {
1.38 - Node node = Parent::addNode();
1.39 - Parent::getNotifier(Node()).add(node);
1.40 - return node;
1.41 - }
1.42 -
1.43 - Edge addEdge(const Node& from, const Node& to) {
1.44 - Edge edge = Parent::addEdge(from, to);
1.45 - Parent::getNotifier(Edge()).add(edge);
1.46 - return edge;
1.47 - }
1.48 -
1.49 - };
1.50 -
1.51 - template <typename _Base>
1.52 - class ExtendableEdgeSetExtender : public _Base {
1.53 - public:
1.54 -
1.55 - typedef ExtendableEdgeSetExtender Graph;
1.56 - typedef _Base Parent;
1.57 -
1.58 - typedef typename Parent::Edge Edge;
1.59 - typedef typename Parent::Node Node;
1.60 -
1.61 - Edge addEdge(const Node& from, const Node& to) {
1.62 - Edge edge = Parent::addEdge(from, to);
1.63 - Parent::getNotifier(Edge()).add(edge);
1.64 - return edge;
1.65 - }
1.66 -
1.67 - };
1.68 -
1.69 - template <typename _Base>
1.70 - class ExtendableUGraphExtender : public _Base {
1.71 - public:
1.72 -
1.73 - typedef ExtendableUGraphExtender Graph;
1.74 - typedef _Base Parent;
1.75 -
1.76 - typedef typename Parent::Node Node;
1.77 - typedef typename Parent::Edge Edge;
1.78 - typedef typename Parent::UEdge UEdge;
1.79 -
1.80 - Node addNode() {
1.81 - Node node = Parent::addNode();
1.82 - Parent::getNotifier(Node()).add(node);
1.83 - return node;
1.84 - }
1.85 -
1.86 - UEdge addEdge(const Node& from, const Node& to) {
1.87 - UEdge uedge = Parent::addEdge(from, to);
1.88 - Parent::getNotifier(UEdge()).add(uedge);
1.89 -
1.90 - std::vector<Edge> edges;
1.91 - edges.push_back(Parent::direct(uedge, true));
1.92 - edges.push_back(Parent::direct(uedge, false));
1.93 - Parent::getNotifier(Edge()).add(edges);
1.94 -
1.95 - return uedge;
1.96 - }
1.97 -
1.98 - };
1.99 -
1.100 - template <typename _Base>
1.101 - class ExtendableUEdgeSetExtender : public _Base {
1.102 - public:
1.103 -
1.104 - typedef ExtendableUEdgeSetExtender Graph;
1.105 - typedef _Base Parent;
1.106 -
1.107 - typedef typename Parent::Node Node;
1.108 - typedef typename Parent::Edge Edge;
1.109 - typedef typename Parent::UEdge UEdge;
1.110 -
1.111 - UEdge addEdge(const Node& from, const Node& to) {
1.112 - UEdge uedge = Parent::addEdge(from, to);
1.113 - Parent::getNotifier(UEdge()).add(uedge);
1.114 -
1.115 - std::vector<Edge> edges;
1.116 - edges.push_back(Parent::direct(uedge, true));
1.117 - edges.push_back(Parent::direct(uedge, false));
1.118 - Parent::getNotifier(Edge()).add(edges);
1.119 -
1.120 - return uedge;
1.121 - }
1.122 -
1.123 - };
1.124 -
1.125 -
1.126 - template <typename _Base>
1.127 - class ExtendableBpUGraphExtender : public _Base {
1.128 - public:
1.129 -
1.130 - typedef _Base Parent;
1.131 - typedef ExtendableBpUGraphExtender Graph;
1.132 -
1.133 - typedef typename Parent::Node Node;
1.134 - typedef typename Parent::BNode BNode;
1.135 - typedef typename Parent::ANode ANode;
1.136 - typedef typename Parent::Edge Edge;
1.137 - typedef typename Parent::UEdge UEdge;
1.138 -
1.139 - Node addANode() {
1.140 - Node node = Parent::addANode();
1.141 - Parent::getNotifier(ANode()).add(node);
1.142 - Parent::getNotifier(Node()).add(node);
1.143 - return node;
1.144 - }
1.145 -
1.146 - Node addBNode() {
1.147 - Node node = Parent::addBNode();
1.148 - Parent::getNotifier(BNode()).add(node);
1.149 - Parent::getNotifier(Node()).add(node);
1.150 - return node;
1.151 - }
1.152 -
1.153 - UEdge addEdge(const Node& source, const Node& target) {
1.154 - UEdge uedge = Parent::addEdge(source, target);
1.155 - Parent::getNotifier(UEdge()).add(uedge);
1.156 -
1.157 - std::vector<Edge> edges;
1.158 - edges.push_back(Parent::direct(uedge, true));
1.159 - edges.push_back(Parent::direct(uedge, false));
1.160 - Parent::getNotifier(Edge()).add(edges);
1.161 -
1.162 - return uedge;
1.163 - }
1.164 -
1.165 - };
1.166 -
1.167 -}
1.168 -
1.169 -#endif