alpar@1956: /* -*- C++ -*-
alpar@1956:  *
alpar@1956:  * This file is a part of LEMON, a generic C++ optimization library
alpar@1956:  *
alpar@1956:  * Copyright (C) 2003-2006
alpar@1956:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@1956:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@1956:  *
alpar@1956:  * Permission to use, modify and distribute this software is granted
alpar@1956:  * provided that this copyright notice appears in all copies. For
alpar@1956:  * precise terms see the accompanying LICENSE file.
alpar@1956:  *
alpar@1956:  * This software is provided "AS IS" with no warranty of any kind,
alpar@1956:  * express or implied, and with no claim as to its suitability for any
alpar@1956:  * purpose.
alpar@1956:  *
alpar@1956:  */
klao@946: 
klao@946: #ifndef LEMON_EXTENDABLE_GRAPH_EXTENDER_H
klao@946: #define LEMON_EXTENDABLE_GRAPH_EXTENDER_H
klao@946: 
klao@946: namespace lemon {
klao@946: 
klao@946:   template <typename _Base> 
klao@946:   class ExtendableGraphExtender : public _Base {
klao@946:   public:
klao@946: 
klao@946:     typedef ExtendableGraphExtender Graph;
klao@946:     typedef _Base Parent;
klao@946: 
klao@946:     typedef typename Parent::Node Node;
klao@946:     typedef typename Parent::Edge Edge;
klao@946: 
klao@946:     Node addNode() {
klao@946:       Node node = Parent::addNode();
deba@1039:       Parent::getNotifier(Node()).add(node);
klao@946:       return node;
klao@946:     }
klao@946:     
klao@946:     Edge addEdge(const Node& from, const Node& to) {
klao@946:       Edge edge = Parent::addEdge(from, to);
deba@1039:       Parent::getNotifier(Edge()).add(edge);
klao@946:       return edge;
klao@946:     }
klao@946: 
klao@946:   };
klao@946: 
klao@1022:   template <typename _Base> 
deba@1842:   class ExtendableEdgeSetExtender : public _Base {
deba@1842:   public:
deba@1842: 
deba@1842:     typedef ExtendableEdgeSetExtender Graph;
deba@1842:     typedef _Base Parent;
deba@1842: 
deba@1842:     typedef typename Parent::Edge Edge;
deba@1842:     typedef typename Parent::Node Node;
deba@1842: 
deba@1842:     Edge addEdge(const Node& from, const Node& to) {
deba@1842:       Edge edge = Parent::addEdge(from, to);
deba@1842:       Parent::getNotifier(Edge()).add(edge);
deba@1842:       return edge;
deba@1842:     }
deba@1842: 
deba@1842:   };
deba@1842: 
deba@1842:   template <typename _Base> 
klao@1909:   class ExtendableUGraphExtender : public _Base {
klao@1022:   public:
klao@1022: 
klao@1909:     typedef ExtendableUGraphExtender Graph;
klao@1022:     typedef _Base Parent;
klao@1022: 
klao@1022:     typedef typename Parent::Node Node;
klao@1022:     typedef typename Parent::Edge Edge;
klao@1909:     typedef typename Parent::UEdge UEdge;
klao@1022: 
klao@1022:     Node addNode() {
klao@1022:       Node node = Parent::addNode();
deba@1039:       Parent::getNotifier(Node()).add(node);
klao@1022:       return node;
klao@1022:     }
klao@1022: 
klao@1909:     UEdge addEdge(const Node& from, const Node& to) {
klao@1909:       UEdge uedge = Parent::addEdge(from, to);
klao@1909:       Parent::getNotifier(UEdge()).add(uedge);
klao@1022: 
deba@1414:       std::vector<Edge> edges;
deba@1627:       edges.push_back(Parent::direct(uedge, true));
deba@1627:       edges.push_back(Parent::direct(uedge, false));
deba@1414:       Parent::getNotifier(Edge()).add(edges);
klao@1022: 
klao@1022:       return uedge;
klao@1022:     }
klao@1022: 
klao@1022:   };
klao@1022: 
deba@1842:   template <typename _Base> 
klao@1909:   class ExtendableUEdgeSetExtender : public _Base {
deba@1842:   public:
deba@1842: 
klao@1909:     typedef ExtendableUEdgeSetExtender Graph;
deba@1842:     typedef _Base Parent;
deba@1842: 
deba@1842:     typedef typename Parent::Node Node;
deba@1842:     typedef typename Parent::Edge Edge;
klao@1909:     typedef typename Parent::UEdge UEdge;
deba@1842: 
klao@1909:     UEdge addEdge(const Node& from, const Node& to) {
klao@1909:       UEdge uedge = Parent::addEdge(from, to);
klao@1909:       Parent::getNotifier(UEdge()).add(uedge);
deba@1842: 
deba@1842:       std::vector<Edge> edges;
deba@1842:       edges.push_back(Parent::direct(uedge, true));
deba@1842:       edges.push_back(Parent::direct(uedge, false));
deba@1842:       Parent::getNotifier(Edge()).add(edges);
deba@1842: 
deba@1842:       return uedge;
deba@1842:     }
deba@1842: 
deba@1842:   };
deba@1842: 
deba@1820: 
deba@1820:   template <typename _Base>
deba@1910:   class ExtendableBpUGraphExtender : public _Base {
deba@1820:   public:
deba@1820: 
deba@1820:     typedef _Base Parent;
deba@1910:     typedef ExtendableBpUGraphExtender Graph;
deba@1820:   
deba@1820:     typedef typename Parent::Node Node;
deba@1910:     typedef typename Parent::BNode BNode;
deba@1910:     typedef typename Parent::ANode ANode;
deba@1820:     typedef typename Parent::Edge Edge;
klao@1909:     typedef typename Parent::UEdge UEdge;
deba@1820:   
deba@1910:     Node addANode() {
deba@1910:       Node node = Parent::addANode();
deba@1910:       Parent::getNotifier(ANode()).add(node);
deba@1820:       Parent::getNotifier(Node()).add(node);
deba@1820:       return node;
deba@1820:     }
deba@1820: 
deba@1910:     Node addBNode() {
deba@1910:       Node node = Parent::addBNode();
deba@1910:       Parent::getNotifier(BNode()).add(node);
deba@1820:       Parent::getNotifier(Node()).add(node);
deba@1820:       return node;
deba@1820:     }
deba@1820:   
klao@1909:     UEdge addEdge(const Node& source, const Node& target) {
klao@1909:       UEdge uedge = Parent::addEdge(source, target);
klao@1909:       Parent::getNotifier(UEdge()).add(uedge);
deba@1820:     
deba@1820:       std::vector<Edge> edges;
klao@1909:       edges.push_back(Parent::direct(uedge, true));
klao@1909:       edges.push_back(Parent::direct(uedge, false));
deba@1820:       Parent::getNotifier(Edge()).add(edges);
deba@1820:     
klao@1909:       return uedge;
deba@1820:     }
deba@1820: 
deba@1820:   };
deba@1820: 
klao@946: }
klao@946: 
klao@946: #endif