# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1241879999 -7200
# Node ID bf7928412136b879be4657e7b921ad67f4aaae99
# Parent cb38ccedd2c1335c38de0a85aad55e1feb20f6bf
Change Graph::Edge -> Graph::Arc inheritance to conversion (#283)
diff --git a/lemon/concepts/graph.h b/lemon/concepts/graph.h
|
a
|
b
|
|
| 310 | 310 | |
| 311 | 311 | /// The directed arc type. It can be converted to the |
| 312 | 312 | /// edge or it should be inherited from the undirected |
| 313 | | /// arc. |
| 314 | | class Arc : public Edge { |
| | 313 | /// edge. |
| | 314 | class Arc { |
| 315 | 315 | public: |
| 316 | 316 | /// Default constructor |
| 317 | 317 | |
| … |
… |
|
| 322 | 322 | |
| 323 | 323 | /// Copy constructor. |
| 324 | 324 | /// |
| 325 | | Arc(const Arc& e) : Edge(e) { } |
| | 325 | Arc(const Arc&) { } |
| 326 | 326 | /// Initialize the iterator to be invalid. |
| 327 | 327 | |
| 328 | 328 | /// Initialize the iterator to be invalid. |
| … |
… |
|
| 349 | 349 | /// ordering of the items. |
| 350 | 350 | bool operator<(Arc) const { return false; } |
| 351 | 351 | |
| | 352 | /// Converison to Edge |
| | 353 | operator Edge() const { return Edge(); } |
| 352 | 354 | }; |
| 353 | 355 | /// This iterator goes through each directed arc. |
| 354 | 356 | |