32 |
32 |
33 ///Structure returned by \ref addPetersen(). |
33 ///Structure returned by \ref addPetersen(). |
34 /// |
34 /// |
35 template<class Graph> struct PetStruct |
35 template<class Graph> struct PetStruct |
36 { |
36 { |
37 ///. |
37 ///Vector containing the outer nodes. |
38 std::vector<typename Graph::Node> outer, inner; |
38 std::vector<typename Graph::Node> outer; |
39 ///. |
39 ///Vector containing the inner nodes. |
40 std::vector<typename Graph::Edge> outcir, incir, chords; |
40 std::vector<typename Graph::Node> inner; |
|
41 ///Vector containing the edges of the inner circle. |
|
42 std::vector<typename Graph::Edge> incir; |
|
43 ///Vector containing the edges of the outer circle. |
|
44 std::vector<typename Graph::Edge> outcir; |
|
45 ///Vector containing the chord edges. |
|
46 std::vector<typename Graph::Edge> chords; |
41 }; |
47 }; |
42 |
48 |
43 |
49 |
44 |
50 |
45 ///Adds a Petersen graph to \c G. |
51 ///Adds a Petersen graph to \c G. |
46 |
52 |
47 ///Adds a Petersen graph to \c G. |
53 ///Adds a Petersen graph to \c G. |
48 ///The nodes end edges will be listed in the return structure. |
54 ///\return The nodes end edges og the generated graph. |
49 |
55 |
50 template<typename Graph> |
56 template<typename Graph> |
51 PetStruct<Graph> addPetersen(Graph &G,int num=5) |
57 PetStruct<Graph> addPetersen(Graph &G,int num=5) |
52 { |
58 { |
53 PetStruct<Graph> n; |
59 PetStruct<Graph> n; |