equal
deleted
inserted
replaced
1 // -*- mode:C++ -*- |
1 // -*- mode:C++ -*- |
2 |
2 |
3 #ifndef HUGO_SMART_GRAPH_H |
3 #ifndef HUGO_SMART_GRAPH_H |
4 #define HUGO_SMART_GRAPH_H |
4 #define HUGO_SMART_GRAPH_H |
5 |
5 |
|
6 ///\file |
|
7 ///\brief SmartGraph and SymSmartGraph classes. |
|
8 |
6 #include <vector> |
9 #include <vector> |
7 #include <limits.h> |
10 #include <limits.h> |
8 |
11 |
9 #include <invalid.h> |
12 #include <invalid.h> |
10 |
13 |
12 |
15 |
13 class SymSmartGraph; |
16 class SymSmartGraph; |
14 |
17 |
15 ///A smart graph class. |
18 ///A smart graph class. |
16 |
19 |
17 /// When you read this for the first time, |
|
18 /// please send an e-mail to alpar\@cs.elte.hu. |
|
19 /// |
|
20 ///This is a simple and fast graph implementation. |
20 ///This is a simple and fast graph implementation. |
21 ///It is also quite memory efficient, but at the price |
21 ///It is also quite memory efficient, but at the price |
22 ///that <b> it does not support node and edge deletion</b>. |
22 ///that <b> it does not support node and edge deletion</b>. |
23 ///Apart from this it conforms to the graph interface documented under |
23 ///It conforms to the graph interface documented under |
24 ///the description of \ref GraphSkeleton. |
24 ///the description of \ref GraphSkeleton. |
25 ///\sa \ref GraphSkeleton. |
25 ///\sa \ref GraphSkeleton. |
26 class SmartGraph { |
26 class SmartGraph { |
27 |
27 |
28 struct NodeT |
28 struct NodeT |