equal
deleted
inserted
replaced
24 |
24 |
25 using namespace lemon; |
25 using namespace lemon; |
26 |
26 |
27 //! \ingroup misc |
27 //! \ingroup misc |
28 //! \file |
28 //! \file |
29 //! \brief Some utility to write test programs. |
29 //! \brief Some utilities to write test programs. |
30 |
30 |
31 |
31 |
32 ///If \c rc is fail, writes an error message end exit. |
32 ///If \c rc is fail, writes an error message end exit. |
33 |
33 |
34 ///If \c rc is fail, writes an error message end exit. |
34 ///If \c rc is fail, writes an error message end exit. |
89 n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2) % num])); |
89 n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2) % num])); |
90 } |
90 } |
91 return n; |
91 return n; |
92 } |
92 } |
93 |
93 |
94 /// \brief Adds to the graph the reverse pair of all edge. |
94 /// \brief Adds to the graph the reverse pair of all edges. |
95 /// |
95 /// |
96 /// Adds to the graph the reverse pair of all edge. |
96 /// Adds to the graph the reverse pair of all edges. |
97 /// |
97 /// |
98 template<class Graph> void bidirGraph(Graph &G) |
98 template<class Graph> void bidirGraph(Graph &G) |
99 { |
99 { |
100 typedef typename Graph::Edge Edge; |
100 typedef typename Graph::Edge Edge; |
101 typedef typename Graph::EdgeIt EdgeIt; |
101 typedef typename Graph::EdgeIt EdgeIt; |