1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
// file : CCF/IDL2/SemanticGraph/Graph.hpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
#ifndef ELEMENT_GRAPH_HPP
#define ELEMENT_GRAPH_HPP
#include <map>
#include <set>
#include <vector>
#include <string>
#include <memory>
#include <iostream>
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
template <typename N, typename E>
class Graph
{
public:
~Graph ();
public:
template <typename T>
T&
new_node ();
template <typename T, typename A0>
T&
new_node (A0 const& a0);
template <typename T, typename A0, typename A1>
T&
new_node (A0 const& a0, A1 const& a1);
template <typename T, typename A0, typename A1, typename A2>
T&
new_node (A0 const& a0, A1 const& a1, A2 const& a2);
template <typename T,
typename A0,
typename A1,
typename A2,
typename A3>
T&
new_node (A0 const& a0, A1 const& a1, A2 const& a2, A3 const& a3);
void
delete_node (N const& n);
public:
template <typename T, typename X, typename Y>
T&
new_edge (X& left, Y& right);
template <typename T, typename X, typename Y,
typename A0>
T&
new_edge (X& left, Y& right, A0 const& a0);
template <typename T, typename X, typename Y,
typename A0,
typename A1>
T&
new_edge (X& left, Y& right, A0 const& a0, A1 const& a1);
void
delete_edge (E const& e);
protected:
typedef N* NodePtr;
typedef E* EdgePtr;
typedef std::set<NodePtr> Nodes_;
typedef std::set<EdgePtr> Edges_;
Nodes_ nodes_;
Edges_ edges_;
};
}
}
}
#include "Graph.tpp"
#endif // ELEMENT_GRAPH_HPP
|
