Changeset 2510:bb523a4758f7 in lemon-0.x for lemon/graph_utils.h
- Timestamp:
- 11/14/07 16:36:37 (16 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3375
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/graph_utils.h
r2485 r2510 50 50 ///\note If \c G it a template parameter, it should be used in this way. 51 51 ///\code 52 /// GRAPH_TYPEDEFS(typename G) 52 /// GRAPH_TYPEDEFS(typename G); 53 53 ///\endcode 54 54 /// … … 61 61 typedef Graph:: EdgeIt EdgeIt; \ 62 62 typedef Graph:: InEdgeIt InEdgeIt; \ 63 typedef Graph::OutEdgeIt OutEdgeIt ;63 typedef Graph::OutEdgeIt OutEdgeIt 64 64 65 65 ///Creates convenience typedefs for the undirected graph types and iterators … … 71 71 ///\note If \c G it a template parameter, it should be used in this way. 72 72 ///\code 73 /// UGRAPH_TYPEDEFS(typename G) 73 /// UGRAPH_TYPEDEFS(typename G); 74 74 ///\endcode 75 75 /// … … 77 77 ///template typedefs in C++. 78 78 #define UGRAPH_TYPEDEFS(Graph) \ 79 GRAPH_TYPEDEFS(Graph) 79 GRAPH_TYPEDEFS(Graph); \ 80 80 typedef Graph:: UEdge UEdge; \ 81 81 typedef Graph:: UEdgeIt UEdgeIt; \ 82 typedef Graph:: IncEdgeIt IncEdgeIt ;82 typedef Graph:: IncEdgeIt IncEdgeIt 83 83 84 84 ///\brief Creates convenience typedefs for the bipartite undirected graph … … 91 91 ///\note If \c G it a template parameter, it should be used in this way. 92 92 ///\code 93 /// BPUGRAPH_TYPEDEFS(typename G) 93 /// BPUGRAPH_TYPEDEFS(typename G); 94 94 ///\endcode 95 95 /// … … 97 97 ///template typedefs in C++. 98 98 #define BPUGRAPH_TYPEDEFS(Graph) \ 99 UGRAPH_TYPEDEFS(Graph) 99 UGRAPH_TYPEDEFS(Graph); \ 100 100 typedef Graph::ANode ANode; \ 101 101 typedef Graph::BNode BNode; \ 102 102 typedef Graph::ANodeIt ANodeIt; \ 103 typedef Graph::BNodeIt BNodeIt ;103 typedef Graph::BNodeIt BNodeIt 104 104 105 105 /// \brief Function to count the items in the graph. … … 2493 2493 { 2494 2494 public: 2495 GRAPH_TYPEDEFS(typename G) 2495 GRAPH_TYPEDEFS(typename G); 2496 2496 typedef G Graph; 2497 2497 … … 2609 2609 using EdgeLookUp<G>::_head; 2610 2610 2611 GRAPH_TYPEDEFS(typename G) 2611 GRAPH_TYPEDEFS(typename G); 2612 2612 typedef G Graph; 2613 2613
Note: See TracChangeset
for help on using the changeset viewer.