r147:7c39a090cfc3
Wed, 23 Apr 2008 15:33:53
[Not Reviewed]
0 comments (0 inline)
0
1
0
| ... | ... |
@@ -155,25 +155,25 @@ |
| 155 | 155 |
|
| 156 | 156 |
///This \c \#define creates the same convenience typedefs as defined |
| 157 | 157 |
///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates |
| 158 | 158 |
///\c Edge, \c EdgeIt, \c IncEdgeIt, \c BoolEdgeMap, \c IntEdgeMap, |
| 159 | 159 |
///\c DoubleEdgeMap. |
| 160 | 160 |
#define GRAPH_TYPEDEFS(Graph) \ |
| 161 | 161 |
DIGRAPH_TYPEDEFS(Graph); \ |
| 162 | 162 |
typedef typename ::lemon::_graph_utils_bits:: \ |
| 163 | 163 |
Edge<Graph>::type Edge; \ |
| 164 | 164 |
typedef typename ::lemon::_graph_utils_bits:: \ |
| 165 | 165 |
EdgeIt<Graph>::type EdgeIt; \ |
| 166 | 166 |
typedef typename ::lemon::_graph_utils_bits:: \ |
| 167 |
IncEdgeIt<Graph>::type IncEdgeIt \ |
|
| 167 |
IncEdgeIt<Graph>::type IncEdgeIt; \ |
|
| 168 | 168 |
typedef typename ::lemon::_graph_utils_bits:: \ |
| 169 | 169 |
BoolEdgeMap<Graph>::type BoolEdgeMap; \ |
| 170 | 170 |
typedef typename ::lemon::_graph_utils_bits:: \ |
| 171 | 171 |
IntEdgeMap<Graph>::type IntEdgeMap; \ |
| 172 | 172 |
typedef typename ::lemon::_graph_utils_bits:: \ |
| 173 | 173 |
DoubleEdgeMap<Graph>::type DoubleEdgeMap |
| 174 | 174 |
|
| 175 | 175 |
|
| 176 | 176 |
/// \brief Function to count the items in the graph. |
| 177 | 177 |
/// |
| 178 | 178 |
/// This function counts the items (nodes, arcs etc) in the graph. |
| 179 | 179 |
/// The complexity of the function is O(n) because |
0 comments (0 inline)