deba@1979: /* -*- C++ -*-
deba@1979:  *
deba@1979:  * This file is a part of LEMON, a generic C++ optimization library
deba@1979:  *
deba@1979:  * Copyright (C) 2003-2006
deba@1979:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@1979:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@1979:  *
deba@1979:  * Permission to use, modify and distribute this software is granted
deba@1979:  * provided that this copyright notice appears in all copies. For
deba@1979:  * precise terms see the accompanying LICENSE file.
deba@1979:  *
deba@1979:  * This software is provided "AS IS" with no warranty of any kind,
deba@1979:  * express or implied, and with no claim as to its suitability for any
deba@1979:  * purpose.
deba@1979:  *
deba@1979:  */
deba@1979: 
deba@1979: #ifndef LEMON_GRAPH_ADAPTOR_EXTENDER_H
deba@1979: #define LEMON_GRAPH_ADAPTOR_EXTENDER_H
deba@1979: 
deba@1979: 
deba@1979: namespace lemon {
deba@1979: 
deba@1979:   template <typename Base>
deba@1979:   class GraphAdaptorExtender : public Base {
deba@1979:   public:
deba@1979: 
deba@1979:     typedef Base Parent;
deba@1979:     typedef GraphAdaptorExtender Graph;
deba@1979: 
deba@1979:     // Base extensions
deba@1979: 
deba@1979:     typedef typename Parent::Node Node;
deba@1979:     typedef typename Parent::Edge Edge;
deba@1979: 
deba@1979:     int maxId(Node) const {
deba@1979:       return Parent::maxNodeId();
deba@1979:     }
deba@1979: 
deba@1979:     int maxId(Edge) const {
deba@1979:       return Parent::maxEdgeId();
deba@1979:     }
deba@1979: 
deba@1979:     Node fromId(int id, Node) const {
deba@1979:       return Parent::nodeFromId(id);
deba@1979:     }
deba@1979: 
deba@1979:     Edge fromId(int id, Edge) const {
deba@1979:       return Parent::edgeFromId(id);
deba@1979:     }
deba@1979: 
deba@1979:     Node oppositeNode(const Node &n, const Edge &e) const {
deba@1979:       if (n == Parent::source(e))
deba@1979: 	return Parent::target(e);
deba@1979:       else if(n==Parent::target(e))
deba@1979: 	return Parent::source(e);
deba@1979:       else
deba@1979: 	return INVALID;
deba@1979:     }
deba@1979: 
deba@1979:     class NodeIt : public Node { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       NodeIt() {}
deba@1979: 
deba@1979:       NodeIt(Invalid i) : Node(i) { }
deba@1979: 
deba@1979:       explicit NodeIt(const Graph& _graph) : graph(&_graph) {
deba@1979: 	_graph.first(*static_cast<Node*>(this));
deba@1979:       }
deba@1979: 
deba@1979:       NodeIt(const Graph& _graph, const Node& node) 
deba@1979: 	: Node(node), graph(&_graph) {}
deba@1979: 
deba@1979:       NodeIt& operator++() { 
deba@1979: 	graph->next(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979: 
deba@1979:     class EdgeIt : public Edge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       EdgeIt() { }
deba@1979: 
deba@1979:       EdgeIt(Invalid i) : Edge(i) { }
deba@1979: 
deba@1979:       explicit EdgeIt(const Graph& _graph) : graph(&_graph) {
deba@1979: 	_graph.first(*static_cast<Edge*>(this));
deba@1979:       }
deba@1979: 
deba@1979:       EdgeIt(const Graph& _graph, const Edge& e) : 
deba@1979: 	Edge(e), graph(&_graph) { }
deba@1979: 
deba@1979:       EdgeIt& operator++() { 
deba@1979: 	graph->next(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979: 
deba@1979:     class OutEdgeIt : public Edge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       OutEdgeIt() { }
deba@1979: 
deba@1979:       OutEdgeIt(Invalid i) : Edge(i) { }
deba@1979: 
deba@1979:       OutEdgeIt(const Graph& _graph, const Node& node) 
deba@1979: 	: graph(&_graph) {
deba@1979: 	_graph.firstOut(*this, node);
deba@1979:       }
deba@1979: 
deba@1979:       OutEdgeIt(const Graph& _graph, const Edge& edge) 
deba@1979: 	: Edge(edge), graph(&_graph) {}
deba@1979: 
deba@1979:       OutEdgeIt& operator++() { 
deba@1979: 	graph->nextOut(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979: 
deba@1979:     class InEdgeIt : public Edge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       InEdgeIt() { }
deba@1979: 
deba@1979:       InEdgeIt(Invalid i) : Edge(i) { }
deba@1979: 
deba@1979:       InEdgeIt(const Graph& _graph, const Node& node) 
deba@1979: 	: graph(&_graph) {
deba@1979: 	_graph.firstIn(*this, node);
deba@1979:       }
deba@1979: 
deba@1979:       InEdgeIt(const Graph& _graph, const Edge& edge) : 
deba@1979: 	Edge(edge), graph(&_graph) {}
deba@1979: 
deba@1979:       InEdgeIt& operator++() { 
deba@1979: 	graph->nextIn(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979:     /// \brief Base node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the base node (ie. the source in this case) of the iterator
deba@1979:     Node baseNode(const OutEdgeIt &e) const {
deba@1979:       return Parent::source(e);
deba@1979:     }
deba@1979:     /// \brief Running node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the running node (ie. the target in this case) of the
deba@1979:     /// iterator
deba@1979:     Node runningNode(const OutEdgeIt &e) const {
deba@1979:       return Parent::target(e);
deba@1979:     }
deba@1979: 
deba@1979:     /// \brief Base node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the base node (ie. the target in this case) of the iterator
deba@1979:     Node baseNode(const InEdgeIt &e) const {
deba@1979:       return Parent::target(e);
deba@1979:     }
deba@1979:     /// \brief Running node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the running node (ie. the source in this case) of the
deba@1979:     /// iterator
deba@1979:     Node runningNode(const InEdgeIt &e) const {
deba@1979:       return Parent::source(e);
deba@1979:     }
deba@1979: 
deba@1979:   };
deba@1979: 
deba@1979: 
deba@1979:   template <typename Base> 
deba@1979:   class UGraphAdaptorExtender : public Base {
deba@1979:   public:
deba@1979:     
deba@1979:     typedef Base Parent;
deba@1979:     typedef UGraphAdaptorExtender Graph;
deba@1979: 
deba@1979:     typedef typename Parent::Node Node;
deba@1979:     typedef typename Parent::Edge Edge;
deba@1979:     typedef typename Parent::UEdge UEdge;
deba@1979: 
deba@1979:     // UGraph extension    
deba@1979: 
deba@1979:     int maxId(Node) const {
deba@1979:       return Parent::maxNodeId();
deba@1979:     }
deba@1979: 
deba@1979:     int maxId(Edge) const {
deba@1979:       return Parent::maxEdgeId();
deba@1979:     }
deba@1979: 
deba@1979:     int maxId(UEdge) const {
deba@1979:       return Parent::maxUEdgeId();
deba@1979:     }
deba@1979: 
deba@1979:     Node fromId(int id, Node) const {
deba@1979:       return Parent::nodeFromId(id);
deba@1979:     }
deba@1979: 
deba@1979:     Edge fromId(int id, Edge) const {
deba@1979:       return Parent::edgeFromId(id);
deba@1979:     }
deba@1979: 
deba@1979:     UEdge fromId(int id, UEdge) const {
deba@1979:       return Parent::uEdgeFromId(id);
deba@1979:     }
deba@1979: 
deba@1979:     Node oppositeNode(const Node &n, const UEdge &e) const {
deba@1979:       if( n == Parent::source(e))
deba@1979: 	return Parent::target(e);
deba@1979:       else if( n == Parent::target(e))
deba@1979: 	return Parent::source(e);
deba@1979:       else
deba@1979: 	return INVALID;
deba@1979:     }
deba@1979: 
deba@1979:     Edge oppositeEdge(const Edge &e) const {
deba@1979:       return Parent::direct(e, !Parent::direction(e));
deba@1979:     }
deba@1979: 
deba@1979:     using Parent::direct;
deba@1979:     Edge direct(const UEdge &ue, const Node &s) const {
deba@1979:       return Parent::direct(ue, Parent::source(ue) == s);
deba@1979:     }
deba@1979: 
deba@1979: 
deba@1979:     class NodeIt : public Node { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       NodeIt() {}
deba@1979: 
deba@1979:       NodeIt(Invalid i) : Node(i) { }
deba@1979: 
deba@1979:       explicit NodeIt(const Graph& _graph) : graph(&_graph) {
deba@1979: 	_graph.first(*static_cast<Node*>(this));
deba@1979:       }
deba@1979: 
deba@1979:       NodeIt(const Graph& _graph, const Node& node) 
deba@1979: 	: Node(node), graph(&_graph) {}
deba@1979: 
deba@1979:       NodeIt& operator++() { 
deba@1979: 	graph->next(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979: 
deba@1979:     class EdgeIt : public Edge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       EdgeIt() { }
deba@1979: 
deba@1979:       EdgeIt(Invalid i) : Edge(i) { }
deba@1979: 
deba@1979:       explicit EdgeIt(const Graph& _graph) : graph(&_graph) {
deba@1979: 	_graph.first(*static_cast<Edge*>(this));
deba@1979:       }
deba@1979: 
deba@1979:       EdgeIt(const Graph& _graph, const Edge& e) : 
deba@1979: 	Edge(e), graph(&_graph) { }
deba@1979: 
deba@1979:       EdgeIt& operator++() { 
deba@1979: 	graph->next(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979: 
deba@1979:     class OutEdgeIt : public Edge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       OutEdgeIt() { }
deba@1979: 
deba@1979:       OutEdgeIt(Invalid i) : Edge(i) { }
deba@1979: 
deba@1979:       OutEdgeIt(const Graph& _graph, const Node& node) 
deba@1979: 	: graph(&_graph) {
deba@1979: 	_graph.firstOut(*this, node);
deba@1979:       }
deba@1979: 
deba@1979:       OutEdgeIt(const Graph& _graph, const Edge& edge) 
deba@1979: 	: Edge(edge), graph(&_graph) {}
deba@1979: 
deba@1979:       OutEdgeIt& operator++() { 
deba@1979: 	graph->nextOut(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979: 
deba@1979:     class InEdgeIt : public Edge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       InEdgeIt() { }
deba@1979: 
deba@1979:       InEdgeIt(Invalid i) : Edge(i) { }
deba@1979: 
deba@1979:       InEdgeIt(const Graph& _graph, const Node& node) 
deba@1979: 	: graph(&_graph) {
deba@1979: 	_graph.firstIn(*this, node);
deba@1979:       }
deba@1979: 
deba@1979:       InEdgeIt(const Graph& _graph, const Edge& edge) : 
deba@1979: 	Edge(edge), graph(&_graph) {}
deba@1979: 
deba@1979:       InEdgeIt& operator++() { 
deba@1979: 	graph->nextIn(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979:     class UEdgeIt : public Parent::UEdge { 
deba@1979:       const Graph* graph;
deba@1979:     public:
deba@1979: 
deba@1979:       UEdgeIt() { }
deba@1979: 
deba@1979:       UEdgeIt(Invalid i) : UEdge(i) { }
deba@1979: 
deba@1979:       explicit UEdgeIt(const Graph& _graph) : graph(&_graph) {
deba@1979: 	_graph.first(*static_cast<UEdge*>(this));
deba@1979:       }
deba@1979: 
deba@1979:       UEdgeIt(const Graph& _graph, const UEdge& e) : 
deba@1979: 	UEdge(e), graph(&_graph) { }
deba@1979: 
deba@1979:       UEdgeIt& operator++() { 
deba@1979: 	graph->next(*this);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979: 
deba@1979:     };
deba@1979: 
deba@1979:     class IncEdgeIt : public Parent::UEdge { 
deba@1979:       friend class UGraphAdaptorExtender;
deba@1979:       const Graph* graph;
deba@1979:       bool direction;
deba@1979:     public:
deba@1979: 
deba@1979:       IncEdgeIt() { }
deba@1979: 
deba@1979:       IncEdgeIt(Invalid i) : UEdge(i), direction(false) { }
deba@1979: 
deba@1979:       IncEdgeIt(const Graph& _graph, const Node &n) : graph(&_graph) {
deba@1979: 	_graph.firstInc(static_cast<UEdge&>(*this), direction, n);
deba@1979:       }
deba@1979: 
deba@1979:       IncEdgeIt(const Graph& _graph, const UEdge &ue, const Node &n)
deba@1979: 	: graph(&_graph), UEdge(ue) {
deba@1979: 	direction = (_graph.source(ue) == n);
deba@1979:       }
deba@1979: 
deba@1979:       IncEdgeIt& operator++() {
deba@1979: 	graph->nextInc(*this, direction);
deba@1979: 	return *this; 
deba@1979:       }
deba@1979:     };
deba@1979: 
deba@1979:     /// \brief Base node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the base node (ie. the source in this case) of the iterator
deba@1979:     Node baseNode(const OutEdgeIt &e) const {
deba@1979:       return Parent::source((Edge)e);
deba@1979:     }
deba@1979:     /// \brief Running node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the running node (ie. the target in this case) of the
deba@1979:     /// iterator
deba@1979:     Node runningNode(const OutEdgeIt &e) const {
deba@1979:       return Parent::target((Edge)e);
deba@1979:     }
deba@1979: 
deba@1979:     /// \brief Base node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the base node (ie. the target in this case) of the iterator
deba@1979:     Node baseNode(const InEdgeIt &e) const {
deba@1979:       return Parent::target((Edge)e);
deba@1979:     }
deba@1979:     /// \brief Running node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the running node (ie. the source in this case) of the
deba@1979:     /// iterator
deba@1979:     Node runningNode(const InEdgeIt &e) const {
deba@1979:       return Parent::source((Edge)e);
deba@1979:     }
deba@1979: 
deba@1979:     /// Base node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the base node of the iterator
deba@1979:     Node baseNode(const IncEdgeIt &e) const {
deba@1979:       return e.direction ? source(e) : target(e);
deba@1979:     }
deba@1979:     /// Running node of the iterator
deba@1979:     ///
deba@1979:     /// Returns the running node of the iterator
deba@1979:     Node runningNode(const IncEdgeIt &e) const {
deba@1979:       return e.direction ? target(e) : source(e);
deba@1979:     }
deba@1979: 
deba@1979:   };
deba@1979: 
deba@1979: 
deba@1979: }
deba@1979: 
deba@1979: 
deba@1979: #endif