lemon-0.x: src/work/marci/graph_wrapper.h@be43902fadb7 (annotated)

marci@174	1	// -- c++ --
marci@259	2	#ifndef HUGO_GRAPH_WRAPPER_H
marci@259	3	#define HUGO_GRAPH_WRAPPER_H
marci@76	4
marci@174	5	#include <invalid.h>
marci@174	6
alpar@105	7	namespace hugo {
marci@76	8
marci@76	9	template<typename Graph>
marci@76	10	class TrivGraphWrapper {
marci@199	11	protected:
marci@76	12	Graph* graph;
marci@76	13
marci@76	14	public:
marci@76	15	typedef Graph BaseGraph;
marci@76	16
marci@174	17	typedef typename Graph::Node Node;
marci@265	18	class NodeIt : public Graph::NodeIt {
marci@265	19	public:
marci@265	20	NodeIt() { }
marci@265	21	NodeIt(const typename Graph::NodeIt& n) : Graph::NodeIt(n) { }
marci@265	22	NodeIt(const Invalid& i) : Graph::NodeIt(i) { }
marci@265	23	NodeIt(const TrivGraphWrapper<Graph>& _G) :
marci@265	24	Graph::NodeIt(*(_G.graph)) { }
marci@265	25	};
marci@174	26	typedef typename Graph::Edge Edge;
marci@265	27	//typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@265	28	class OutEdgeIt : public Graph::OutEdgeIt {
marci@265	29	public:
marci@265	30	OutEdgeIt() { }
marci@265	31	OutEdgeIt(const typename Graph::OutEdgeIt& e) : Graph::OutEdgeIt(e) { }
marci@265	32	OutEdgeIt(const Invalid& i) : Graph::OutEdgeIt(i) { }
marci@265	33	OutEdgeIt(const TrivGraphWrapper<Graph>& _G, const Node& n) :
marci@265	34	Graph::OutEdgeIt(*(_G.graph), n) { }
marci@265	35	};
marci@265	36	//typedef typename Graph::InEdgeIt InEdgeIt;
marci@265	37	class InEdgeIt : public Graph::InEdgeIt {
marci@265	38	public:
marci@265	39	InEdgeIt() { }
marci@265	40	InEdgeIt(const typename Graph::InEdgeIt& e) : Graph::InEdgeIt(e) { }
marci@265	41	InEdgeIt(const Invalid& i) : Graph::InEdgeIt(i) { }
marci@265	42	InEdgeIt(const TrivGraphWrapper<Graph>& _G, const Node& n) :
marci@265	43	Graph::InEdgeIt(*(_G.graph), n) { }
marci@265	44	};
marci@155	45	//typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@265	46	//typedef typename Graph::EdgeIt EdgeIt;
marci@265	47	class EdgeIt : public Graph::EdgeIt {
marci@265	48	public:
marci@265	49	EdgeIt() { }
marci@265	50	EdgeIt(const typename Graph::EdgeIt& e) : Graph::EdgeIt(e) { }
marci@265	51	EdgeIt(const Invalid& i) : Graph::EdgeIt(i) { }
marci@265	52	EdgeIt(const TrivGraphWrapper<Graph>& _G) :
marci@265	53	Graph::EdgeIt(*(_G.graph)) { }
marci@265	54	};
marci@168	55
marci@168	56	//TrivGraphWrapper() : graph(0) { }
marci@168	57	TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168	58
marci@265	59	// void setGraph(Graph& _graph) { graph = &_graph; }
marci@265	60	// Graph& getGraph() const { return (*graph); }
marci@265	61
marci@265	62	NodeIt& first(NodeIt& i) const {
marci@265	63	i=NodeIt(*this);
marci@265	64	return i;
marci@265	65	}
marci@265	66	EdgeIt& first(EdgeIt& i) const {
marci@265	67	i=EdgeIt(*this);
marci@265	68	return i;
marci@265	69	}
marci@265	70	// template<typename I> I& first(I& i) const {
marci@265	71	// //return graph->first(i);
marci@265	72	// i=I(*this);
marci@265	73	// return i;
marci@265	74	// }
marci@265	75	OutEdgeIt& first(OutEdgeIt& i, const Node& p) const {
marci@265	76	i=OutEdgeIt(*this, p);
marci@265	77	return i;
marci@265	78	}
marci@265	79	InEdgeIt& first(InEdgeIt& i, const Node& p) const {
marci@265	80	i=InEdgeIt(*this, p);
marci@265	81	return i;
marci@265	82	}
marci@265	83	// template<typename I, typename P> I& first(I& i, const P& p) const {
marci@265	84	// //return graph->first(i, p);
marci@265	85	// i=I(*this, p);
marci@265	86	// return i;
marci@265	87	// }
marci@76	88
marci@265	89	// template<typename I> I getNext(const I& i) const {
marci@265	90	// return graph->getNext(i); }
marci@265	91	template<typename I> I& next(I &i) const { graph->next(i); return i; }
marci@76	92
marci@76	93	template< typename It > It first() const {
marci@212	94	It e; first(e); return e; }
marci@76	95
marci@174	96	template< typename It > It first(const Node& v) const {
marci@212	97	It e; first(e, v); return e; }
marci@76	98
marci@174	99	Node head(const Edge& e) const { return graph->head(e); }
marci@174	100	Node tail(const Edge& e) const { return graph->tail(e); }
marci@155	101
marci@155	102	template<typename I> bool valid(const I& i) const
marci@155	103	{ return graph->valid(i); }
marci@155	104
marci@155	105	//template<typename I> void setInvalid(const I &i);
marci@155	106	//{ return graph->setInvalid(i); }
marci@155	107
marci@155	108	int nodeNum() const { return graph->nodeNum(); }
marci@155	109	int edgeNum() const { return graph->edgeNum(); }
marci@76	110
marci@174	111	template<typename I> Node aNode(const I& e) const {
marci@76	112	return graph->aNode(e); }
marci@174	113	template<typename I> Node bNode(const I& e) const {
marci@76	114	return graph->bNode(e); }
marci@76	115
marci@174	116	Node addNode() const { return graph->addNode(); }
marci@174	117	Edge addEdge(const Node& tail, const Node& head) const {
marci@76	118	return graph->addEdge(tail, head); }
marci@76	119
marci@76	120	template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@76	121
marci@76	122	void clear() const { graph->clear(); }
marci@155	123
marci@76	124	template<typename T> class NodeMap : public Graph::NodeMap<T> {
marci@76	125	public:
marci@266	126	NodeMap(const TrivGraphWrapper<Graph>& _G) :
marci@265	127	Graph::NodeMap<T>(*(_G.graph)) { }
marci@155	128	NodeMap(const TrivGraphWrapper<Graph>& _G, T a) :
marci@265	129	Graph::NodeMap<T>(*(_G.graph), a) { }
marci@76	130	};
marci@168	131
marci@155	132	template<typename T> class EdgeMap : public Graph::EdgeMap<T> {
marci@155	133	public:
marci@266	134	EdgeMap(const TrivGraphWrapper<Graph>& _G) :
marci@265	135	Graph::EdgeMap<T>(*(_G.graph)) { }
marci@155	136	EdgeMap(const TrivGraphWrapper<Graph>& _G, T a) :
marci@265	137	Graph::EdgeMap<T>(*(_G.graph), a) { }
marci@155	138	};
marci@266	139
marci@266	140	template<typename Map, typename T> class NodeMapWrapper {
marci@266	141	protected:
marci@266	142	Map* map;
marci@266	143	public:
marci@266	144	NodeMapWrapper(Map& _map) : map(&_map) { }
marci@266	145	//template<typename T>
marci@266	146	void set(Node n, T a) { map->set(n, a); }
marci@266	147	//template<typename T>
marci@266	148	T get(Node n) const { return map->get(n); }
marci@266	149	};
marci@266	150
marci@266	151	template<typename Map, typename T> class EdgeMapWrapper {
marci@266	152	protected:
marci@266	153	Map* map;
marci@266	154	public:
marci@266	155	EdgeMapWrapper(Map& _map) : map(&_map) { }
marci@266	156	//template<typename T>
marci@266	157	void set(Edge n, T a) { map->set(n, a); }
marci@266	158	//template<typename T>
marci@266	159	T get(Edge n) const { return map->get(n); }
marci@266	160	};
marci@76	161	};
marci@76	162
marci@212	163	template<typename GraphWrapper>
marci@212	164	class GraphWrapperSkeleton {
marci@212	165	protected:
marci@212	166	GraphWrapper gw;
marci@212	167
marci@212	168	public:
marci@263	169	//typedef typename GraphWrapper::BaseGraph BaseGraph;
marci@212	170
marci@265	171	// typedef typename GraphWrapper::Node Node;
marci@265	172	// typedef typename GraphWrapper::NodeIt NodeIt;
marci@265	173
marci@265	174	// typedef typename GraphWrapper::Edge Edge;
marci@265	175	// typedef typename GraphWrapper::OutEdgeIt OutEdgeIt;
marci@265	176	// typedef typename GraphWrapper::InEdgeIt InEdgeIt;
marci@265	177	// //typedef typename GraphWrapper::SymEdgeIt SymEdgeIt;
marci@265	178	// typedef typename GraphWrapper::EdgeIt EdgeIt;
marci@265	179
marci@212	180	typedef typename GraphWrapper::Node Node;
marci@265	181	class NodeIt : public GraphWrapper::NodeIt {
marci@265	182	public:
marci@265	183	NodeIt() { }
marci@265	184	NodeIt(const typename GraphWrapper::NodeIt& n) :
marci@265	185	GraphWrapper::NodeIt(n) { }
marci@265	186	NodeIt(const Invalid& i) : GraphWrapper::NodeIt(i) { }
marci@265	187	NodeIt(const GraphWrapperSkeleton<GraphWrapper>& _G) :
marci@265	188	GraphWrapper::NodeIt(_G.gw) { }
marci@265	189	};
marci@265	190	typedef typename GraphWrapper::Edge Edge;
marci@265	191	//typedef typename GraphWrapper::OutEdgeIt OutEdgeIt;
marci@265	192	class OutEdgeIt : public GraphWrapper::OutEdgeIt {
marci@265	193	public:
marci@265	194	OutEdgeIt() { }
marci@265	195	OutEdgeIt(const typename GraphWrapper::OutEdgeIt& e) :
marci@265	196	GraphWrapper::OutEdgeIt(e) { }
marci@265	197	OutEdgeIt(const Invalid& i) : GraphWrapper::OutEdgeIt(i) { }
marci@265	198	OutEdgeIt(const GraphWrapperSkeleton<GraphWrapper>& _G, const Node& n) :
marci@265	199	GraphWrapper::OutEdgeIt(_G.gw, n) { }
marci@265	200	};
marci@265	201	//typedef typename GraphWrapper::InEdgeIt InEdgeIt;
marci@265	202	class InEdgeIt : public GraphWrapper::InEdgeIt {
marci@265	203	public:
marci@265	204	InEdgeIt() { }
marci@265	205	InEdgeIt(const typename GraphWrapper::InEdgeIt& e) :
marci@265	206	GraphWrapper::InEdgeIt(e) { }
marci@265	207	InEdgeIt(const Invalid& i) : GraphWrapper::InEdgeIt(i) { }
marci@265	208	InEdgeIt(const GraphWrapperSkeleton<GraphWrapper>& _G, const Node& n) :
marci@265	209	GraphWrapper::InEdgeIt(_G.gw, n) { }
marci@265	210	};
marci@265	211	//typedef typename GraphWrapper::SymEdgeIt SymEdgeIt;
marci@265	212	//typedef typename GraphWrapper::EdgeIt EdgeIt;
marci@265	213	class EdgeIt : public GraphWrapper::EdgeIt {
marci@265	214	public:
marci@265	215	EdgeIt() { }
marci@265	216	EdgeIt(const typename GraphWrapper::EdgeIt& e) :
marci@265	217	GraphWrapper::EdgeIt(e) { }
marci@265	218	EdgeIt(const Invalid& i) : GraphWrapper::EdgeIt(i) { }
marci@265	219	EdgeIt(const GraphWrapperSkeleton<GraphWrapper>& _G) :
marci@265	220	GraphWrapper::EdgeIt(_G.gw) { }
marci@265	221	};
marci@212	222
marci@212	223
marci@212	224	//GraphWrapperSkeleton() : gw() { }
marci@230	225	GraphWrapperSkeleton(GraphWrapper _gw) : gw(_gw) { }
marci@212	226
marci@263	227	//void setGraph(BaseGraph& _graph) { gw.setGraph(_graph); }
marci@263	228	//BaseGraph& getGraph() const { return gw.getGraph(); }
marci@212	229
marci@265	230	template<typename I> I& first(I& i) const {
marci@265	231	i=I(*this);
marci@265	232	return i;
marci@265	233	}
marci@212	234	template<typename I, typename P> I& first(I& i, const P& p) const {
marci@265	235	i=I(*this, p);
marci@265	236	return i;
marci@265	237	}
marci@212	238
marci@265	239	// template<typename I> I getNext(const I& i) const { return gw.getNext(i); }
marci@265	240	template<typename I> I& next(I &i) const { gw.next(i); return i; }
marci@212	241
marci@212	242	template< typename It > It first() const {
marci@212	243	It e; this->first(e); return e; }
marci@212	244
marci@212	245	template< typename It > It first(const Node& v) const {
marci@212	246	It e; this->first(e, v); return e; }
marci@212	247
marci@212	248	Node head(const Edge& e) const { return gw.head(e); }
marci@212	249	Node tail(const Edge& e) const { return gw.tail(e); }
marci@212	250
marci@212	251	template<typename I> bool valid(const I& i) const { return gw.valid(i); }
marci@212	252
marci@212	253	//template<typename I> void setInvalid(const I &i);
marci@212	254	//{ return graph->setInvalid(i); }
marci@212	255
marci@212	256	int nodeNum() const { return gw.nodeNum(); }
marci@212	257	int edgeNum() const { return gw.edgeNum(); }
marci@212	258
marci@212	259	template<typename I> Node aNode(const I& e) const { return gw.aNode(e); }
marci@212	260	template<typename I> Node bNode(const I& e) const { return gw.bNode(e); }
marci@212	261
marci@212	262	Node addNode() const { return gw.addNode(); }
marci@212	263	Edge addEdge(const Node& tail, const Node& head) const {
marci@212	264	return gw.addEdge(tail, head); }
marci@212	265
marci@212	266	template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@212	267
marci@212	268	void clear() const { gw.clear(); }
marci@212	269
marci@212	270	template<typename T> class NodeMap : public GraphWrapper::NodeMap<T> {
marci@212	271	public:
marci@266	272	NodeMap(const GraphWrapperSkeleton<GraphWrapper>& _G) :
marci@212	273	GraphWrapper::NodeMap<T>(_G.gw) { }
marci@212	274	NodeMap(const GraphWrapperSkeleton<GraphWrapper>& _G, T a) :
marci@212	275	GraphWrapper::NodeMap<T>(_G.gw, a) { }
marci@212	276	};
marci@212	277
marci@212	278	template<typename T> class EdgeMap : public GraphWrapper::EdgeMap<T> {
marci@212	279	public:
marci@266	280	EdgeMap(const GraphWrapperSkeleton<GraphWrapper>& _G) :
marci@212	281	GraphWrapper::EdgeMap<T>(_G.gw) { }
marci@212	282	EdgeMap(const GraphWrapperSkeleton<GraphWrapper>& _G, T a) :
marci@212	283	GraphWrapper::EdgeMap<T>(_G.gw, a) { }
marci@212	284	};
marci@212	285	};
marci@212	286
marci@230	287	// template<typename Graph>
marci@230	288	// class RevGraphWrapper
marci@230	289	// {
marci@230	290	// protected:
marci@230	291	// Graph* graph;
marci@230	292
marci@230	293	// public:
marci@230	294	// typedef Graph BaseGraph;
marci@230	295
marci@230	296	// typedef typename Graph::Node Node;
marci@230	297	// typedef typename Graph::NodeIt NodeIt;
marci@230	298
marci@230	299	// typedef typename Graph::Edge Edge;
marci@230	300	// typedef typename Graph::OutEdgeIt InEdgeIt;
marci@230	301	// typedef typename Graph::InEdgeIt OutEdgeIt;
marci@230	302	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@230	303	// typedef typename Graph::EdgeIt EdgeIt;
marci@230	304
marci@230	305	// //RevGraphWrapper() : graph(0) { }
marci@230	306	// RevGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@230	307
marci@230	308	// void setGraph(Graph& _graph) { graph = &_graph; }
marci@230	309	// Graph& getGraph() const { return (*graph); }
marci@230	310
marci@230	311	// template<typename I> I& first(I& i) const { return graph->first(i); }
marci@230	312	// template<typename I, typename P> I& first(I& i, const P& p) const {
marci@230	313	// return graph->first(i, p); }
marci@230	314
marci@230	315	// template<typename I> I getNext(const I& i) const {
marci@230	316	// return graph->getNext(i); }
marci@230	317	// template<typename I> I& next(I &i) const { return graph->next(i); }
marci@230	318
marci@230	319	// template< typename It > It first() const {
marci@230	320	// It e; first(e); return e; }
marci@230	321
marci@230	322	// template< typename It > It first(const Node& v) const {
marci@230	323	// It e; first(e, v); return e; }
marci@230	324
marci@230	325	// Node head(const Edge& e) const { return graph->tail(e); }
marci@230	326	// Node tail(const Edge& e) const { return graph->head(e); }
marci@230	327
marci@230	328	// template<typename I> bool valid(const I& i) const
marci@230	329	// { return graph->valid(i); }
marci@230	330
marci@230	331	// //template<typename I> void setInvalid(const I &i);
marci@230	332	// //{ return graph->setInvalid(i); }
marci@230	333
marci@230	334	// template<typename I> Node aNode(const I& e) const {
marci@230	335	// return graph->aNode(e); }
marci@230	336	// template<typename I> Node bNode(const I& e) const {
marci@230	337	// return graph->bNode(e); }
marci@230	338
marci@230	339	// Node addNode() const { return graph->addNode(); }
marci@230	340	// Edge addEdge(const Node& tail, const Node& head) const {
marci@230	341	// return graph->addEdge(tail, head); }
marci@230	342
marci@230	343	// int nodeNum() const { return graph->nodeNum(); }
marci@230	344	// int edgeNum() const { return graph->edgeNum(); }
marci@230	345
marci@230	346	// template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@230	347
marci@230	348	// void clear() const { graph->clear(); }
marci@230	349
marci@230	350	// template<typename T> class NodeMap : public Graph::NodeMap<T> {
marci@230	351	// public:
marci@230	352	// NodeMap(const RevGraphWrapper<Graph>& _G) :
marci@230	353	// Graph::NodeMap<T>(_G.getGraph()) { }
marci@230	354	// NodeMap(const RevGraphWrapper<Graph>& _G, T a) :
marci@230	355	// Graph::NodeMap<T>(_G.getGraph(), a) { }
marci@230	356	// };
marci@230	357
marci@230	358	// template<typename T> class EdgeMap : public Graph::EdgeMap<T> {
marci@230	359	// public:
marci@230	360	// EdgeMap(const RevGraphWrapper<Graph>& _G) :
marci@230	361	// Graph::EdgeMap<T>(_G.getGraph()) { }
marci@230	362	// EdgeMap(const RevGraphWrapper<Graph>& _G, T a) :
marci@230	363	// Graph::EdgeMap<T>(_G.getGraph(), a) { }
marci@230	364	// };
marci@230	365	// };
marci@230	366
marci@235	367	// template<typename /Graph/GraphWrapper
marci@235	368	// /=typename GraphWrapperSkeleton< TrivGraphWrapper<Graph>/ >
marci@235	369	// class RevGraphWrapper :
marci@235	370	// public GraphWrapper/GraphWrapperSkeleton< TrivGraphWrapper<Graph> >/ {
marci@235	371	// protected:
marci@235	372	// //Graph* graph;
marci@230	373
marci@235	374	// public:
marci@235	375	// //typedef Graph BaseGraph;
marci@235	376
marci@235	377	// //typedef typename Graph::Node Node;
marci@235	378	// //typedef typename Graph::NodeIt NodeIt;
marci@235	379
marci@235	380	// //typedef typename Graph::Edge Edge;
marci@235	381	// typedef typename GraphWrapper/typename GraphWrapperSkeleton< TrivGraphWrapper<Graph> >/::OutEdgeIt InEdgeIt;
marci@235	382	// typedef typename GraphWrapper/typename GraphWrapperSkeleton< TrivGraphWrapper<Graph> >/::InEdgeIt OutEdgeIt;
marci@235	383	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@235	384	// //typedef typename Graph::EdgeIt EdgeIt;
marci@235	385
marci@235	386	// //RevGraphWrapper() : graph(0) { }
marci@235	387	// RevGraphWrapper(GraphWrapper _gw/BaseGraph& _graph/) : GraphWrapper/GraphWrapperSkeleton< TrivGraphWrapper<Graph> >/(_gw/TrivGraphWrapper<Graph>(_graph)/) { }
marci@235	388
marci@235	389	// //void setGraph(Graph& _graph) { graph = &_graph; }
marci@235	390	// //Graph& getGraph() const { return (*graph); }
marci@235	391
marci@235	392	// //template<typename I> I& first(I& i) const { return graph->first(i); }
marci@235	393	// //template<typename I, typename P> I& first(I& i, const P& p) const {
marci@235	394	// // return graph->first(i, p); }
marci@235	395
marci@235	396	// //template<typename I> I getNext(const I& i) const {
marci@235	397	// // return graph->getNext(i); }
marci@235	398	// //template<typename I> I& next(I &i) const { return graph->next(i); }
marci@235	399
marci@235	400	// //template< typename It > It first() const {
marci@235	401	// // It e; first(e); return e; }
marci@235	402
marci@235	403	// //template< typename It > It first(const Node& v) const {
marci@235	404	// // It e; first(e, v); return e; }
marci@235	405
marci@235	406	// //Node head(const Edge& e) const { return graph->tail(e); }
marci@235	407	// //Node tail(const Edge& e) const { return graph->head(e); }
marci@235	408
marci@235	409	// //template<typename I> bool valid(const I& i) const
marci@235	410	// // { return graph->valid(i); }
marci@235	411
marci@235	412	// //template<typename I> void setInvalid(const I &i);
marci@235	413	// //{ return graph->setInvalid(i); }
marci@235	414
marci@235	415	// //template<typename I> Node aNode(const I& e) const {
marci@235	416	// // return graph->aNode(e); }
marci@235	417	// //template<typename I> Node bNode(const I& e) const {
marci@235	418	// // return graph->bNode(e); }
marci@235	419
marci@235	420	// //Node addNode() const { return graph->addNode(); }
marci@235	421	// //Edge addEdge(const Node& tail, const Node& head) const {
marci@235	422	// // return graph->addEdge(tail, head); }
marci@235	423
marci@235	424	// //int nodeNum() const { return graph->nodeNum(); }
marci@235	425	// //int edgeNum() const { return graph->edgeNum(); }
marci@235	426
marci@235	427	// //template<typename I> void erase(const I& i) const { graph->erase(i); }
marci@235	428
marci@235	429	// //void clear() const { graph->clear(); }
marci@235	430
marci@235	431	// template<typename T> class NodeMap :
marci@235	432	// public GraphWrapper/Skeleton< TrivGraphWrapper<Graph> >/::NodeMap<T>
marci@235	433	// {
marci@235	434	// public:
marci@235	435	// NodeMap(const RevGraphWrapper<GraphWrapper>& _gw) :
marci@235	436	// GraphWrapper/Skeleton< TrivGraphWrapper<Graph> >/::NodeMap<T>(_gw) { }
marci@235	437	// NodeMap(const RevGraphWrapper<GraphWrapper>& _gw, T a) :
marci@235	438	// GraphWrapper/Skeleton< TrivGraphWrapper<Graph> >/::NodeMap<T>(_gw, a) { }
marci@235	439	// };
marci@235	440
marci@235	441	// template<typename T> class EdgeMap :
marci@235	442	// public GraphWrapper/Skeleton< TrivGraphWrapper<Graph> >/::EdgeMap<T> {
marci@235	443	// public:
marci@235	444	// EdgeMap(const RevGraphWrapper<GraphWrapper>& _gw) :
marci@235	445	// GraphWrapper/Skeleton< TrivGraphWrapper<Graph> >/::EdgeMap<T>(_gw) { }
marci@235	446	// EdgeMap(const RevGraphWrapper<GraphWrapper>& _gw, T a) :
marci@235	447	// GraphWrapper/Skeleton< TrivGraphWrapper<Graph> >/::EdgeMap<T>(_gw, a) { }
marci@235	448	// };
marci@235	449	// };
marci@235	450
marci@235	451	template<typename GraphWrapper>
marci@235	452	class RevGraphWrapper : public GraphWrapperSkeleton<GraphWrapper> {
marci@230	453	public:
marci@237	454	typedef typename GraphWrapperSkeleton<GraphWrapper>::Node Node;
marci@237	455	typedef typename GraphWrapperSkeleton<GraphWrapper>::Edge Edge;
marci@279	456	//FIXME
marci@279	457	//If GraphWrapper::OutEdgeIt is not defined
marci@279	458	//and we do not want to use RevGraphWrapper::InEdgeIt,
marci@279	459	//this won't work, because of typedef
marci@279	460	//OR
marci@279	461	//graphs have to define their non-existing iterators to void
marci@279	462	//Unfortunately all the typedefs are instantiated in templates,
marci@279	463	//unlike other stuff
marci@235	464	typedef typename GraphWrapperSkeleton<GraphWrapper>::OutEdgeIt InEdgeIt;
marci@235	465	typedef typename GraphWrapperSkeleton<GraphWrapper>::InEdgeIt OutEdgeIt;
marci@237	466
marci@238	467	RevGraphWrapper(GraphWrapper _gw) :
marci@238	468	GraphWrapperSkeleton<GraphWrapper>(_gw) { }
marci@238	469
marci@237	470	Node head(const Edge& e) const
marci@237	471	{ return GraphWrapperSkeleton<GraphWrapper>::tail(e); }
marci@237	472	Node tail(const Edge& e) const
marci@237	473	{ return GraphWrapperSkeleton<GraphWrapper>::head(e); }
marci@76	474	};
marci@76	475
marci@263	476	//Subgraph on the same node-set and partial edge-set
marci@263	477	template<typename GraphWrapper, typename EdgeFilterMap>
marci@263	478	class SubGraphWrapper : public GraphWrapperSkeleton<GraphWrapper> {
marci@263	479	protected:
marci@263	480	EdgeFilterMap* filter_map;
marci@263	481	public:
marci@263	482	typedef typename GraphWrapperSkeleton<GraphWrapper>::Node Node;
marci@263	483	typedef typename GraphWrapperSkeleton<GraphWrapper>::NodeIt NodeIt;
marci@263	484	typedef typename GraphWrapperSkeleton<GraphWrapper>::Edge Edge;
marci@263	485	typedef typename GraphWrapperSkeleton<GraphWrapper>::EdgeIt EdgeIt;
marci@263	486	typedef typename GraphWrapperSkeleton<GraphWrapper>::InEdgeIt InEdgeIt;
marci@263	487	typedef typename GraphWrapperSkeleton<GraphWrapper>::OutEdgeIt OutEdgeIt;
marci@263	488
marci@263	489	SubGraphWrapper(GraphWrapper _gw, EdgeFilterMap& _filter_map) :
marci@263	490	GraphWrapperSkeleton<GraphWrapper>(_gw), filter_map(&_filter_map) { }
marci@263	491
marci@263	492	template<typename I> I& first(I& i) const {
marci@263	493	gw.first(i);
marci@263	494	while (gw.valid(i) && !filter_map->get(i)) { gw.next(i); }
marci@263	495	return i;
marci@263	496	}
marci@263	497	template<typename I, typename P> I& first(I& i, const P& p) const {
marci@263	498	gw.first(i, p);
marci@263	499	while (gw.valid(i) && !filter_map->get(i)) { gw.next(i); }
marci@263	500	return i;
marci@263	501	}
marci@263	502
marci@263	503	//template<typename I> I getNext(const I& i) const {
marci@263	504	// return gw.getNext(i);
marci@263	505	//}
marci@263	506	template<typename I> I& next(I &i) const {
marci@263	507	gw.next(i);
marci@263	508	while (gw.valid(i) && !filter_map->get(i)) { gw.next(i); }
marci@263	509	return i;
marci@263	510	}
marci@263	511
marci@263	512	template< typename It > It first() const {
marci@263	513	It e; this->first(e); return e; }
marci@263	514
marci@263	515	template< typename It > It first(const Node& v) const {
marci@263	516	It e; this->first(e, v); return e; }
marci@263	517	};
marci@155	518
marci@238	519	// template<typename GraphWrapper>
marci@236	520	// class UndirGraphWrapper {
marci@236	521	// protected:
marci@238	522	// //Graph* graph;
marci@238	523	// GraphWrapper gw;
marci@238	524
marci@236	525	// public:
marci@238	526	// typedef GraphWrapper BaseGraph;
marci@236	527
marci@238	528	// typedef typename GraphWrapper::Node Node;
marci@238	529	// typedef typename GraphWrapper::NodeIt NodeIt;
marci@236	530
marci@236	531	// //typedef typename Graph::Edge Edge;
marci@236	532	// //typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@236	533	// //typedef typename Graph::InEdgeIt InEdgeIt;
marci@236	534	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@236	535	// //typedef typename Graph::EdgeIt EdgeIt;
marci@236	536
marci@236	537	// //private:
marci@238	538	// typedef typename GraphWrapper::Edge GraphEdge;
marci@238	539	// typedef typename GraphWrapper::OutEdgeIt GraphOutEdgeIt;
marci@238	540	// typedef typename GraphWrapper::InEdgeIt GraphInEdgeIt;
marci@236	541	// //public:
marci@236	542
marci@236	543	// //UndirGraphWrapper() : graph(0) { }
marci@238	544	// UndirGraphWrapper(GraphWrapper _gw) : gw(_gw) { }
marci@236	545
marci@238	546	// //void setGraph(Graph& _graph) { graph = &_graph; }
marci@238	547	// //Graph& getGraph() const { return (*graph); }
marci@236	548
marci@236	549	// class Edge {
marci@238	550	// friend class UndirGraphWrapper<GraphWrapper>;
marci@236	551	// bool out_or_in; //true iff out
marci@236	552	// GraphOutEdgeIt out;
marci@236	553	// GraphInEdgeIt in;
marci@236	554	// public:
marci@236	555	// Edge() : out_or_in(), out(), in() { }
marci@236	556	// Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
marci@236	557	// operator GraphEdge() const {
marci@236	558	// if (out_or_in) return(out); else return(in);
marci@236	559	// }
marci@236	560	// friend bool operator==(const Edge& u, const Edge& v) {
marci@236	561	// if (v.out_or_in)
marci@236	562	// return (u.out_or_in && u.out==v.out);
marci@236	563	// else
marci@236	564	// return (!u.out_or_in && u.in==v.in);
marci@236	565	// }
marci@236	566	// friend bool operator!=(const Edge& u, const Edge& v) {
marci@236	567	// if (v.out_or_in)
marci@236	568	// return (!u.out_or_in \|\| u.out!=v.out);
marci@236	569	// else
marci@236	570	// return (u.out_or_in \|\| u.in!=v.in);
marci@236	571	// }
marci@236	572	// };
marci@236	573
marci@236	574	// class OutEdgeIt : public Edge {
marci@238	575	// friend class UndirGraphWrapper<GraphWrapper>;
marci@236	576	// public:
marci@236	577	// OutEdgeIt() : Edge() { }
marci@236	578	// OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@238	579	// OutEdgeIt(const UndirGraphWrapper<GraphWrapper>& _G, const Node& n)
marci@238	580	// : Edge() {
marci@236	581	// out_or_in=true;
marci@238	582	// _G.gw.first(out, n);
marci@238	583	// if (!(_G.gw.valid(out))) {
marci@236	584	// out_or_in=false;
marci@238	585	// _G.gw.first(in, n);
marci@236	586	// }
marci@236	587	// }
marci@236	588	// };
marci@236	589
marci@236	590	// OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@236	591	// e.out_or_in=true;
marci@238	592	// gw.first(e.out, n);
marci@238	593	// if (!(gw.valid(e.out))) {
marci@236	594	// e.out_or_in=false;
marci@238	595	// gw.first(e.in, n);
marci@236	596	// }
marci@236	597	// return e;
marci@236	598	// }
marci@236	599
marci@236	600	// OutEdgeIt& next(OutEdgeIt& e) const {
marci@236	601	// if (e.out_or_in) {
marci@238	602	// Node n=gw.tail(e.out);
marci@238	603	// gw.next(e.out);
marci@238	604	// if (!gw.valid(e.out)) {
marci@236	605	// e.out_or_in=false;
marci@238	606	// gw.first(e.in, n);
marci@236	607	// }
marci@236	608	// } else {
marci@238	609	// gw.next(e.in);
marci@236	610	// }
marci@236	611	// return e;
marci@236	612	// }
marci@236	613
marci@236	614	// Node aNode(const OutEdgeIt& e) const {
marci@238	615	// if (e.out_or_in) return gw.tail(e); else return gw.head(e); }
marci@236	616	// Node bNode(const OutEdgeIt& e) const {
marci@238	617	// if (e.out_or_in) return gw.head(e); else return gw.tail(e); }
marci@236	618
marci@236	619	// typedef OutEdgeIt InEdgeIt;
marci@236	620
marci@238	621	// template<typename I> I& first(I& i) const { return gw.first(i); }
marci@236	622	// // template<typename I, typename P> I& first(I& i, const P& p) const {
marci@236	623	// // return graph->first(i, p); }
marci@236	624
marci@236	625	// template<typename I> I getNext(const I& i) const {
marci@238	626	// return gw.getNext(i); }
marci@238	627	// template<typename I> I& next(I &i) const { return gw.next(i); }
marci@236	628
marci@236	629	// template< typename It > It first() const {
marci@236	630	// It e; first(e); return e; }
marci@236	631
marci@236	632	// template< typename It > It first(const Node& v) const {
marci@236	633	// It e; first(e, v); return e; }
marci@236	634
marci@238	635	// Node head(const Edge& e) const { return gw.head(e); }
marci@238	636	// Node tail(const Edge& e) const { return gw.tail(e); }
marci@236	637
marci@236	638	// template<typename I> bool valid(const I& i) const
marci@238	639	// { return gw.valid(i); }
marci@236	640
marci@236	641	// //template<typename I> void setInvalid(const I &i);
marci@236	642	// //{ return graph->setInvalid(i); }
marci@236	643
marci@238	644	// int nodeNum() const { return gw.nodeNum(); }
marci@238	645	// int edgeNum() const { return gw.edgeNum(); }
marci@236	646
marci@236	647	// // template<typename I> Node aNode(const I& e) const {
marci@236	648	// // return graph->aNode(e); }
marci@236	649	// // template<typename I> Node bNode(const I& e) const {
marci@236	650	// // return graph->bNode(e); }
marci@236	651
marci@238	652	// Node addNode() const { return gw.addNode(); }
marci@236	653	// // FIXME: ez igy nem jo, mert nem
marci@236	654	// // Edge addEdge(const Node& tail, const Node& head) const {
marci@236	655	// // return graph->addEdge(tail, head); }
marci@236	656
marci@238	657	// template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@236	658
marci@238	659	// void clear() const { gw.clear(); }
marci@236	660
marci@238	661	// template<typename T> class NodeMap : public GraphWrapper::NodeMap<T> {
marci@236	662	// public:
marci@238	663	// NodeMap(const UndirGraphWrapper<GraphWrapper>& _G) :
marci@238	664	// GraphWrapper::NodeMap<T>(_G.gw) { }
marci@238	665	// NodeMap(const UndirGraphWrapper<GraphWrapper>& _G, T a) :
marci@238	666	// GraphWrapper::NodeMap<T>(_G.gw, a) { }
marci@236	667	// };
marci@236	668
marci@238	669	// template<typename T> class EdgeMap : public GraphWrapper::EdgeMap<T> {
marci@236	670	// public:
marci@238	671	// EdgeMap(const UndirGraphWrapper<GraphWrapper>& _G) :
marci@238	672	// GraphWrapper::EdgeMap<T>(_G.gw) { }
marci@238	673	// EdgeMap(const UndirGraphWrapper<GraphWrapper>& _G, T a) :
marci@238	674	// GraphWrapper::EdgeMap<T>(_G.gw, a) { }
marci@236	675	// };
marci@236	676	// };
marci@236	677
marci@236	678
marci@236	679	template<typename GraphWrapper>
marci@238	680	class UndirGraphWrapper : public GraphWrapperSkeleton<GraphWrapper> {
marci@199	681	protected:
marci@238	682	// GraphWrapper gw;
marci@236	683
marci@158	684	public:
marci@238	685	//typedef GraphWrapper BaseGraph;
marci@158	686
marci@238	687	typedef typename GraphWrapperSkeleton<GraphWrapper>::Node Node;
marci@238	688	typedef typename GraphWrapperSkeleton<GraphWrapper>::NodeIt NodeIt;
marci@158	689
marci@158	690	//private:
marci@275	691	//FIXME ezeknek valojaban a GraphWrapper megfelelo dolgai kellene hogy
marci@275	692	//legyenek, at kell irni
marci@275	693	typedef typename /GraphWrapperSkeleton<GraphWrapper>/
marci@275	694	GraphWrapper::Edge GraphEdge;
marci@275	695	typedef typename /GraphWrapperSkeleton<GraphWrapper>/
marci@275	696	GraphWrapper::OutEdgeIt GraphOutEdgeIt;
marci@275	697	typedef typename /GraphWrapperSkeleton<GraphWrapper>/
marci@275	698	GraphWrapper::InEdgeIt GraphInEdgeIt;
marci@158	699	//public:
marci@158	700
marci@168	701	//UndirGraphWrapper() : graph(0) { }
marci@238	702	UndirGraphWrapper(GraphWrapper _gw) :
marci@238	703	GraphWrapperSkeleton<GraphWrapper>(_gw) { }
marci@238	704
marci@238	705	//UndirGraphWrapper(GraphWrapper _gw) : gw(_gw) { }
marci@168	706
marci@236	707	//void setGraph(Graph& _graph) { graph = &_graph; }
marci@236	708	//Graph& getGraph() const { return (*graph); }
marci@168	709
marci@174	710	class Edge {
marci@236	711	friend class UndirGraphWrapper<GraphWrapper>;
marci@279	712	protected:
marci@158	713	bool out_or_in; //true iff out
marci@158	714	GraphOutEdgeIt out;
marci@158	715	GraphInEdgeIt in;
marci@158	716	public:
marci@174	717	Edge() : out_or_in(), out(), in() { }
marci@174	718	Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
marci@174	719	operator GraphEdge() const {
marci@158	720	if (out_or_in) return(out); else return(in);
marci@158	721	}
marci@239	722	//FIXME
marci@239	723	//2 edges are equal if they "refer" to the same physical edge
marci@239	724	//is it good?
marci@174	725	friend bool operator==(const Edge& u, const Edge& v) {
marci@174	726	if (v.out_or_in)
marci@239	727	if (u.out_or_in) return (u.out==v.out); else return (u.out==v.in);
marci@239	728	//return (u.out_or_in && u.out==v.out);
marci@174	729	else
marci@239	730	if (u.out_or_in) return (u.out==v.in); else return (u.in==v.in);
marci@239	731	//return (!u.out_or_in && u.in==v.in);
marci@174	732	}
marci@174	733	friend bool operator!=(const Edge& u, const Edge& v) {
marci@174	734	if (v.out_or_in)
marci@239	735	if (u.out_or_in) return (u.out!=v.out); else return (u.out!=v.in);
marci@239	736	//return (!u.out_or_in \|\| u.out!=v.out);
marci@174	737	else
marci@239	738	if (u.out_or_in) return (u.out!=v.in); else return (u.in!=v.in);
marci@239	739	//return (u.out_or_in \|\| u.in!=v.in);
marci@174	740	}
marci@158	741	};
marci@158	742
marci@174	743	class OutEdgeIt : public Edge {
marci@236	744	friend class UndirGraphWrapper<GraphWrapper>;
marci@158	745	public:
marci@174	746	OutEdgeIt() : Edge() { }
marci@174	747	OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@236	748	OutEdgeIt(const UndirGraphWrapper<GraphWrapper>& _G, const Node& n)
marci@236	749	: Edge() {
marci@239	750	out_or_in=true; _G.gw.first(out, n);
marci@239	751	if (!(_G.gw.valid(out))) { out_or_in=false; _G.gw.first(in, n); }
marci@158	752	}
marci@158	753	};
marci@158	754
marci@238	755	typedef OutEdgeIt InEdgeIt;
marci@238	756
marci@238	757	class EdgeIt : public Edge {
marci@238	758	friend class UndirGraphWrapper<GraphWrapper>;
marci@238	759	protected:
marci@238	760	NodeIt v;
marci@238	761	public:
marci@238	762	EdgeIt() : Edge() { }
marci@238	763	EdgeIt(const Invalid& i) : Edge(i) { }
marci@238	764	EdgeIt(const UndirGraphWrapper<GraphWrapper>& _G)
marci@238	765	: Edge() {
marci@238	766	out_or_in=true;
marci@238	767	//Node v;
marci@238	768	_G.first(v);
marci@238	769	if (_G.valid(v)) _G.gw.first(out); else out=INVALID;
marci@238	770	while (_G.valid(v) && !_G.gw.valid(out)) {
marci@238	771	_G.gw.next(v);
marci@238	772	if (_G.valid(v)) _G.gw.first(out);
marci@238	773	}
marci@238	774	}
marci@238	775	};
marci@238	776
marci@212	777	OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@239	778	e.out_or_in=true; gw.first(e.out, n);
marci@239	779	if (!(gw.valid(e.out))) { e.out_or_in=false; gw.first(e.in, n); }
marci@158	780	return e;
marci@158	781	}
marci@158	782
marci@238	783	EdgeIt& first(EdgeIt& e) const {
marci@238	784	e.out_or_in=true;
marci@238	785	//NodeIt v;
marci@238	786	first(e.v);
marci@238	787	if (valid(e.v)) gw.first(e.out, e.v); else e.out=INVALID;
marci@238	788	while (valid(e.v) && !gw.valid(e.out)) {
marci@238	789	gw.next(e.v);
marci@238	790	if (valid(e.v)) gw.first(e.out, e.v);
marci@238	791	}
marci@238	792	return e;
marci@238	793	}
marci@238	794
marci@265	795	template<typename I> I& first(I& i) const { gw.first(i); return i; }
marci@238	796	template<typename I, typename P> I& first(I& i, const P& p) const {
marci@266	797	gw.first(i, p); return i; }
marci@238	798
marci@158	799	OutEdgeIt& next(OutEdgeIt& e) const {
marci@158	800	if (e.out_or_in) {
marci@236	801	Node n=gw.tail(e.out);
marci@236	802	gw.next(e.out);
marci@239	803	if (!gw.valid(e.out)) { e.out_or_in=false; gw.first(e.in, n); }
marci@158	804	} else {
marci@236	805	gw.next(e.in);
marci@158	806	}
marci@158	807	return e;
marci@158	808	}
marci@158	809
marci@238	810	EdgeIt& next(EdgeIt& e) const {
marci@238	811	//NodeIt v=tail(e);
marci@238	812	gw.next(e.out);
marci@238	813	while (valid(e.v) && !gw.valid(e.out)) {
marci@238	814	next(e.v);
marci@238	815	if (valid(e.v)) gw.first(e.out, e.v);
marci@238	816	}
marci@238	817	return e;
marci@238	818	}
marci@158	819
marci@238	820	template<typename I> I& next(I &i) const { return gw.next(i); }
marci@265	821	// template<typename I> I getNext(const I& i) const { return gw.getNext(i); }
marci@158	822
marci@158	823	template< typename It > It first() const {
marci@212	824	It e; first(e); return e; }
marci@158	825
marci@174	826	template< typename It > It first(const Node& v) const {
marci@212	827	It e; first(e, v); return e; }
marci@158	828
marci@238	829	// Node head(const Edge& e) const { return gw.head(e); }
marci@238	830	// Node tail(const Edge& e) const { return gw.tail(e); }
marci@158	831
marci@238	832	// template<typename I> bool valid(const I& i) const
marci@238	833	// { return gw.valid(i); }
marci@158	834
marci@238	835	// int nodeNum() const { return gw.nodeNum(); }
marci@238	836	// int edgeNum() const { return gw.edgeNum(); }
marci@158	837
marci@174	838	// template<typename I> Node aNode(const I& e) const {
marci@158	839	// return graph->aNode(e); }
marci@174	840	// template<typename I> Node bNode(const I& e) const {
marci@158	841	// return graph->bNode(e); }
marci@238	842
marci@238	843	Node aNode(const OutEdgeIt& e) const {
marci@238	844	if (e.out_or_in) return gw.tail(e); else return gw.head(e); }
marci@238	845	Node bNode(const OutEdgeIt& e) const {
marci@238	846	if (e.out_or_in) return gw.head(e); else return gw.tail(e); }
marci@158	847
marci@238	848	// Node addNode() const { return gw.addNode(); }
marci@238	849
marci@231	850	// FIXME: ez igy nem jo, mert nem
marci@231	851	// Edge addEdge(const Node& tail, const Node& head) const {
marci@231	852	// return graph->addEdge(tail, head); }
marci@158	853
marci@238	854	// template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@158	855
marci@238	856	// void clear() const { gw.clear(); }
marci@158	857
marci@238	858	// template<typename T> class NodeMap : public GraphWrapper::NodeMap<T> {
marci@238	859	// public:
marci@238	860	// NodeMap(const UndirGraphWrapper<GraphWrapper>& _G) :
marci@238	861	// GraphWrapper::NodeMap<T>(_G.gw) { }
marci@238	862	// NodeMap(const UndirGraphWrapper<GraphWrapper>& _G, T a) :
marci@238	863	// GraphWrapper::NodeMap<T>(_G.gw, a) { }
marci@238	864	// };
marci@168	865
marci@238	866	// template<typename T> class EdgeMap :
marci@238	867	// public GraphWrapperSkeleton<GraphWrapper>::EdgeMap<T> {
marci@238	868	// public:
marci@238	869	// EdgeMap(const UndirGraphWrapper<GraphWrapper>& _G) :
marci@238	870	// GraphWrapperSkeleton<GraphWrapper>::EdgeMap<T>(_G.gw) { }
marci@238	871	// EdgeMap(const UndirGraphWrapper<GraphWrapper>& _G, T a) :
marci@238	872	// GraphWrapper::EdgeMap<T>(_G.gw, a) { }
marci@238	873	// };
marci@238	874	};
marci@158	875
marci@158	876
marci@158	877
marci@236	878
marci@236	879
marci@155	880	// template<typename Graph>
marci@155	881	// class SymGraphWrapper
marci@155	882	// {
marci@155	883	// Graph* graph;
marci@76	884
marci@155	885	// public:
marci@155	886	// typedef Graph BaseGraph;
marci@155	887
marci@174	888	// typedef typename Graph::Node Node;
marci@174	889	// typedef typename Graph::Edge Edge;
marci@174	890
marci@155	891	// typedef typename Graph::NodeIt NodeIt;
marci@155	892
marci@155	893	// //FIXME tag-ekkel megcsinalni, hogy abbol csinaljon
marci@155	894	// //iranyitatlant, ami van
marci@155	895	// //mert csak 1 dolgot lehet be typedef-elni
marci@155	896	// typedef typename Graph::OutEdgeIt SymEdgeIt;
marci@155	897	// //typedef typename Graph::InEdgeIt SymEdgeIt;
marci@155	898	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174	899	// typedef typename Graph::EdgeIt EdgeIt;
marci@155	900
marci@155	901	// int nodeNum() const { return graph->nodeNum(); }
marci@155	902	// int edgeNum() const { return graph->edgeNum(); }
marci@155	903
marci@212	904	// template<typename I> I& first(I& i) const { return graph->first(i); }
marci@212	905	// template<typename I, typename P> I& first(I& i, const P& p) const {
marci@212	906	// return graph->first(i, p); }
marci@155	907	// //template<typename I> I next(const I i); { return graph->goNext(i); }
marci@155	908	// //template<typename I> I &goNext(I &i); { return graph->goNext(i); }
marci@155	909
marci@155	910	// template< typename It > It first() const {
marci@212	911	// It e; first(e); return e; }
marci@155	912
marci@174	913	// template< typename It > It first(Node v) const {
marci@212	914	// It e; first(e, v); return e; }
marci@155	915
marci@174	916	// Node head(const Edge& e) const { return graph->head(e); }
marci@174	917	// Node tail(const Edge& e) const { return graph->tail(e); }
marci@155	918
marci@174	919	// template<typename I> Node aNode(const I& e) const {
marci@155	920	// return graph->aNode(e); }
marci@174	921	// template<typename I> Node bNode(const I& e) const {
marci@155	922	// return graph->bNode(e); }
marci@155	923
marci@155	924	// //template<typename I> bool valid(const I i);
marci@155	925	// //{ return graph->valid(i); }
marci@155	926
marci@155	927	// //template<typename I> void setInvalid(const I &i);
marci@155	928	// //{ return graph->setInvalid(i); }
marci@155	929
marci@174	930	// Node addNode() { return graph->addNode(); }
marci@174	931	// Edge addEdge(const Node& tail, const Node& head) {
marci@155	932	// return graph->addEdge(tail, head); }
marci@155	933
marci@155	934	// template<typename I> void erase(const I& i) { graph->erase(i); }
marci@155	935
marci@155	936	// void clear() { graph->clear(); }
marci@155	937
marci@155	938	// template<typename T> class NodeMap : public Graph::NodeMap<T> { };
marci@155	939	// template<typename T> class EdgeMap : public Graph::EdgeMap<T> { };
marci@155	940
marci@155	941	// void setGraph(Graph& _graph) { graph = &_graph; }
marci@155	942	// Graph& getGraph() { return (*graph); }
marci@155	943
marci@155	944	// //SymGraphWrapper() : graph(0) { }
marci@155	945	// SymGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@155	946	// };
marci@155	947
marci@155	948
marci@266	949	template<typename GraphWrapper, typename Number, typename FlowMap, typename CapacityMap>
marci@266	950	class ResGraphWrapper : public GraphWrapperSkeleton<GraphWrapper>{
marci@76	951	public:
marci@259	952	//typedef Graph BaseGraph;
marci@266	953	//typedef TrivGraphWrapper<const Graph> GraphWrapper;
marci@266	954	typedef typename GraphWrapperSkeleton<GraphWrapper>::Node Node;
marci@266	955	typedef typename GraphWrapperSkeleton<GraphWrapper>::NodeIt NodeIt;
marci@155	956	private:
marci@275	957	typedef typename /GraphWrapperSkeleton<GraphWrapper>/
marci@275	958	GraphWrapper::OutEdgeIt OldOutEdgeIt;
marci@275	959	typedef typename /GraphWrapperSkeleton<GraphWrapper>/
marci@275	960	GraphWrapper::InEdgeIt OldInEdgeIt;
marci@199	961	protected:
marci@259	962	//const Graph* graph;
marci@266	963	//GraphWrapper gw;
marci@155	964	FlowMap* flow;
marci@155	965	const CapacityMap* capacity;
marci@155	966	public:
marci@168	967
marci@266	968	ResGraphWrapper(const GraphWrapper& _gw, FlowMap& _flow,
marci@266	969	const CapacityMap& _capacity) :
marci@266	970	GraphWrapperSkeleton<GraphWrapper>(_gw),
marci@266	971	flow(&_flow), capacity(&_capacity) { }
marci@168	972
marci@259	973	//void setGraph(const Graph& _graph) { graph = &_graph; }
marci@259	974	//const Graph& getGraph() const { return (*graph); }
marci@168	975
marci@174	976	class Edge;
marci@155	977	class OutEdgeIt;
marci@174	978	friend class Edge;
marci@155	979	friend class OutEdgeIt;
marci@76	980
marci@174	981	class Edge {
marci@266	982	friend class ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>;
marci@155	983	protected:
marci@168	984	bool out_or_in; //true, iff out
marci@155	985	OldOutEdgeIt out;
marci@155	986	OldInEdgeIt in;
marci@155	987	public:
marci@174	988	Edge() : out_or_in(true) { }
marci@174	989	Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
marci@168	990	// bool valid() const {
marci@168	991	// return out_or_in && out.valid() \|\| in.valid(); }
marci@174	992	friend bool operator==(const Edge& u, const Edge& v) {
marci@174	993	if (v.out_or_in)
marci@174	994	return (u.out_or_in && u.out==v.out);
marci@174	995	else
marci@174	996	return (!u.out_or_in && u.in==v.in);
marci@174	997	}
marci@174	998	friend bool operator!=(const Edge& u, const Edge& v) {
marci@174	999	if (v.out_or_in)
marci@174	1000	return (!u.out_or_in \|\| u.out!=v.out);
marci@174	1001	else
marci@174	1002	return (u.out_or_in \|\| u.in!=v.in);
marci@174	1003	}
marci@155	1004	};
marci@155	1005
marci@155	1006
marci@174	1007	class OutEdgeIt : public Edge {
marci@266	1008	friend class ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>;
marci@155	1009	public:
marci@155	1010	OutEdgeIt() { }
marci@168	1011	//FIXME
marci@174	1012	OutEdgeIt(const Edge& e) : Edge(e) { }
marci@174	1013	OutEdgeIt(const Invalid& i) : Edge(i) { }
marci@265	1014	protected:
marci@266	1015	OutEdgeIt(const ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>& resG, Node v) : Edge() {
marci@259	1016	resG.gw.first(out, v);
marci@269	1017	while( resG.gw.valid(out) && !(resG.resCap(out)>0) ) { resG.gw.next(out); }
marci@259	1018	if (!resG.gw.valid(out)) {
marci@155	1019	out_or_in=0;
marci@259	1020	resG.gw.first(in, v);
marci@269	1021	while( resG.gw.valid(in) && !(resG.resCap(in)>0) ) { resG.gw.next(in); }
marci@155	1022	}
marci@155	1023	}
marci@168	1024	// public:
marci@168	1025	// OutEdgeIt& operator++() {
marci@168	1026	// if (out_or_in) {
marci@174	1027	// Node v=/resG->/G->aNode(out);
marci@168	1028	// ++out;
marci@269	1029	// while( out.valid() && !(Edge::resCap()>0) ) { ++out; }
marci@168	1030	// if (!out.valid()) {
marci@168	1031	// out_or_in=0;
marci@212	1032	// G->first(in, v);
marci@269	1033	// while( in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168	1034	// }
marci@168	1035	// } else {
marci@168	1036	// ++in;
marci@269	1037	// while( in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168	1038	// }
marci@168	1039	// return *this;
marci@168	1040	// }
marci@155	1041	};
marci@155	1042
marci@263	1043	//FIXME This is just for having InEdgeIt
marci@263	1044	typedef void InEdgeIt;
marci@263	1045
marci@174	1046	class EdgeIt : public Edge {
marci@266	1047	friend class ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>;
marci@265	1048	NodeIt v;
marci@155	1049	public:
marci@174	1050	EdgeIt() { }
marci@174	1051	//EdgeIt(const EdgeIt& e) : Edge(e), v(e.v) { }
marci@174	1052	EdgeIt(const Invalid& i) : Edge(i) { }
marci@266	1053	EdgeIt(const ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>& resG) : Edge() {
marci@259	1054	resG.gw.first(v);
marci@269	1055	if (resG.gw.valid(v)) resG.gw.first(out, v); else out=INVALID;
marci@269	1056	while (resG.gw.valid(out) && !(resG.resCap(out)>0) ) { resG.gw.next(out); }
marci@259	1057	while (resG.gw.valid(v) && !resG.gw.valid(out)) {
marci@259	1058	resG.gw.next(v);
marci@259	1059	if (resG.gw.valid(v)) resG.gw.first(out, v);
marci@269	1060	while (resG.gw.valid(out) && !(resG.resCap(out)>0) ) { resG.gw.next(out); }
marci@155	1061	}
marci@259	1062	if (!resG.gw.valid(out)) {
marci@155	1063	out_or_in=0;
marci@259	1064	resG.gw.first(v);
marci@269	1065	if (resG.gw.valid(v)) resG.gw.first(in, v); else in=INVALID;
marci@269	1066	while (resG.gw.valid(in) && !(resG.resCap(in)>0) ) { resG.gw.next(in); }
marci@259	1067	while (resG.gw.valid(v) && !resG.gw.valid(in)) {
marci@259	1068	resG.gw.next(v);
marci@259	1069	if (resG.gw.valid(v)) resG.gw.first(in, v);
marci@269	1070	while (resG.gw.valid(in) && !(resG.resCap(in)>0) ) { resG.gw.next(in); }
marci@155	1071	}
marci@155	1072	}
marci@155	1073	}
marci@174	1074	// EdgeIt& operator++() {
marci@168	1075	// if (out_or_in) {
marci@168	1076	// ++out;
marci@269	1077	// while (out.valid() && !(Edge::resCap()>0) ) { ++out; }
marci@168	1078	// while (v.valid() && !out.valid()) {
marci@168	1079	// ++v;
marci@212	1080	// if (v.valid()) G->first(out, v);
marci@269	1081	// while (out.valid() && !(Edge::resCap()>0) ) { ++out; }
marci@168	1082	// }
marci@168	1083	// if (!out.valid()) {
marci@168	1084	// out_or_in=0;
marci@212	1085	// G->first(v);
marci@212	1086	// if (v.valid()) G->first(in, v); else in=OldInEdgeIt();
marci@269	1087	// while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168	1088	// while (v.valid() && !in.valid()) {
marci@168	1089	// ++v;
marci@212	1090	// if (v.valid()) G->first(in, v);
marci@269	1091	// while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168	1092	// }
marci@168	1093	// }
marci@168	1094	// } else {
marci@168	1095	// ++in;
marci@269	1096	// while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168	1097	// while (v.valid() && !in.valid()) {
marci@168	1098	// ++v;
marci@212	1099	// if (v.valid()) G->first(in, v);
marci@269	1100	// while (in.valid() && !(Edge::resCap()>0) ) { ++in; }
marci@168	1101	// }
marci@168	1102	// }
marci@168	1103	// return *this;
marci@168	1104	// }
marci@155	1105	};
marci@155	1106
marci@266	1107	NodeIt& first(NodeIt& v) const { gw.first(v); return v; }
marci@212	1108	OutEdgeIt& first(OutEdgeIt& e, Node v) const {
marci@168	1109	e=OutEdgeIt(*this, v);
marci@174	1110	return e;
marci@155	1111	}
marci@212	1112	EdgeIt& first(EdgeIt& e) const {
marci@174	1113	e=EdgeIt(*this);
marci@174	1114	return e;
marci@155	1115	}
marci@155	1116
marci@259	1117	NodeIt& next(NodeIt& n) const { return gw.next(n); }
marci@155	1118
marci@155	1119	OutEdgeIt& next(OutEdgeIt& e) const {
marci@155	1120	if (e.out_or_in) {
marci@259	1121	Node v=gw.aNode(e.out);
marci@259	1122	gw.next(e.out);
marci@269	1123	while( gw.valid(e.out) && !(resCap(e.out)>0) ) { gw.next(e.out); }
marci@259	1124	if (!gw.valid(e.out)) {
marci@155	1125	e.out_or_in=0;
marci@259	1126	gw.first(e.in, v);
marci@269	1127	while( gw.valid(e.in) && !(resCap(e.in)>0) ) { gw.next(e.in); }
marci@155	1128	}
marci@155	1129	} else {
marci@259	1130	gw.next(e.in);
marci@269	1131	while( gw.valid(e.in) && !(resCap(e.in)>0) ) { gw.next(e.in); }
marci@155	1132	}
marci@155	1133	return e;
marci@155	1134	}
marci@155	1135
marci@174	1136	EdgeIt& next(EdgeIt& e) const {
marci@155	1137	if (e.out_or_in) {
marci@259	1138	gw.next(e.out);
marci@269	1139	while (gw.valid(e.out) && !(resCap(e.out)>0) ) { gw.next(e.out); }
marci@259	1140	while (gw.valid(e.v) && !gw.valid(e.out)) {
marci@259	1141	gw.next(e.v);
marci@259	1142	if (gw.valid(e.v)) gw.first(e.out, e.v);
marci@269	1143	while (gw.valid(e.out) && !(resCap(e.out)>0) ) { gw.next(e.out); }
marci@155	1144	}
marci@259	1145	if (!gw.valid(e.out)) {
marci@155	1146	e.out_or_in=0;
marci@259	1147	gw.first(e.v);
marci@269	1148	if (gw.valid(e.v)) gw.first(e.in, e.v); else e.in=INVALID;
marci@269	1149	while (gw.valid(e.in) && !(resCap(e.in)>0) ) { gw.next(e.in); }
marci@259	1150	while (gw.valid(e.v) && !gw.valid(e.in)) {
marci@259	1151	gw.next(e.v);
marci@259	1152	if (gw.valid(e.v)) gw.first(e.in, e.v);
marci@269	1153	while (gw.valid(e.in) && !(resCap(e.in)>0) ) { gw.next(e.in); }
marci@155	1154	}
marci@155	1155	}
marci@155	1156	} else {
marci@259	1157	gw.next(e.in);
marci@269	1158	while (gw.valid(e.in) && !(resCap(e.in)>0) ) { gw.next(e.in); }
marci@259	1159	while (gw.valid(e.v) && !gw.valid(e.in)) {
marci@259	1160	gw.next(e.v);
marci@259	1161	if (gw.valid(e.v)) gw.first(e.in, e.v);
marci@269	1162	while (gw.valid(e.in) && !(resCap(e.in)>0) ) { gw.next(e.in); }
marci@155	1163	}
marci@155	1164	}
marci@155	1165	return e;
marci@155	1166	}
marci@76	1167
marci@76	1168
marci@155	1169	template< typename It >
marci@155	1170	It first() const {
marci@155	1171	It e;
marci@212	1172	first(e);
marci@155	1173	return e;
marci@155	1174	}
marci@76	1175
marci@155	1176	template< typename It >
marci@174	1177	It first(Node v) const {
marci@155	1178	It e;
marci@212	1179	first(e, v);
marci@155	1180	return e;
marci@155	1181	}
marci@76	1182
marci@174	1183	Node tail(Edge e) const {
marci@259	1184	return ((e.out_or_in) ? gw.aNode(e.out) : gw.aNode(e.in)); }
marci@174	1185	Node head(Edge e) const {
marci@259	1186	return ((e.out_or_in) ? gw.bNode(e.out) : gw.bNode(e.in)); }
marci@76	1187
marci@174	1188	Node aNode(OutEdgeIt e) const {
marci@259	1189	return ((e.out_or_in) ? gw.aNode(e.out) : gw.aNode(e.in)); }
marci@174	1190	Node bNode(OutEdgeIt e) const {
marci@259	1191	return ((e.out_or_in) ? gw.bNode(e.out) : gw.bNode(e.in)); }
marci@76	1192
marci@263	1193	int nodeNum() const { return gw.nodeNum(); }
marci@263	1194	//FIXME
marci@263	1195	//int edgeNum() const { return gw.edgeNum(); }
marci@263	1196
marci@263	1197
marci@259	1198	int id(Node v) const { return gw.id(v); }
marci@155	1199
marci@259	1200	bool valid(Node n) const { return gw.valid(n); }
marci@174	1201	bool valid(Edge e) const {
marci@259	1202	return e.out_or_in ? gw.valid(e.out) : gw.valid(e.in); }
marci@155	1203
marci@174	1204	void augment(const Edge& e, Number a) const {
marci@168	1205	if (e.out_or_in)
marci@168	1206	flow->set(e.out, flow->get(e.out)+a);
marci@168	1207	else
marci@168	1208	flow->set(e.in, flow->get(e.in)-a);
marci@168	1209	}
marci@168	1210
marci@269	1211	Number resCap(const Edge& e) const {
marci@168	1212	if (e.out_or_in)
marci@168	1213	return (capacity->get(e.out)-flow->get(e.out));
marci@168	1214	else
marci@168	1215	return (flow->get(e.in));
marci@168	1216	}
marci@168	1217
marci@269	1218	Number resCap(OldOutEdgeIt out) const {
marci@168	1219	return (capacity->get(out)-flow->get(out));
marci@168	1220	}
marci@168	1221
marci@269	1222	Number resCap(OldInEdgeIt in) const {
marci@168	1223	return (flow->get(in));
marci@168	1224	}
marci@168	1225
marci@266	1226	// template<typename T> class NodeMap : public GraphWrapper::NodeMap<T> {
marci@266	1227	// public:
marci@266	1228	// NodeMap(const ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>& _G)
marci@266	1229	// : GraphWrapper::NodeMap<T>(_G.gw) { }
marci@266	1230	// NodeMap(const ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>& _G,
marci@266	1231	// T a) : GraphWrapper::NodeMap<T>(_G.gw, a) { }
marci@266	1232	// };
marci@155	1233
marci@155	1234	// template <typename T>
marci@155	1235	// class NodeMap {
marci@155	1236	// typename Graph::NodeMap<T> node_map;
marci@155	1237	// public:
marci@174	1238	// NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : node_map(*(_G.graph)) { }
marci@174	1239	// NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : node_map(*(_G.graph), a) { }
marci@174	1240	// void set(Node nit, T a) { node_map.set(nit, a); }
marci@174	1241	// T get(Node nit) const { return node_map.get(nit); }
marci@155	1242	// };
marci@155	1243
marci@155	1244	template <typename T>
marci@155	1245	class EdgeMap {
marci@259	1246	typename GraphWrapper::EdgeMap<T> forward_map, backward_map;
marci@155	1247	public:
marci@266	1248	EdgeMap(const ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>& _G) : forward_map(_G.gw), backward_map(_G.gw) { }
marci@266	1249	EdgeMap(const ResGraphWrapper<GraphWrapper, Number, FlowMap, CapacityMap>& _G, T a) : forward_map(_G.gw, a), backward_map(_G.gw, a) { }
marci@174	1250	void set(Edge e, T a) {
marci@155	1251	if (e.out_or_in)
marci@155	1252	forward_map.set(e.out, a);
marci@155	1253	else
marci@155	1254	backward_map.set(e.in, a);
marci@155	1255	}
marci@174	1256	T get(Edge e) {
marci@155	1257	if (e.out_or_in)
marci@155	1258	return forward_map.get(e.out);
marci@155	1259	else
marci@155	1260	return backward_map.get(e.in);
marci@155	1261	}
marci@155	1262	};
marci@168	1263	};
marci@168	1264
marci@269	1265	//Subgraph on the same node-set and partial edge-set
marci@269	1266	template<typename GraphWrapper, typename FirstOutEdgesMap>
marci@269	1267	class ErasingFirstGraphWrapper : public GraphWrapperSkeleton<GraphWrapper> {
marci@269	1268	protected:
marci@269	1269	FirstOutEdgesMap* first_out_edges;
marci@269	1270	public:
marci@269	1271	typedef typename GraphWrapperSkeleton<GraphWrapper>::Node Node;
marci@269	1272	typedef typename GraphWrapperSkeleton<GraphWrapper>::NodeIt NodeIt;
marci@269	1273	typedef typename GraphWrapperSkeleton<GraphWrapper>::Edge Edge;
marci@269	1274	typedef typename GraphWrapperSkeleton<GraphWrapper>::EdgeIt EdgeIt;
marci@269	1275	typedef typename GraphWrapperSkeleton<GraphWrapper>::InEdgeIt InEdgeIt;
marci@269	1276	typedef typename GraphWrapperSkeleton<GraphWrapper>::OutEdgeIt OutEdgeIt;
marci@269	1277
marci@269	1278	ErasingFirstGraphWrapper(GraphWrapper _gw, FirstOutEdgesMap& _first_out_edges) :
marci@269	1279	GraphWrapperSkeleton<GraphWrapper>(_gw), first_out_edges(&_first_out_edges) { }
marci@269	1280
marci@269	1281	template<typename I> I& first(I& i) const {
marci@269	1282	gw.first(i);
marci@269	1283	//while (gw.valid(i) && !filter_map->get(i)) { gw.next(i); }
marci@269	1284	return i;
marci@269	1285	}
marci@269	1286	OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@269	1287	e=first_out_edges->get(n);
marci@269	1288	return e;
marci@269	1289	}
marci@269	1290	template<typename I, typename P> I& first(I& i, const P& p) const {
marci@269	1291	gw.first(i, p);
marci@269	1292	//while (gw.valid(i) && !filter_map->get(i)) { gw.next(i); }
marci@269	1293	return i;
marci@269	1294	}
marci@269	1295
marci@269	1296	//template<typename I> I getNext(const I& i) const {
marci@269	1297	// return gw.getNext(i);
marci@269	1298	//}
marci@269	1299	template<typename I> I& next(I &i) const {
marci@269	1300	gw.next(i);
marci@269	1301	//while (gw.valid(i) && !filter_map->get(i)) { gw.next(i); }
marci@269	1302	return i;
marci@269	1303	}
marci@269	1304
marci@269	1305	template< typename It > It first() const {
marci@269	1306	It e; this->first(e); return e; }
marci@269	1307
marci@269	1308	template< typename It > It first(const Node& v) const {
marci@269	1309	It e; this->first(e, v); return e; }
marci@269	1310
marci@269	1311	void erase(const OutEdgeIt& e) const {
marci@269	1312	OutEdgeIt f=e;
marci@269	1313	this->next(f);
marci@269	1314	first_out_edges->set(this->tail(e), f);
marci@269	1315	}
marci@269	1316	};
marci@269	1317
marci@266	1318	// template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@266	1319	// class ErasingResGraphWrapper : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap> {
marci@266	1320	// protected:
marci@266	1321	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt> first_out_edges;
marci@266	1322	// //ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<int> dist;
marci@266	1323	// public:
marci@266	1324	// ErasingResGraphWrapper(const Graph& _G, FlowMap& _flow,
marci@266	1325	// const CapacityMap& _capacity) :
marci@266	1326	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>(_G, _flow, _capacity),
marci@266	1327	// first_out_edges(this) /, dist(this)/ {
marci@266	1328	// for(NodeIt n=this->template first<NodeIt>(); this->valid(n); this->next(n)) {
marci@266	1329	// OutEdgeIt e;
marci@266	1330	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(e, n);
marci@266	1331	// first_out_edges.set(n, e);
marci@266	1332	// }
marci@266	1333	// }
marci@168	1334
marci@266	1335	// //void setGraph(Graph& _graph) { graph = &_graph; }
marci@266	1336	// //Graph& getGraph() const { return (*graph); }
marci@168	1337
marci@266	1338	// //TrivGraphWrapper() : graph(0) { }
marci@266	1339	// //ErasingResGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168	1340
marci@266	1341	// //typedef Graph BaseGraph;
marci@168	1342
marci@266	1343	// //typedef typename Graph::Node Node;
marci@266	1344	// //typedef typename Graph::NodeIt NodeIt;
marci@168	1345
marci@266	1346	// //typedef typename Graph::Edge Edge;
marci@266	1347	// //typedef typename Graph::OutEdgeIt OutEdgeIt;
marci@266	1348	// //typedef typename Graph::InEdgeIt InEdgeIt;
marci@266	1349	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@266	1350	// //typedef typename Graph::EdgeIt EdgeIt;
marci@168	1351
marci@266	1352	// typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Node Node;
marci@266	1353	// typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeIt NodeIt;
marci@168	1354
marci@266	1355	// typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Edge Edge;
marci@266	1356	// typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt OutEdgeIt;
marci@266	1357	// //typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::InEdgeIt InEdgeIt;
marci@266	1358	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@266	1359	// //typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeIt EdgeIt;
marci@168	1360
marci@266	1361	// NodeIt& first(NodeIt& n) const {
marci@266	1362	// return ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(n);
marci@266	1363	// }
marci@168	1364
marci@266	1365	// OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@266	1366	// e=first_out_edges.get(n);
marci@266	1367	// return e;
marci@266	1368	// }
marci@168	1369
marci@266	1370	// //ROSSZ template<typename I> I& first(I& i) const { return first(i); }
marci@266	1371	// //ROSSZ template<typename I, typename P> I& first(I& i, const P& p) const {
marci@266	1372	// // return first(i, p); }
marci@168	1373
marci@266	1374	// //template<typename I> I getNext(const I& i) const {
marci@266	1375	// // return gw.getNext(i); }
marci@266	1376	// //template<typename I> I& next(I &i) const { return gw.next(i); }
marci@168	1377
marci@266	1378	// template< typename It > It first() const {
marci@266	1379	// It e; first(e); return e; }
marci@168	1380
marci@266	1381	// template< typename It > It first(const Node& v) const {
marci@266	1382	// It e; first(e, v); return e; }
marci@168	1383
marci@266	1384	// //Node head(const Edge& e) const { return gw.head(e); }
marci@266	1385	// //Node tail(const Edge& e) const { return gw.tail(e); }
marci@168	1386
marci@266	1387	// //template<typename I> bool valid(const I& i) const
marci@266	1388	// // { return gw.valid(i); }
marci@168	1389
marci@266	1390	// //int nodeNum() const { return gw.nodeNum(); }
marci@266	1391	// //int edgeNum() const { return gw.edgeNum(); }
marci@168	1392
marci@266	1393	// //template<typename I> Node aNode(const I& e) const {
marci@266	1394	// // return gw.aNode(e); }
marci@266	1395	// //template<typename I> Node bNode(const I& e) const {
marci@266	1396	// // return gw.bNode(e); }
marci@168	1397
marci@266	1398	// //Node addNode() const { return gw.addNode(); }
marci@266	1399	// //Edge addEdge(const Node& tail, const Node& head) const {
marci@266	1400	// // return gw.addEdge(tail, head); }
marci@168	1401
marci@266	1402	// //void erase(const OutEdgeIt& e) {
marci@266	1403	// // first_out_edge(this->tail(e))=e;
marci@266	1404	// //}
marci@266	1405	// void erase(const Edge& e) {
marci@266	1406	// OutEdgeIt f(e);
marci@266	1407	// next(f);
marci@266	1408	// first_out_edges.set(this->tail(e), f);
marci@266	1409	// }
marci@266	1410	// //template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@168	1411
marci@266	1412	// //void clear() const { gw.clear(); }
marci@168	1413
marci@266	1414	// template<typename T> class NodeMap : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T> {
marci@266	1415	// public:
marci@266	1416	// NodeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) :
marci@266	1417	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /_G.getGraph()/) { }
marci@266	1418	// NodeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) :
marci@266	1419	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /_G.getGraph()/, a) { }
marci@266	1420	// };
marci@168	1421
marci@266	1422	// template<typename T> class EdgeMap : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T> {
marci@266	1423	// public:
marci@266	1424	// EdgeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) :
marci@266	1425	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /_G.getGraph()/) { }
marci@266	1426	// EdgeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) :
marci@266	1427	// ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /_G.getGraph()/, a) { }
marci@266	1428	// };
marci@266	1429	// };
marci@168	1430
marci@266	1431	// template<typename GraphWrapper>
marci@266	1432	// class FilterGraphWrapper {
marci@266	1433	// };
marci@168	1434
marci@266	1435	// template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
marci@266	1436	// class FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> > : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> {
marci@168	1437
marci@266	1438	// //Graph* graph;
marci@168	1439
marci@266	1440	// public:
marci@266	1441	// //typedef Graph BaseGraph;
marci@168	1442
marci@266	1443	// typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Node Node;
marci@266	1444	// typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeIt NodeIt;
marci@168	1445
marci@266	1446	// typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Edge Edge;
marci@266	1447	// typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt OutEdgeIt;
marci@266	1448	// //typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::InEdgeIt InEdgeIt;
marci@266	1449	// //typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@266	1450	// typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeIt EdgeIt;
marci@168	1451
marci@266	1452	// //FilterGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt> first_out_edges;
marci@168	1453
marci@266	1454	// public:
marci@266	1455	// FilterGraphWrapper(const Graph& _G, FlowMap& _flow,
marci@266	1456	// const CapacityMap& _capacity) :
marci@266	1457	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>(_G, _flow, _capacity), dist(*this, gw.nodeNum()) {
marci@266	1458	// }
marci@168	1459
marci@266	1460	// OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
marci@266	1461	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(e, n);
marci@266	1462	// while (valid(e) && (dist.get(tail(e))/+1!=/>=dist.get(head(e))))
marci@266	1463	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@266	1464	// return e;
marci@266	1465	// }
marci@168	1466
marci@266	1467	// NodeIt& next(NodeIt& e) const {
marci@266	1468	// return ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@266	1469	// }
marci@168	1470
marci@266	1471	// OutEdgeIt& next(OutEdgeIt& e) const {
marci@266	1472	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@266	1473	// while (valid(e) && (dist.get(tail(e))/+1!/>=dist.get(head(e))))
marci@266	1474	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
marci@266	1475	// return e;
marci@266	1476	// }
marci@168	1477
marci@266	1478	// NodeIt& first(NodeIt& n) const {
marci@266	1479	// return ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(n);
marci@266	1480	// }
marci@168	1481
marci@266	1482	// void erase(const Edge& e) {
marci@266	1483	// OutEdgeIt f(e);
marci@266	1484	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(f);
marci@266	1485	// while (valid(f) && (dist.get(tail(f))/+1!=/>=dist.get(head(f))))
marci@266	1486	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(f);
marci@266	1487	// first_out_edges.set(this->tail(e), f);
marci@266	1488	// }
marci@168	1489
marci@266	1490	// //TrivGraphWrapper() : graph(0) { }
marci@266	1491	// //TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@168	1492
marci@266	1493	// //void setGraph(Graph& _graph) { graph = &_graph; }
marci@266	1494	// //Graph& getGraph() const { return (*graph); }
marci@168	1495
marci@266	1496	// //template<typename I> I& first(I& i) const { return gw.first(i); }
marci@266	1497	// //template<typename I, typename P> I& first(I& i, const P& p) const {
marci@266	1498	// // return gw.first(i, p); }
marci@168	1499
marci@266	1500	// //template<typename I> I getNext(const I& i) const {
marci@266	1501	// // return gw.getNext(i); }
marci@266	1502	// //template<typename I> I& next(I &i) const { return gw.next(i); }
marci@168	1503
marci@266	1504	// template< typename It > It first() const {
marci@266	1505	// It e; first(e); return e; }
marci@168	1506
marci@266	1507	// template< typename It > It first(const Node& v) const {
marci@266	1508	// It e; first(e, v); return e; }
marci@168	1509
marci@266	1510	// //Node head(const Edge& e) const { return gw.head(e); }
marci@266	1511	// //Node tail(const Edge& e) const { return gw.tail(e); }
marci@168	1512
marci@266	1513	// //template<typename I> bool valid(const I& i) const
marci@266	1514	// // { return gw.valid(i); }
marci@168	1515
marci@266	1516	// //template<typename I> void setInvalid(const I &i);
marci@266	1517	// //{ return gw.setInvalid(i); }
marci@168	1518
marci@266	1519	// //int nodeNum() const { return gw.nodeNum(); }
marci@266	1520	// //int edgeNum() const { return gw.edgeNum(); }
marci@168	1521
marci@266	1522	// //template<typename I> Node aNode(const I& e) const {
marci@266	1523	// // return gw.aNode(e); }
marci@266	1524	// //template<typename I> Node bNode(const I& e) const {
marci@266	1525	// // return gw.bNode(e); }
marci@168	1526
marci@266	1527	// //Node addNode() const { return gw.addNode(); }
marci@266	1528	// //Edge addEdge(const Node& tail, const Node& head) const {
marci@266	1529	// // return gw.addEdge(tail, head); }
marci@168	1530
marci@266	1531	// //template<typename I> void erase(const I& i) const { gw.erase(i); }
marci@168	1532
marci@266	1533	// //void clear() const { gw.clear(); }
marci@168	1534
marci@266	1535	// template<typename T> class NodeMap : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T> {
marci@266	1536	// public:
marci@266	1537	// NodeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G) :
marci@266	1538	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /_G.getGraph()/) { }
marci@266	1539	// NodeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G, T a) :
marci@266	1540	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /_G.getGraph()/, a) { }
marci@266	1541	// };
marci@168	1542
marci@266	1543	// template<typename T> class EdgeMap : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T> {
marci@266	1544	// public:
marci@266	1545	// EdgeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G) :
marci@266	1546	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /_G.getGraph()/) { }
marci@266	1547	// EdgeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G, T a) :
marci@266	1548	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /_G.getGraph()/, a) { }
marci@266	1549	// };
marci@168	1550
marci@266	1551	// public:
marci@266	1552	// ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<int> dist;
marci@155	1553
marci@266	1554	// };
marci@76	1555
marci@76	1556
marci@148	1557
marci@148	1558	// // FIXME: comparison should be made better!!!
marci@148	1559	// template<typename Graph, typename T, typename LowerMap, typename FlowMap, typename UpperMap>
marci@148	1560	// class ResGraphWrapper
marci@148	1561	// {
marci@148	1562	// Graph* graph;
marci@76	1563
marci@148	1564	// public:
marci@148	1565	// typedef Graph BaseGraph;
marci@76	1566
marci@174	1567	// typedef typename Graph::Node Node;
marci@174	1568	// typedef typename Graph::Edge Edge;
marci@174	1569
marci@148	1570	// typedef typename Graph::NodeIt NodeIt;
marci@76	1571
marci@148	1572	// class OutEdgeIt {
marci@148	1573	// public:
marci@174	1574	// //Graph::Node n;
marci@148	1575	// bool out_or_in;
marci@148	1576	// typename Graph::OutEdgeIt o;
marci@148	1577	// typename Graph::InEdgeIt i;
marci@148	1578	// };
marci@148	1579	// class InEdgeIt {
marci@148	1580	// public:
marci@174	1581	// //Graph::Node n;
marci@148	1582	// bool out_or_in;
marci@148	1583	// typename Graph::OutEdgeIt o;
marci@148	1584	// typename Graph::InEdgeIt i;
marci@148	1585	// };
marci@148	1586	// typedef typename Graph::SymEdgeIt SymEdgeIt;
marci@174	1587	// typedef typename Graph::EdgeIt EdgeIt;
marci@76	1588
marci@259	1589	// int nodeNum() const { return gw.nodeNum(); }
marci@259	1590	// int edgeNum() const { return gw.edgeNum(); }
marci@76	1591
marci@259	1592	// Node& first(Node& n) const { return gw.first(n); }
marci@76	1593
marci@174	1594	// // Edge and SymEdge is missing!!!!
marci@174	1595	// // Edge <-> In/OutEdgeIt conversion is missing!!!!
marci@76	1596
marci@148	1597	// //FIXME
marci@212	1598	// OutEdgeIt& first(OutEdgeIt& e, const Node& n) const
marci@148	1599	// {
marci@148	1600	// e.n=n;
marci@259	1601	// gw.first(e.o,n);
marci@259	1602	// while(gw.valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
marci@259	1603	// gw.goNext(e.o);
marci@259	1604	// if(!gw.valid(e.o)) {
marci@259	1605	// gw.first(e.i,n);
marci@259	1606	// while(gw.valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
marci@259	1607	// gw.goNext(e.i);
marci@148	1608	// }
marci@148	1609	// return e;
marci@148	1610	// }
marci@148	1611	// /*
marci@148	1612	// OutEdgeIt &goNext(OutEdgeIt &e)
marci@148	1613	// {
marci@259	1614	// if(gw.valid(e.o)) {
marci@259	1615	// while(gw.valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
marci@259	1616	// gw.goNext(e.o);
marci@259	1617	// if(gw.valid(e.o)) return e;
marci@259	1618	// else gw.first(e.i,e.n);
marci@148	1619	// }
marci@148	1620	// else {
marci@259	1621	// while(gw.valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
marci@259	1622	// gw.goNext(e.i);
marci@148	1623	// return e;
marci@148	1624	// }
marci@148	1625	// }
marci@148	1626	// OutEdgeIt Next(const OutEdgeIt &e) {OutEdgeIt t(e); return goNext(t);}
marci@148	1627	// */
marci@259	1628	// //bool valid(const OutEdgeIt e) { return gw.valid(e.o)\|\|gw.valid(e.i);}
marci@76	1629
marci@148	1630	// //FIXME
marci@212	1631	// InEdgeIt& first(InEdgeIt& e, const Node& n) const
marci@148	1632	// {
marci@148	1633	// e.n=n;
marci@259	1634	// gw.first(e.i,n);
marci@259	1635	// while(gw.valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
marci@259	1636	// gw.goNext(e.i);
marci@259	1637	// if(!gw.valid(e.i)) {
marci@259	1638	// gw.first(e.o,n);
marci@259	1639	// while(gw.valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
marci@259	1640	// gw.goNext(e.o);
marci@148	1641	// }
marci@148	1642	// return e;
marci@148	1643	// }
marci@148	1644	// /*
marci@148	1645	// InEdgeIt &goNext(InEdgeIt &e)
marci@148	1646	// {
marci@259	1647	// if(gw.valid(e.i)) {
marci@259	1648	// while(gw.valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
marci@259	1649	// gw.goNext(e.i);
marci@259	1650	// if(gw.valid(e.i)) return e;
marci@259	1651	// else gw.first(e.o,e.n);
marci@148	1652	// }
marci@148	1653	// else {
marci@259	1654	// while(gw.valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
marci@259	1655	// gw.goNext(e.o);
marci@148	1656	// return e;
marci@148	1657	// }
marci@148	1658	// }
marci@148	1659	// InEdgeIt Next(const InEdgeIt &e) {InEdgeIt t(e); return goNext(t);}
marci@148	1660	// */
marci@259	1661	// //bool valid(const InEdgeIt e) { return gw.valid(e.i)\|\|gw.valid(e.o);}
marci@76	1662
marci@259	1663	// //template<typename I> I &goNext(I &i); { return gw.goNext(i); }
marci@259	1664	// //template<typename I> I next(const I i); { return gw.goNext(i); }
marci@76	1665
marci@148	1666	// template< typename It > It first() const {
marci@212	1667	// It e; first(e); return e; }
marci@76	1668
marci@174	1669	// template< typename It > It first(Node v) const {
marci@212	1670	// It e; first(e, v); return e; }
marci@76	1671
marci@259	1672	// Node head(const Edge& e) const { return gw.head(e); }
marci@259	1673	// Node tail(const Edge& e) const { return gw.tail(e); }
marci@76	1674
marci@174	1675	// template<typename I> Node aNode(const I& e) const {
marci@259	1676	// return gw.aNode(e); }
marci@174	1677	// template<typename I> Node bNode(const I& e) const {
marci@259	1678	// return gw.bNode(e); }
marci@76	1679
marci@148	1680	// //template<typename I> bool valid(const I i);
marci@259	1681	// //{ return gw.valid(i); }
marci@76	1682
marci@148	1683	// //template<typename I> void setInvalid(const I &i);
marci@259	1684	// //{ return gw.setInvalid(i); }
marci@76	1685
marci@259	1686	// Node addNode() { return gw.addNode(); }
marci@174	1687	// Edge addEdge(const Node& tail, const Node& head) {
marci@259	1688	// return gw.addEdge(tail, head); }
marci@76	1689
marci@259	1690	// template<typename I> void erase(const I& i) { gw.erase(i); }
marci@76	1691
marci@259	1692	// void clear() { gw.clear(); }
marci@76	1693
marci@148	1694	// template<typename S> class NodeMap : public Graph::NodeMap<S> { };
marci@148	1695	// template<typename S> class EdgeMap : public Graph::EdgeMap<S> { };
marci@76	1696
marci@148	1697	// void setGraph(Graph& _graph) { graph = &_graph; }
marci@148	1698	// Graph& getGraph() { return (*graph); }
marci@76	1699
marci@148	1700	// //ResGraphWrapper() : graph(0) { }
marci@148	1701	// ResGraphWrapper(Graph& _graph) : graph(&_graph) { }
marci@148	1702	// };
marci@76	1703
alpar@105	1704	} //namespace hugo
marci@76	1705
marci@259	1706	#endif //HUGO_GRAPH_WRAPPER_H
marci@76	1707

author	marci
	Sat, 03 Apr 2004 14:22:33 +0000
changeset 279	be43902fadb7
parent 275	2dd19df03593
child 303	1b377a730d02
permissions	-rw-r--r--