equal
deleted
inserted
replaced
98 e != tree_edge_vec.end(); ++e, ++i) { |
98 e != tree_edge_vec.end(); ++e, ++i) { |
99 cout << i << ". el: " << *e << endl; |
99 cout << i << ". el: " << *e << endl; |
100 } |
100 } |
101 |
101 |
102 tree_edge_vec.clear(); |
102 tree_edge_vec.clear(); |
103 SequenceOutput< back_insert_iterator< vector<Edge> > > |
103 // SequenceOutput< back_insert_iterator< vector<Edge> > > |
104 vec_filler(back_inserter(tree_edge_vec)); |
104 // vec_filler(back_inserter(tree_edge_vec)); |
|
105 // cout << "Nemkonst koltseggel tarhatekonyabban: " |
|
106 // << Kruskal(G, |
|
107 // KruskalMapVec<ECostMap>(G, edge_cost_map), |
|
108 // vec_filler) |
|
109 // << endl; |
105 cout << "Nemkonst koltseggel tarhatekonyabban: " |
110 cout << "Nemkonst koltseggel tarhatekonyabban: " |
106 << Kruskal(G, |
111 << Kruskal(G, |
107 KruskalMapVec<ECostMap>(G, edge_cost_map), |
112 KruskalMapVec<ECostMap>(G, edge_cost_map), |
108 vec_filler) |
113 makeSequenceOutput(back_inserter(tree_edge_vec)) |
|
114 ) |
109 << endl; |
115 << endl; |
110 |
116 |
111 i = 1; |
117 i = 1; |
112 for(vector<Edge>::iterator e = tree_edge_vec.begin(); |
118 for(vector<Edge>::iterator e = tree_edge_vec.begin(); |
113 e != tree_edge_vec.end(); ++e, ++i) { |
119 e != tree_edge_vec.end(); ++e, ++i) { |