equal
deleted
inserted
replaced
36 std::vector<typename Graph::Node> outer, inner; |
36 std::vector<typename Graph::Node> outer, inner; |
37 ///. |
37 ///. |
38 std::vector<typename Graph::Edge> outcir, incir, chords; |
38 std::vector<typename Graph::Edge> outcir, incir, chords; |
39 }; |
39 }; |
40 |
40 |
|
41 |
|
42 |
41 ///Adds a Petersen graph to \c G. |
43 ///Adds a Petersen graph to \c G. |
42 |
44 |
43 ///Adds a Petersen graph to \c G. |
45 ///Adds a Petersen graph to \c G. |
44 ///The nodes end edges will be listed in the return structure. |
46 ///The nodes end edges will be listed in the return structure. |
45 template<class Graph> PetStruct<Graph> addPetersen(Graph &G,int num=5) |
47 |
|
48 template<typename Graph> |
|
49 PetStruct<Graph> addPetersen(Graph &G,int num=5) |
46 { |
50 { |
47 PetStruct<Graph> n; |
51 PetStruct<Graph> n; |
48 |
52 |
49 for(int i=0;i<num;i++) { |
53 for(int i=0;i<num;i++) { |
50 n.outer.push_back(G.addNode()); |
54 n.outer.push_back(G.addNode()); |