188 class node_property_vector |
188 class node_property_vector |
189 |
189 |
190 metodusok: |
190 metodusok: |
191 |
191 |
192 node_property_vector(graph_type&) |
192 node_property_vector(graph_type&) |
|
193 node_property_vector(graph_type&, T a) |
|
194 fill constructor, a-val kitolt |
193 void put(graph_traits<graph_type>::node_iterator, const T&) |
195 void put(graph_traits<graph_type>::node_iterator, const T&) |
194 T get(graph_traits<graph_type>::node_iterator) |
196 T get(graph_traits<graph_type>::node_iterator) |
195 |
197 |
196 Ugyanez edge_property_array-okkal |
198 Ugyanez edge_property_array-okkal |
197 |
199 |
198 template <typename graph_type, typename T> |
200 template <typename graph_type, typename T> |
199 class edge_property_vector |
201 class edge_property_vector |
200 |
202 |
201 edge_property_vector(graph_type&) |
203 edge_property_vector(graph_type&) |
|
204 edge_property_vector(graph_type&, T a) |
|
205 fill constructor, a-val kitolt |
202 void put(graph_traits<graph_type>::edge_iterator, const T&) |
206 void put(graph_traits<graph_type>::edge_iterator, const T&) |
203 get(graph_traits<graph_type>::edge_iterator) |
207 get(graph_traits<graph_type>::edge_iterator) |
204 |
208 |
205 Ennyi nem javasolas utan, meg nehany szo. |
209 Ennyi nem javasolas utan, meg nehany szo. |
206 Alparral ugy gondoltuk, hogy az iterator 1 olyan egyszeru objetum legyen |
210 Alparral ugy gondoltuk, hogy az iterator 1 olyan egyszeru objetum legyen |