1.1 --- a/doc/basic_concepts.dox	Wed Sep 26 14:37:48 2007 +0000
     1.2 +++ b/doc/basic_concepts.dox	Thu Sep 27 13:04:06 2007 +0000
     1.3 @@ -29,7 +29,7 @@
     1.4  different classes for different purposes. They can differ in many ways, but all
     1.5  have to satisfy one or more \ref concept "graph concepts" which are standardized
     1.6  interfaces to work with the rest of the library. The most basic concept is the
     1.7 -\ref Graph.<br>
     1.8 +\ref concepts::Graph "Graph".<br>
     1.9  A good example is the \ref ListGraph which we already know from Hello World and
    1.10  will be used in our examples as well.
    1.11  
    1.12 @@ -47,7 +47,7 @@
    1.13  If the graph fits the ExtendableGraphComponent concept, then you can add new nodes
    1.14  to the graph with the addNode() member function. It returns the newly added node
    1.15  (as value). So if you need the new node to do something useful with, for example
    1.16 -create an edge, assign a value to it through \ref map1 maps.
    1.17 +create an edge, assign a value to it through \ref maps1 maps.
    1.18  \code lemon::ListGraph::Node  new_node = graph.addNode(); \endcode
    1.19  
    1.20  If the graph fits into the ErasableGraphComponent concept you can also remove nodes
    1.21 @@ -114,8 +114,10 @@
    1.22  graph class described above. (There is a powerful technique using maps right in
    1.23  the next page.)
    1.24  
    1.25 -The \ref EdgeIt works exactly the same - nothing more to say. But there are \ref InEdgeIt
    1.26 -and \ref OutEdgeIt by directed graphs and \ref IncEdgeIt by undirected graphs.
    1.27 +The \ref concepts::Graph::EdgeIt "EdgeIt" works exactly the same - nothing more to say.
    1.28 +But there are \ref concepts::Graph::InEdgeIt "InEdgeIt" and
    1.29 +\ref concepts::Graph::OutEdgeIt "OutEdgeIt" by directed graphs and
    1.30 +\ref concepts::UGraph::IncEdgeIt "IncEdgeIt" by undirected graphs.
    1.31  They take two arguments. The first is a graph, the second is certain node of the
    1.32  graph. InEdgeIt iterates on the incoming edges of that node and OutEdgeIt does it
    1.33  on the outgoing edges. The IncEdgeIt of course iterates every edge connecting to