equal
deleted
inserted
replaced
53 g.addEdge(c,a); |
53 g.addEdge(c,a); |
54 \endcode |
54 \endcode |
55 |
55 |
56 Each edge has an inherent orientation, thus it can be defined whether |
56 Each edge has an inherent orientation, thus it can be defined whether |
57 an arc is forward or backward oriented in an undirected graph with respect |
57 an arc is forward or backward oriented in an undirected graph with respect |
58 to this default oriantation of the represented edge. |
58 to this default orientation of the represented edge. |
59 The direction of an arc can be obtained and set using the functions |
59 The direction of an arc can be obtained and set using the functions |
60 \ref concepts::Graph::direction() "direction()" and |
60 \ref concepts::Graph::direction() "direction()" and |
61 \ref concepts::Graph::direct() "direct()", respectively. |
61 \ref concepts::Graph::direct() "direct()", respectively. |
62 |
62 |
63 For example, |
63 For example, |
127 // std::cout << arc_cost[e] << std::endl; // this is not valid |
127 // std::cout << arc_cost[e] << std::endl; // this is not valid |
128 std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl; |
128 std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl; |
129 \endcode |
129 \endcode |
130 |
130 |
131 |
131 |
132 [SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorihtms |
132 [SEC]sec_undir_graph_algs[SEC] Undirected Graph Algorithms |
133 |
133 |
134 \todo This subsection is under construction. |
134 \todo This subsection is under construction. |
135 |
135 |
136 If you would like to design an electric network minimizing the total length |
136 If you would like to design an electric network minimizing the total length |
137 of wires, then you might be looking for a minimum spanning tree in an |
137 of wires, then you might be looking for a minimum spanning tree in an |