Changeset 2476:059dcdda37c5 in lemon-0.x for doc/basic_concepts.dox

Timestamp:

09/27/07 15:04:06 (17 years ago)

Author:

Peter Kovacs

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3315

Message:

Bug fixes in the documentation (mainly bad references).

File:

• doc/basic_concepts.dox (modified) (3 diffs)

doc/basic_concepts.dox

@@ -30 +30 @@
 have to satisfy one or more \ref concept "graph concepts" which are standardized
 interfaces to work with the rest of the library. The most basic concept is the
-\ref Graph.<br>
+\ref concepts::Graph "Graph".<br>
 A good example is the \ref ListGraph which we already know from Hello World and
 will be used in our examples as well.
@@ -48 +48 @@
 to the graph with the addNode() member function. It returns the newly added node
 (as value). So if you need the new node to do something useful with, for example
-create an edge, assign a value to it through \ref map1 maps.
+create an edge, assign a value to it through \ref maps1 maps.
 \code lemon::ListGraph::Node  new_node = graph.addNode(); \endcode
 
@@ -115 +115 @@
 the next page.)
 
-The \ref EdgeIt works exactly the same - nothing more to say. But there are \ref InEdgeIt
-and \ref OutEdgeIt by directed graphs and \ref IncEdgeIt by undirected graphs.
+The \ref concepts::Graph::EdgeIt "EdgeIt" works exactly the same - nothing more to say.
+But there are \ref concepts::Graph::InEdgeIt "InEdgeIt" and
+\ref concepts::Graph::OutEdgeIt "OutEdgeIt" by directed graphs and
+\ref concepts::UGraph::IncEdgeIt "IncEdgeIt" by undirected graphs.
 They take two arguments. The first is a graph, the second is certain node of the
 graph. InEdgeIt iterates on the incoming edges of that node and OutEdgeIt does it