Changeset 1631:e15162d8eca1 in lemon-0.x for lemon/concept/undir_graph.h
- Timestamp:
- 08/16/05 21:06:59 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2139
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/undir_graph.h
r1630 r1631 233 233 /// 234 234 /// In LEMON undirected graphs also fulfill the concept of directed 235 /// graphs (\ref lemon::concept:: Graph "Graph Concept"). For235 /// graphs (\ref lemon::concept::StaticGraph "Graph Concept"). For 236 236 /// explanation of this and more see also the page \ref undir_graphs, 237 237 /// a tutorial about undirected graphs. … … 558 558 /// This constructor sets the iterator to the first edge of \c g. 559 559 ///@param g the graph 560 EdgeIt(const UndirGraph &) { }560 EdgeIt(const UndirGraph &g) { } 561 561 /// Edge -> EdgeIt conversion 562 562 … … 606 606 ///@param n the node 607 607 ///@param g the graph 608 OutEdgeIt(const UndirGraph& , const Node&) { }608 OutEdgeIt(const UndirGraph& n, const Node& g) { } 609 609 /// Edge -> OutEdgeIt conversion 610 610 … … 655 655 ///@param n the node 656 656 ///@param g the graph 657 InEdgeIt(const UndirGraph& , const Node&) { }657 InEdgeIt(const UndirGraph& g, const Node& n) { } 658 658 /// Edge -> InEdgeIt conversion 659 659
Note: See TracChangeset
for help on using the changeset viewer.