Changeset 986:e997802b855c in lemon-0.x for src/lemon/concept
- Timestamp:
- 11/13/04 13:53:28 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1376
- Location:
- src/lemon/concept
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/concept/graph.h
r961 r986 364 364 // EdgeIt& first(EdgeIt& i) const { return i; } 365 365 366 // ///Gives back the headnode of an edge.367 368 // ///Gives back the headnode of an edge.369 // /// 370 // Node head(Edge) const { return INVALID; }371 // ///Gives back the tailnode of an edge.372 373 // ///Gives back the tailnode of an edge.374 // /// 375 // Node tail(Edge) const { return INVALID; }366 // ///Gives back the target node of an edge. 367 368 // ///Gives back the target node of an edge. 369 // /// 370 // Node target(Edge) const { return INVALID; } 371 // ///Gives back the source node of an edge. 372 373 // ///Gives back the source node of an edge. 374 // /// 375 // Node source(Edge) const { return INVALID; } 376 376 377 377 // ///Gives back the \e id of a node. … … 539 539 // Edge e; 540 540 // e=INVALID; 541 // n=G. tail(e);542 // n=G. head(e);541 // n=G.source(e); 542 // n=G.target(e); 543 543 // } 544 544 // // id tests … … 666 666 // ///Add a new edge to the graph. 667 667 668 // ///Add a new edge to the graph with tailnode \c t669 // ///and headnode \c h.668 // ///Add a new edge to the graph with source node \c t 669 // ///and target node \c h. 670 670 // ///\return the new edge. 671 671 // Edge addEdge(Node h, Node t) { return INVALID; } … … 801 801 void nextInEdge(Edge &e) const { } 802 802 803 Node head(Edge) const { return Node(); }804 Node tail(Edge) const { return Node(); }803 Node target(Edge) const { return Node(); } 804 Node source(Edge) const { return Node(); } 805 805 806 806 -
src/lemon/concept/graph_component.h
r980 r986 243 243 }; 244 244 245 ///Gives back the headnode of an edge.246 247 ///Gives back the headnode of an edge.248 /// 249 Node head(const Edge&) const { return INVALID;}250 251 ///Gives back the tailnode of an edge.252 253 ///Gives back the tailnode of an edge.254 /// 255 Node tail(const Edge&) const { return INVALID;}245 ///Gives back the target node of an edge. 246 247 ///Gives back the target node of an edge. 248 /// 249 Node target(const Edge&) const { return INVALID;} 250 251 ///Gives back the source node of an edge. 252 253 ///Gives back the source node of an edge. 254 /// 255 Node source(const Edge&) const { return INVALID;} 256 256 }; 257 257 … … 273 273 Node n; 274 274 Edge e; 275 n = graph. tail(e);276 n = graph. head(e);275 n = graph.source(e); 276 n = graph.target(e); 277 277 } 278 278 } -
src/lemon/concept/path.h
r967 r986 67 67 /// Starting point of the path. 68 68 /// Returns INVALID if the path is empty. 69 GraphNode/*It*/ head() const {return INVALID;}69 GraphNode/*It*/ target() const {return INVALID;} 70 70 /// \brief End point of the path. 71 71 /// 72 72 /// End point of the path. 73 73 /// Returns INVALID if the path is empty. 74 GraphNode/*It*/ tail() const {return INVALID;}74 GraphNode/*It*/ source() const {return INVALID;} 75 75 76 76 /// \brief First NodeIt/EdgeIt. … … 81 81 It& first(It &i) const { return i=It(*this); } 82 82 83 /// \brief The headof an edge.84 /// 85 /// Returns node iterator pointing to the headnode of the83 /// \brief The target of an edge. 84 /// 85 /// Returns node iterator pointing to the target node of the 86 86 /// given edge iterator. 87 NodeIt head(const EdgeIt& e) const {return INVALID;}88 89 /// \brief The tailof an edge.90 /// 91 /// Returns node iterator pointing to the tailnode of the87 NodeIt target(const EdgeIt& e) const {return INVALID;} 88 89 /// \brief The source of an edge. 90 /// 91 /// Returns node iterator pointing to the source node of the 92 92 /// given edge iterator. 93 NodeIt tail(const EdgeIt& e) const {return INVALID;}93 NodeIt source(const EdgeIt& e) const {return INVALID;} 94 94 95 95 -
src/lemon/concept/sym_graph.h
r959 r986 451 451 SymEdgeIt& first(SymEdgeIt& i) const { return i; } 452 452 453 ///Gives back the headnode of an edge.454 455 ///Gives back the headnode of an edge.456 /// 457 Node head(Edge) const { return INVALID; }458 ///Gives back the tailnode of an edge.459 460 ///Gives back the tailnode of an edge.461 /// 462 Node tail(Edge) const { return INVALID; }453 ///Gives back the target node of an edge. 454 455 ///Gives back the target node of an edge. 456 /// 457 Node target(Edge) const { return INVALID; } 458 ///Gives back the source node of an edge. 459 460 ///Gives back the source node of an edge. 461 /// 462 Node source(Edge) const { return INVALID; } 463 463 464 464 ///Gives back the first node of an symmetric edge. … … 466 466 ///Gives back the first node of an symmetric edge. 467 467 /// 468 Node head(SymEdge) const { return INVALID; }468 Node target(SymEdge) const { return INVALID; } 469 469 ///Gives back the second node of an symmetric edge. 470 470 471 471 ///Gives back the second node of an symmetric edge. 472 472 /// 473 Node tail(SymEdge) const { return INVALID; }473 Node source(SymEdge) const { return INVALID; } 474 474 ///Gives back the \e id of a node. 475 475 … … 608 608 ///Add a new edge to the graph. 609 609 610 ///Add a new symmetric edge to the graph with tailnode \c t611 ///and headnode \c h.610 ///Add a new symmetric edge to the graph with source node \c t 611 ///and target node \c h. 612 612 ///\return the new edge. 613 613 SymEdge addEdge(Node h, Node t) { return INVALID; } -
src/lemon/concept/undir_graph.h
r962 r986 48 48 49 49 Node n; 50 n = graph. head(ue);51 n = graph. tail(ue);50 n = graph.target(ue); 51 n = graph.source(ue); 52 52 53 53 graph.first(ue);
Note: See TracChangeset
for help on using the changeset viewer.