57 typedef Graph:: Node Node; \ |
57 typedef Graph:: Node Node; \ |
58 typedef Graph:: NodeIt NodeIt; \ |
58 typedef Graph:: NodeIt NodeIt; \ |
59 typedef Graph:: Edge Edge; \ |
59 typedef Graph:: Edge Edge; \ |
60 typedef Graph:: EdgeIt EdgeIt; \ |
60 typedef Graph:: EdgeIt EdgeIt; \ |
61 typedef Graph:: InEdgeIt InEdgeIt; \ |
61 typedef Graph:: InEdgeIt InEdgeIt; \ |
62 typedef Graph::OutEdgeIt OutEdgeIt; \ |
62 typedef Graph::OutEdgeIt OutEdgeIt; |
63 typedef Graph::NodeMap<bool> BoolNodeMap; \ |
63 // typedef Graph::template NodeMap<bool> BoolNodeMap; |
64 typedef Graph::NodeMap<int> IntNodeMap; \ |
64 // typedef Graph::template NodeMap<int> IntNodeMap; |
65 typedef Graph::NodeMap<double> DoubleNodeMap; \ |
65 // typedef Graph::template NodeMap<double> DoubleNodeMap; |
66 typedef Graph::EdgeMap<bool> BoolEdgeMap; \ |
66 // typedef Graph::template EdgeMap<bool> BoolEdgeMap; |
67 typedef Graph::EdgeMap<int> IntEdgeMap; \ |
67 // typedef Graph::template EdgeMap<int> IntEdgeMap; |
68 typedef Graph::EdgeMap<double> DoubleEdgeMap; |
68 // typedef Graph::template EdgeMap<double> DoubleEdgeMap; |
69 |
69 |
70 ///Creates convenience typedefs for the undirected graph types and iterators |
70 ///Creates convenience typedefs for the undirected graph types and iterators |
71 |
71 |
72 ///This \c \#define creates the same convenience typedefs as defined by |
72 ///This \c \#define creates the same convenience typedefs as defined by |
73 ///\ref GRAPH_TYPEDEFS(Graph) and three more, namely it creates |
73 ///\ref GRAPH_TYPEDEFS(Graph) and three more, namely it creates |
83 ///template typedefs in C++. |
83 ///template typedefs in C++. |
84 #define UNDIRGRAPH_TYPEDEFS(Graph) \ |
84 #define UNDIRGRAPH_TYPEDEFS(Graph) \ |
85 GRAPH_TYPEDEFS(Graph) \ |
85 GRAPH_TYPEDEFS(Graph) \ |
86 typedef Graph:: UndirEdge UndirEdge; \ |
86 typedef Graph:: UndirEdge UndirEdge; \ |
87 typedef Graph:: UndirEdgeIt UndirEdgeIt; \ |
87 typedef Graph:: UndirEdgeIt UndirEdgeIt; \ |
88 typedef Graph:: IncEdgeIt IncEdgeIt; \ |
88 typedef Graph:: IncEdgeIt IncEdgeIt; |
89 typedef Graph::UndirEdgeMap<bool> BoolUndirEdgeMap; \ |
89 // typedef Graph::template UndirEdgeMap<bool> BoolUndirEdgeMap; |
90 typedef Graph::UndirEdgeMap<int> IntUndirEdgeMap; \ |
90 // typedef Graph::template UndirEdgeMap<int> IntUndirEdgeMap; |
91 typedef Graph::UndirEdgeMap<double> DoubleUndirEdgeMap; |
91 // typedef Graph::template UndirEdgeMap<double> DoubleUndirEdgeMap; |
92 |
92 |
93 |
93 |
94 |
94 |
95 /// \brief Function to count the items in the graph. |
95 /// \brief Function to count the items in the graph. |
96 /// |
96 /// |