Changeset 717:684964884a2e in lemon-1.2

Ignore:
Timestamp:
09/25/09 09:13:03 (10 years ago)
Branch:
default
Parents:
716:f47b6c94577e (diff), 715:ece80147fb08 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge

Location:
lemon
Files:
8 edited

Unmodified
Removed

• lemon/bfs.h

 r716 ///The simplest way to execute the BFS algorithm is to use one of the ///member functions called \ref run(Node) "run()".\n ///If you need more control on the execution, first you have to call ///\ref init(), then you can add several source nodes with ///If you need better control on the execution, you have to call ///\ref init() first, then you can add several source nodes with ///\ref addSource(). Finally the actual path computation can be ///performed with one of the \ref start() functions. /// The simplest way to execute the BFS algorithm is to use one of the /// member functions called \ref run(Node) "run()".\n /// If you need more control on the execution, first you have to call /// \ref init(), then you can add several source nodes with /// If you need better control on the execution, you have to call /// \ref init() first, then you can add several source nodes with /// \ref addSource(). Finally the actual path computation can be /// performed with one of the \ref start() functions.

• lemon/dfs.h

 r716 ///The simplest way to execute the DFS algorithm is to use one of the ///member functions called \ref run(Node) "run()".\n ///If you need more control on the execution, first you have to call ///\ref init(), then you can add a source node with \ref addSource() ///If you need better control on the execution, you have to call ///\ref init() first, then you can add a source node with \ref addSource() ///and perform the actual computation with \ref start(). ///This procedure can be repeated if there are nodes that have not /// The simplest way to execute the DFS algorithm is to use one of the /// member functions called \ref run(Node) "run()".\n /// If you need more control on the execution, first you have to call /// \ref init(), then you can add a source node with \ref addSource() /// If you need better control on the execution, you have to call /// \ref init() first, then you can add a source node with \ref addSource() /// and perform the actual computation with \ref start(). /// This procedure can be repeated if there are nodes that have not

• lemon/dijkstra.h

 r716 ///The simplest way to execute the %Dijkstra algorithm is to use ///one of the member functions called \ref run(Node) "run()".\n ///If you need more control on the execution, first you have to call ///\ref init(), then you can add several source nodes with ///If you need better control on the execution, you have to call ///\ref init() first, then you can add several source nodes with ///\ref addSource(). Finally the actual path computation can be ///performed with one of the \ref start() functions.
• lemon/maps.h

 r695 /// \code ///   std::vector v; ///   dfs(g,s).processedMap(loggerBoolMap(std::back_inserter(v))).run(); ///   dfs(g).processedMap(loggerBoolMap(std::back_inserter(v))).run(s); /// \endcode /// \code ///   std::vector v(countNodes(g)); ///   dfs(g,s).processedMap(loggerBoolMap(v.begin())).run(); ///   dfs(g).processedMap(loggerBoolMap(v.begin())).run(s); /// \endcode ///