Undirect graph implementation.
Not yet done, untested.
3 * src/lemon/concept/undir_graph_component.h - Part of LEMON, a generic
4 * C++ optimization library
6 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi
7 * Kutatocsoport (Egervary Combinatorial Optimization Research Group,
10 * Permission to use, modify and distribute this software is granted
11 * provided that this copyright notice appears in all copies. For
12 * precise terms see the accompanying LICENSE file.
14 * This software is provided "AS IS" with no warranty of any kind,
15 * express or implied, and with no claim as to its suitability for any
22 ///\brief Undirected graphs and components of.
25 #ifndef LEMON_CONCEPT_UNDIR_GRAPH_H
26 #define LEMON_CONCEPT_UNDIR_GRAPH_H
28 #include <lemon/concept/graph_component.h>
34 class BaseIterableUndirGraph;
36 template <typename Graph>
37 struct BaseIterableUndirGraphConcept {
38 typedef typename Graph::UndirEdge UndirEdge;
39 typedef typename Graph::Edge Edge;
40 typedef typename Graph::Node Node;
42 function_requires< BaseIterableGraphComponentConcept<Graph> >();
43 function_requires< GraphItemConcept<UndirEdge> >();
45 /// \bug this should be base_and_derived:
60 template <typename Graph>
61 struct IterableUndirGraphConcept {
63 function_requires< BaseIterableUndirGraphConcept<Graph> > ();
64 function_requires< IterableGraphComponentConcept<Graph> > ();
66 typedef typename Graph::UndirEdge UndirEdge;
67 typedef typename Graph::UndirEdgeIt UndirEdgeIt;
70 GraphIteratorConcept<UndirEdgeIt, Graph, UndirEdge> >();