2 * src/lemon/dfs.h - Part of LEMON, a generic C++ optimization library
4 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Combinatorial Optimization Research Group, EGRES).
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
22 ///\brief Dfs algorithm.
24 #include <lemon/list_graph.h>
25 #include <lemon/graph_utils.h>
26 #include <lemon/invalid.h>
27 #include <lemon/error.h>
28 #include <lemon/maps.h>
34 ///Default traits class of Dfs class.
36 ///Default traits class of Dfs class.
37 ///\param GR Graph type.
39 struct DfsDefaultTraits
41 ///The graph type the algorithm runs on.
43 ///\brief The type of the map that stores the last
44 ///edges of the %DFS paths.
46 ///The type of the map that stores the last
47 ///edges of the %DFS paths.
48 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
50 typedef typename Graph::template NodeMap<typename GR::Edge> PredMap;
51 ///Instantiates a PredMap.
53 ///This function instantiates a \ref PredMap.
54 ///\param G is the graph, to which we would like to define the PredMap.
55 ///\todo The graph alone may be insufficient to initialize
56 static PredMap *createPredMap(const GR &G)
58 return new PredMap(G);
60 // ///\brief The type of the map that stores the last but one
61 // ///nodes of the %DFS paths.
63 // ///The type of the map that stores the last but one
64 // ///nodes of the %DFS paths.
65 // ///It must meet the \ref concept::WriteMap "WriteMap" concept.
67 // typedef NullMap<typename Graph::Node,typename Graph::Node> PredNodeMap;
68 // ///Instantiates a PredNodeMap.
70 // ///This function instantiates a \ref PredNodeMap.
71 // ///\param G is the graph, to which
72 // ///we would like to define the \ref PredNodeMap
73 // static PredNodeMap *createPredNodeMap(const GR &G)
75 // return new PredNodeMap();
78 ///The type of the map that indicates which nodes are processed.
80 ///The type of the map that indicates which nodes are processed.
81 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
82 ///\todo named parameter to set this type, function to read and write.
83 typedef NullMap<typename Graph::Node,bool> ProcessedMap;
84 ///Instantiates a ProcessedMap.
86 ///This function instantiates a \ref ProcessedMap.
87 ///\param G is the graph, to which
88 ///we would like to define the \ref ProcessedMap
89 static ProcessedMap *createProcessedMap(const GR &G)
91 return new ProcessedMap();
93 ///The type of the map that indicates which nodes are reached.
95 ///The type of the map that indicates which nodes are reached.
96 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
97 ///\todo named parameter to set this type, function to read and write.
98 typedef typename Graph::template NodeMap<bool> ReachedMap;
99 ///Instantiates a ReachedMap.
101 ///This function instantiates a \ref ReachedMap.
102 ///\param G is the graph, to which
103 ///we would like to define the \ref ReachedMap.
104 static ReachedMap *createReachedMap(const GR &G)
106 return new ReachedMap(G);
108 ///The type of the map that stores the dists of the nodes.
110 ///The type of the map that stores the dists of the nodes.
111 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
113 typedef typename Graph::template NodeMap<int> DistMap;
114 ///Instantiates a DistMap.
116 ///This function instantiates a \ref DistMap.
117 ///\param G is the graph, to which we would like to define the \ref DistMap
118 static DistMap *createDistMap(const GR &G)
120 return new DistMap(G);
124 ///%DFS algorithm class.
127 ///This class provides an efficient implementation of the %DFS algorithm.
129 ///\param GR The graph type the algorithm runs on. The default value is
130 ///\ref ListGraph. The value of GR is not used directly by Dfs, it
131 ///is only passed to \ref DfsDefaultTraits.
132 ///\param TR Traits class to set various data types used by the algorithm.
133 ///The default traits class is
134 ///\ref DfsDefaultTraits "DfsDefaultTraits<GR>".
135 ///See \ref DfsDefaultTraits for the documentation of
136 ///a Dfs traits class.
138 ///\author Jacint Szabo and Alpar Juttner
139 ///\todo A compare object would be nice.
142 template <typename GR,
145 template <typename GR=ListGraph,
146 typename TR=DfsDefaultTraits<GR> >
151 * \brief \ref Exception for uninitialized parameters.
153 * This error represents problems in the initialization
154 * of the parameters of the algorithms.
156 class UninitializedParameter : public lemon::UninitializedParameter {
158 virtual const char* exceptionName() const {
159 return "lemon::Dfs::UninitializedParameter";
164 ///The type of the underlying graph.
165 typedef typename TR::Graph Graph;
167 typedef typename Graph::Node Node;
169 typedef typename Graph::NodeIt NodeIt;
171 typedef typename Graph::Edge Edge;
173 typedef typename Graph::OutEdgeIt OutEdgeIt;
175 ///\brief The type of the map that stores the last
176 ///edges of the %DFS paths.
177 typedef typename TR::PredMap PredMap;
178 // ///\brief The type of the map that stores the last but one
179 // ///nodes of the %DFS paths.
180 // typedef typename TR::PredNodeMap PredNodeMap;
181 ///The type of the map indicating which nodes are reached.
182 typedef typename TR::ReachedMap ReachedMap;
183 ///The type of the map indicating which nodes are processed.
184 typedef typename TR::ProcessedMap ProcessedMap;
185 ///The type of the map that stores the dists of the nodes.
186 typedef typename TR::DistMap DistMap;
188 /// Pointer to the underlying graph.
190 ///Pointer to the map of predecessors edges.
192 ///Indicates if \ref _pred is locally allocated (\c true) or not.
194 // ///Pointer to the map of predecessors nodes.
195 // PredNodeMap *_predNode;
196 // ///Indicates if \ref _predNode is locally allocated (\c true) or not.
197 // bool local_predNode;
198 ///Pointer to the map of distances.
200 ///Indicates if \ref _dist is locally allocated (\c true) or not.
202 ///Pointer to the map of reached status of the nodes.
203 ReachedMap *_reached;
204 ///Indicates if \ref _reached is locally allocated (\c true) or not.
206 ///Pointer to the map of processed status of the nodes.
207 ProcessedMap *_processed;
208 ///Indicates if \ref _processed is locally allocated (\c true) or not.
209 bool local_processed;
211 std::vector<typename Graph::OutEdgeIt> _stack;
213 // ///The source node of the last execution.
216 ///Creates the maps if necessary.
218 ///\todo Error if \c G are \c NULL.
219 ///\todo Better memory allocation (instead of new).
224 _pred = Traits::createPredMap(*G);
227 // local_predNode = true;
228 // _predNode = Traits::createPredNodeMap(*G);
232 _dist = Traits::createDistMap(*G);
235 local_reached = true;
236 _reached = Traits::createReachedMap(*G);
239 local_processed = true;
240 _processed = Traits::createProcessedMap(*G);
246 ///\name Named template parameters
251 struct DefPredMapTraits : public Traits {
253 static PredMap *createPredMap(const Graph &G)
255 throw UninitializedParameter();
258 ///\ref named-templ-param "Named parameter" for setting PredMap type
260 ///\ref named-templ-param "Named parameter" for setting PredMap type
263 class DefPredMap : public Dfs< Graph,
264 DefPredMapTraits<T> > { };
266 // template <class T>
267 // struct DefPredNodeMapTraits : public Traits {
268 // typedef T PredNodeMap;
269 // static PredNodeMap *createPredNodeMap(const Graph &G)
271 // throw UninitializedParameter();
274 // ///\ref named-templ-param "Named parameter" for setting PredNodeMap type
276 // ///\ref named-templ-param "Named parameter" for setting PredNodeMap type
278 // template <class T>
279 // class DefPredNodeMap : public Dfs< Graph,
281 // DefPredNodeMapTraits<T> > { };
284 struct DefDistMapTraits : public Traits {
286 static DistMap *createDistMap(const Graph &G)
288 throw UninitializedParameter();
291 ///\ref named-templ-param "Named parameter" for setting DistMap type
293 ///\ref named-templ-param "Named parameter" for setting DistMap type
296 class DefDistMap : public Dfs< Graph,
297 DefDistMapTraits<T> > { };
300 struct DefReachedMapTraits : public Traits {
301 typedef T ReachedMap;
302 static ReachedMap *createReachedMap(const Graph &G)
304 throw UninitializedParameter();
307 ///\ref named-templ-param "Named parameter" for setting ReachedMap type
309 ///\ref named-templ-param "Named parameter" for setting ReachedMap type
312 class DefReachedMap : public Dfs< Graph,
313 DefReachedMapTraits<T> > { };
315 struct DefGraphReachedMapTraits : public Traits {
316 typedef typename Graph::template NodeMap<bool> ReachedMap;
317 static ReachedMap *createReachedMap(const Graph &G)
319 return new ReachedMap(G);
323 struct DefProcessedMapTraits : public Traits {
324 typedef T ProcessedMap;
325 static ProcessedMap *createProcessedMap(const Graph &G)
327 throw UninitializedParameter();
330 ///\ref named-templ-param "Named parameter" for setting ProcessedMap type
332 ///\ref named-templ-param "Named parameter" for setting ProcessedMap type
335 class DefProcessedMap : public Dfs< Graph,
336 DefProcessedMapTraits<T> > { };
338 struct DefGraphProcessedMapTraits : public Traits {
339 typedef typename Graph::template NodeMap<bool> ProcessedMap;
340 static ProcessedMap *createProcessedMap(const Graph &G)
342 return new ProcessedMap(G);
345 ///\brief \ref named-templ-param "Named parameter"
346 ///for setting the ProcessedMap type to be Graph::NodeMap<bool>.
348 ///\ref named-templ-param "Named parameter"
349 ///for setting the ProcessedMap type to be Graph::NodeMap<bool>.
350 ///If you don't set it explicitely, it will be automatically allocated.
352 class DefProcessedMapToBeDefaultMap :
354 DefGraphProcessedMapTraits> { };
362 ///\param _G the graph the algorithm will run on.
364 Dfs(const Graph& _G) :
366 _pred(NULL), local_pred(false),
367 // _predNode(NULL), local_predNode(false),
368 _dist(NULL), local_dist(false),
369 _reached(NULL), local_reached(false),
370 _processed(NULL), local_processed(false)
376 if(local_pred) delete _pred;
377 // if(local_predNode) delete _predNode;
378 if(local_dist) delete _dist;
379 if(local_reached) delete _reached;
380 if(local_processed) delete _processed;
383 ///Sets the map storing the predecessor edges.
385 ///Sets the map storing the predecessor edges.
386 ///If you don't use this function before calling \ref run(),
387 ///it will allocate one. The destuctor deallocates this
388 ///automatically allocated map, of course.
389 ///\return <tt> (*this) </tt>
390 Dfs &predMap(PredMap &m)
400 // ///Sets the map storing the predecessor nodes.
402 // ///Sets the map storing the predecessor nodes.
403 // ///If you don't use this function before calling \ref run(),
404 // ///it will allocate one. The destuctor deallocates this
405 // ///automatically allocated map, of course.
406 // ///\return <tt> (*this) </tt>
407 // Dfs &predNodeMap(PredNodeMap &m)
409 // if(local_predNode) {
411 // local_predNode=false;
417 ///Sets the map storing the distances calculated by the algorithm.
419 ///Sets the map storing the distances calculated by the algorithm.
420 ///If you don't use this function before calling \ref run(),
421 ///it will allocate one. The destuctor deallocates this
422 ///automatically allocated map, of course.
423 ///\return <tt> (*this) </tt>
424 Dfs &distMap(DistMap &m)
434 ///Sets the map indicating if a node is reached.
436 ///Sets the map indicating if a node is reached.
437 ///If you don't use this function before calling \ref run(),
438 ///it will allocate one. The destuctor deallocates this
439 ///automatically allocated map, of course.
440 ///\return <tt> (*this) </tt>
441 Dfs &reachedMap(ReachedMap &m)
451 ///Sets the map indicating if a node is processed.
453 ///Sets the map indicating if a node is processed.
454 ///If you don't use this function before calling \ref run(),
455 ///it will allocate one. The destuctor deallocates this
456 ///automatically allocated map, of course.
457 ///\return <tt> (*this) </tt>
458 Dfs &processedMap(ProcessedMap &m)
460 if(local_processed) {
462 local_processed=false;
469 ///\name Execution control
470 ///The simplest way to execute the algorithm is to use
471 ///one of the member functions called \c run(...).
473 ///If you need more control on the execution,
474 ///first you must call \ref init(), then you can add several source nodes
475 ///with \ref addSource().
476 ///Finally \ref start() will perform the actual path
481 ///Initializes the internal data structures.
483 ///Initializes the internal data structures.
488 _stack.resize(countNodes(*G));
490 for ( NodeIt u(*G) ; u!=INVALID ; ++u ) {
491 _pred->set(u,INVALID);
492 // _predNode->set(u,INVALID);
493 _reached->set(u,false);
494 _processed->set(u,false);
498 ///Adds a new source node.
500 ///Adds a new source node to the set of nodes to be processed.
502 ///\bug dist's are wrong (or at least strange) in case of multiple sources.
503 void addSource(Node s)
507 _reached->set(s,true);
508 _pred->set(s,INVALID);
509 // _predNode->set(u,INVALID);
510 _stack[++_stack_head]=OutEdgeIt(*G,s);
511 _dist->set(s,_stack_head);
515 ///Processes the next node.
517 ///Processes the next node.
519 ///\warning The stack must not be empty!
520 void processNextEdge()
523 Edge e=_stack[_stack_head];
524 if(!(*_reached)[m=G->target(e)]) {
526 _reached->set(m,true);
527 // _pred_node->set(m,G->source(e));
529 _stack[_stack_head] = OutEdgeIt(*G, m);
530 _dist->set(m,_stack_head);
534 while(_stack_head>=0 &&
535 (n=G->source(_stack[_stack_head]),
536 ++_stack[_stack_head]==INVALID))
538 _processed->set(n,true);
544 ///\brief Returns \c false if there are nodes
545 ///to be processed in the queue
547 ///Returns \c false if there are nodes
548 ///to be processed in the queue
549 bool emptyQueue() { return _stack_head<0; }
550 ///Returns the number of the nodes to be processed.
552 ///Returns the number of the nodes to be processed in the queue.
554 int queueSize() { return _stack_head+1; }
556 ///Executes the algorithm.
558 ///Executes the algorithm.
560 ///\pre init() must be called and at least one node should be added
561 ///with addSource() before using this function.
563 ///This method runs the %DFS algorithm from the root node(s)
566 ///%DFS path to each node. The algorithm computes
568 ///- The distance of each node from the root(s).
572 while ( !emptyQueue() ) processNextEdge();
575 ///Executes the algorithm until \c dest is reached.
577 ///Executes the algorithm until \c dest is reached.
579 ///\pre init() must be called and at least one node should be added
580 ///with addSource() before using this function.
582 ///This method runs the %DFS algorithm from the root node(s)
585 ///%DFS path to \c dest. The algorithm computes
586 ///- The %DFS path to \c dest.
587 ///- The distance of \c dest from the root(s).
589 void start(Node dest)
591 while ( !emptyQueue() && G->target(_stack[_stack_head])!=dest )
595 ///Executes the algorithm until a condition is met.
597 ///Executes the algorithm until a condition is met.
599 ///\pre init() must be called and at least one node should be added
600 ///with addSource() before using this function.
602 ///\param nm must be a bool (or convertible) edge map. The algorithm
603 ///will stop when it reaches a edge \c v with <tt>nm[v]==true</tt>.
604 ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c mn is an edge map,
607 void start(const NM &nm)
609 while ( !emptyQueue() && !nm[_stack[_stack_head]] ) processNextEdge();
612 ///Runs %DFS algorithm from node \c s.
614 ///This method runs the %DFS algorithm from a root node \c s
617 ///%DFS path to each node. The algorithm computes
619 ///- The distance of each node from the root.
621 ///\note d.run(s) is just a shortcut of the following code.
633 ///Finds the %DFS path between \c s and \c t.
635 ///Finds the %DFS path between \c s and \c t.
637 ///\return The length of the %DFS s---t path if there exists one,
639 ///\note Apart from the return value, d.run(s) is
640 ///just a shortcut of the following code.
646 int run(Node s,Node t) {
650 return reached(t)?_stack_head+1:0;
655 ///\name Query Functions
656 ///The result of the %DFS algorithm can be obtained using these
658 ///Before the use of these functions,
659 ///either run() or start() must be called.
663 ///The distance of a node from the root(s).
665 ///Returns the distance of a node from the root(s).
666 ///\pre \ref run() must be called before using this function.
667 ///\warning If node \c v in unreachable from the root(s) the return value
668 ///of this funcion is undefined.
669 int dist(Node v) const { return (*_dist)[v]; }
671 ///Returns the 'previous edge' of the %DFS tree.
673 ///For a node \c v it returns the 'previous edge'
675 ///i.e. it returns the last edge of a %DFS path from the root(s) to \c
676 ///v. It is \ref INVALID
677 ///if \c v is unreachable from the root(s) or \c v is a root. The
678 ///%DFS tree used here is equal to the %DFS tree used in
679 ///\ref predNode(Node v).
680 ///\pre Either \ref run() or \ref start() must be called before using
682 ///\todo predEdge could be a better name.
683 Edge pred(Node v) const { return (*_pred)[v];}
685 ///Returns the 'previous node' of the %DFS tree.
687 ///For a node \c v it returns the 'previous node'
689 ///i.e. it returns the last but one node from a %DFS path from the
691 ///It is INVALID if \c v is unreachable from the root(s) or
692 ///if \c v itself a root.
693 ///The %DFS tree used here is equal to the %DFS
694 ///tree used in \ref pred(Node v).
695 ///\pre Either \ref run() or \ref start() must be called before
696 ///using this function.
697 Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID:
698 G->source((*_pred)[v]); }
700 ///Returns a reference to the NodeMap of distances.
702 ///Returns a reference to the NodeMap of distances.
703 ///\pre Either \ref run() or \ref init() must
704 ///be called before using this function.
705 const DistMap &distMap() const { return *_dist;}
707 ///Returns a reference to the %DFS edge-tree map.
709 ///Returns a reference to the NodeMap of the edges of the
711 ///\pre Either \ref run() or \ref init()
712 ///must be called before using this function.
713 const PredMap &predMap() const { return *_pred;}
715 // ///Returns a reference to the map of nodes of %DFS paths.
717 // ///Returns a reference to the NodeMap of the last but one nodes of the
719 // ///\pre \ref run() must be called before using this function.
720 // const PredNodeMap &predNodeMap() const { return *_predNode;}
722 ///Checks if a node is reachable from the root.
724 ///Returns \c true if \c v is reachable from the root.
725 ///\warning The source nodes are inditated as unreached.
726 ///\pre Either \ref run() or \ref start()
727 ///must be called before using this function.
729 bool reached(Node v) { return (*_reached)[v]; }
734 ///Default traits class of Dfs function.
736 ///Default traits class of Dfs function.
737 ///\param GR Graph type.
739 struct DfsWizardDefaultTraits
741 ///The graph type the algorithm runs on.
743 ///\brief The type of the map that stores the last
744 ///edges of the %DFS paths.
746 ///The type of the map that stores the last
747 ///edges of the %DFS paths.
748 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
750 typedef NullMap<typename Graph::Node,typename GR::Edge> PredMap;
751 ///Instantiates a PredMap.
753 ///This function instantiates a \ref PredMap.
754 ///\param G is the graph, to which we would like to define the PredMap.
755 ///\todo The graph alone may be insufficient to initialize
756 static PredMap *createPredMap(const GR &G)
758 return new PredMap();
760 // ///\brief The type of the map that stores the last but one
761 // ///nodes of the %DFS paths.
763 // ///The type of the map that stores the last but one
764 // ///nodes of the %DFS paths.
765 // ///It must meet the \ref concept::WriteMap "WriteMap" concept.
767 // typedef NullMap<typename Graph::Node,typename Graph::Node> PredNodeMap;
768 // ///Instantiates a PredNodeMap.
770 // ///This function instantiates a \ref PredNodeMap.
771 // ///\param G is the graph, to which
772 // ///we would like to define the \ref PredNodeMap
773 // static PredNodeMap *createPredNodeMap(const GR &G)
775 // return new PredNodeMap();
778 ///The type of the map that indicates which nodes are processed.
780 ///The type of the map that indicates which nodes are processed.
781 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
782 ///\todo named parameter to set this type, function to read and write.
783 typedef NullMap<typename Graph::Node,bool> ProcessedMap;
784 ///Instantiates a ProcessedMap.
786 ///This function instantiates a \ref ProcessedMap.
787 ///\param G is the graph, to which
788 ///we would like to define the \ref ProcessedMap
789 static ProcessedMap *createProcessedMap(const GR &G)
791 return new ProcessedMap();
793 ///The type of the map that indicates which nodes are reached.
795 ///The type of the map that indicates which nodes are reached.
796 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
797 ///\todo named parameter to set this type, function to read and write.
798 typedef typename Graph::template NodeMap<bool> ReachedMap;
799 ///Instantiates a ReachedMap.
801 ///This function instantiates a \ref ReachedMap.
802 ///\param G is the graph, to which
803 ///we would like to define the \ref ReachedMap.
804 static ReachedMap *createReachedMap(const GR &G)
806 return new ReachedMap(G);
808 ///The type of the map that stores the dists of the nodes.
810 ///The type of the map that stores the dists of the nodes.
811 ///It must meet the \ref concept::WriteMap "WriteMap" concept.
813 typedef NullMap<typename Graph::Node,int> DistMap;
814 ///Instantiates a DistMap.
816 ///This function instantiates a \ref DistMap.
817 ///\param G is the graph, to which we would like to define the \ref DistMap
818 static DistMap *createDistMap(const GR &G)
820 return new DistMap();
824 /// Default traits used by \ref DfsWizard
826 /// To make it easier to use Dfs algorithm
827 ///we have created a wizard class.
828 /// This \ref DfsWizard class needs default traits,
829 ///as well as the \ref Dfs class.
830 /// The \ref DfsWizardBase is a class to be the default traits of the
831 /// \ref DfsWizard class.
833 class DfsWizardBase : public DfsWizardDefaultTraits<GR>
836 typedef DfsWizardDefaultTraits<GR> Base;
838 /// Type of the nodes in the graph.
839 typedef typename Base::Graph::Node Node;
841 /// Pointer to the underlying graph.
843 ///Pointer to the map of reached nodes.
845 ///Pointer to the map of processed nodes.
847 ///Pointer to the map of predecessors edges.
849 // ///Pointer to the map of predecessors nodes.
851 ///Pointer to the map of distances.
853 ///Pointer to the source node.
859 /// This constructor does not require parameters, therefore it initiates
860 /// all of the attributes to default values (0, INVALID).
861 DfsWizardBase() : _g(0), _reached(0), _processed(0), _pred(0),
863 _dist(0), _source(INVALID) {}
867 /// This constructor requires some parameters,
868 /// listed in the parameters list.
869 /// Others are initiated to 0.
870 /// \param g is the initial value of \ref _g
871 /// \param s is the initial value of \ref _source
872 DfsWizardBase(const GR &g, Node s=INVALID) :
873 _g((void *)&g), _reached(0), _processed(0), _pred(0),
875 _dist(0), _source(s) {}
879 /// A class to make the usage of Dfs algorithm easier
881 /// This class is created to make it easier to use Dfs algorithm.
882 /// It uses the functions and features of the plain \ref Dfs,
883 /// but it is much simpler to use it.
885 /// Simplicity means that the way to change the types defined
886 /// in the traits class is based on functions that returns the new class
887 /// and not on templatable built-in classes.
888 /// When using the plain \ref Dfs
889 /// the new class with the modified type comes from
890 /// the original class by using the ::
891 /// operator. In the case of \ref DfsWizard only
892 /// a function have to be called and it will
893 /// return the needed class.
895 /// It does not have own \ref run method. When its \ref run method is called
896 /// it initiates a plain \ref Dfs class, and calls the \ref Dfs::run
899 class DfsWizard : public TR
903 ///The type of the underlying graph.
904 typedef typename TR::Graph Graph;
906 typedef typename Graph::Node Node;
908 typedef typename Graph::NodeIt NodeIt;
910 typedef typename Graph::Edge Edge;
912 typedef typename Graph::OutEdgeIt OutEdgeIt;
914 ///\brief The type of the map that stores
916 typedef typename TR::ReachedMap ReachedMap;
917 ///\brief The type of the map that stores
918 ///the processed nodes
919 typedef typename TR::ProcessedMap ProcessedMap;
920 ///\brief The type of the map that stores the last
921 ///edges of the %DFS paths.
922 typedef typename TR::PredMap PredMap;
923 // ///\brief The type of the map that stores the last but one
924 // ///nodes of the %DFS paths.
925 // typedef typename TR::PredNodeMap PredNodeMap;
926 ///The type of the map that stores the dists of the nodes.
927 typedef typename TR::DistMap DistMap;
931 DfsWizard() : TR() {}
933 /// Constructor that requires parameters.
935 /// Constructor that requires parameters.
936 /// These parameters will be the default values for the traits class.
937 DfsWizard(const Graph &g, Node s=INVALID) :
941 DfsWizard(const TR &b) : TR(b) {}
945 ///Runs Dfs algorithm from a given node.
947 ///Runs Dfs algorithm from a given node.
948 ///The node can be given by the \ref source function.
951 if(Base::_source==INVALID) throw UninitializedParameter();
952 Dfs<Graph,TR> alg(*(Graph*)Base::_g);
953 if(Base::_reached) alg.reachedMap(*(ReachedMap*)Base::_reached);
954 if(Base::_processed) alg.processedMap(*(ProcessedMap*)Base::_processed);
955 if(Base::_pred) alg.predMap(*(PredMap*)Base::_pred);
956 // if(Base::_predNode) alg.predNodeMap(*(PredNodeMap*)Base::_predNode);
957 if(Base::_dist) alg.distMap(*(DistMap*)Base::_dist);
958 alg.run(Base::_source);
961 ///Runs Dfs algorithm from the given node.
963 ///Runs Dfs algorithm from the given node.
964 ///\param s is the given source.
972 struct DefPredMapBase : public Base {
974 static PredMap *createPredMap(const Graph &G) { return 0; };
975 DefPredMapBase(const Base &b) : Base(b) {}
978 ///\brief \ref named-templ-param "Named parameter"
979 ///function for setting PredMap type
981 /// \ref named-templ-param "Named parameter"
982 ///function for setting PredMap type
985 DfsWizard<DefPredMapBase<T> > predMap(const T &t)
987 Base::_pred=(void *)&t;
988 return DfsWizard<DefPredMapBase<T> >(*this);
993 struct DefReachedMapBase : public Base {
994 typedef T ReachedMap;
995 static ReachedMap *createReachedMap(const Graph &G) { return 0; };
996 DefReachedMapBase(const Base &b) : Base(b) {}
999 ///\brief \ref named-templ-param "Named parameter"
1000 ///function for setting ReachedMap
1002 /// \ref named-templ-param "Named parameter"
1003 ///function for setting ReachedMap
1006 DfsWizard<DefReachedMapBase<T> > reachedMap(const T &t)
1008 Base::_pred=(void *)&t;
1009 return DfsWizard<DefReachedMapBase<T> >(*this);
1014 struct DefProcessedMapBase : public Base {
1015 typedef T ProcessedMap;
1016 static ProcessedMap *createProcessedMap(const Graph &G) { return 0; };
1017 DefProcessedMapBase(const Base &b) : Base(b) {}
1020 ///\brief \ref named-templ-param "Named parameter"
1021 ///function for setting ProcessedMap
1023 /// \ref named-templ-param "Named parameter"
1024 ///function for setting ProcessedMap
1027 DfsWizard<DefProcessedMapBase<T> > processedMap(const T &t)
1029 Base::_pred=(void *)&t;
1030 return DfsWizard<DefProcessedMapBase<T> >(*this);
1034 // template<class T>
1035 // struct DefPredNodeMapBase : public Base {
1036 // typedef T PredNodeMap;
1037 // static PredNodeMap *createPredNodeMap(const Graph &G) { return 0; };
1038 // DefPredNodeMapBase(const Base &b) : Base(b) {}
1041 // ///\brief \ref named-templ-param "Named parameter"
1042 // ///function for setting PredNodeMap type
1044 // /// \ref named-templ-param "Named parameter"
1045 // ///function for setting PredNodeMap type
1047 // template<class T>
1048 // DfsWizard<DefPredNodeMapBase<T> > predNodeMap(const T &t)
1050 // Base::_predNode=(void *)&t;
1051 // return DfsWizard<DefPredNodeMapBase<T> >(*this);
1055 struct DefDistMapBase : public Base {
1057 static DistMap *createDistMap(const Graph &G) { return 0; };
1058 DefDistMapBase(const Base &b) : Base(b) {}
1061 ///\brief \ref named-templ-param "Named parameter"
1062 ///function for setting DistMap type
1064 /// \ref named-templ-param "Named parameter"
1065 ///function for setting DistMap type
1068 DfsWizard<DefDistMapBase<T> > distMap(const T &t)
1070 Base::_dist=(void *)&t;
1071 return DfsWizard<DefDistMapBase<T> >(*this);
1074 /// Sets the source node, from which the Dfs algorithm runs.
1076 /// Sets the source node, from which the Dfs algorithm runs.
1077 /// \param s is the source node.
1078 DfsWizard<TR> &source(Node s)
1086 ///Function type interface for Dfs algorithm.
1088 /// \ingroup flowalgs
1089 ///Function type interface for Dfs algorithm.
1091 ///This function also has several
1092 ///\ref named-templ-func-param "named parameters",
1093 ///they are declared as the members of class \ref DfsWizard.
1095 ///example shows how to use these parameters.
1097 /// dfs(g,source).predMap(preds).run();
1099 ///\warning Don't forget to put the \ref DfsWizard::run() "run()"
1100 ///to the end of the parameter list.
1104 DfsWizard<DfsWizardBase<GR> >
1105 dfs(const GR &g,typename GR::Node s=INVALID)
1107 return DfsWizard<DfsWizardBase<GR> >(g,s);
1110 } //END OF NAMESPACE LEMON