alpar@906: /* -*- C++ -*- alpar@906: * alpar@1956: * This file is a part of LEMON, a generic C++ optimization library alpar@1956: * alpar@2553: * Copyright (C) 2003-2008 alpar@1956: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport alpar@1359: * (Egervary Research Group on Combinatorial Optimization, EGRES). alpar@906: * alpar@906: * Permission to use, modify and distribute this software is granted alpar@906: * provided that this copyright notice appears in all copies. For alpar@906: * precise terms see the accompanying LICENSE file. alpar@906: * alpar@906: * This software is provided "AS IS" with no warranty of any kind, alpar@906: * express or implied, and with no claim as to its suitability for any alpar@906: * purpose. alpar@906: * alpar@906: */ alpar@906: alpar@921: #ifndef LEMON_DFS_H alpar@921: #define LEMON_DFS_H alpar@780: deba@2376: ///\ingroup search alpar@780: ///\file alpar@1218: ///\brief Dfs algorithm. alpar@780: alpar@1218: #include klao@946: #include deba@2335: #include deba@1993: #include alpar@1218: #include alpar@1218: #include alpar@780: deba@1749: #include deba@1749: alpar@921: namespace lemon { alpar@780: alpar@1218: alpar@1218: ///Default traits class of Dfs class. alpar@1218: alpar@1218: ///Default traits class of Dfs class. alpar@1218: ///\param GR Graph type. alpar@1218: template alpar@1218: struct DfsDefaultTraits alpar@1218: { alpar@1218: ///The graph type the algorithm runs on. alpar@1218: typedef GR Graph; alpar@1218: ///\brief The type of the map that stores the last alpar@1218: ///edges of the %DFS paths. alpar@1218: /// alpar@1218: ///The type of the map that stores the last alpar@1218: ///edges of the %DFS paths. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: /// alpar@1218: typedef typename Graph::template NodeMap PredMap; alpar@1218: ///Instantiates a PredMap. alpar@1218: alpar@1218: ///This function instantiates a \ref PredMap. alpar@1218: ///\param G is the graph, to which we would like to define the PredMap. alpar@1218: ///\todo The graph alone may be insufficient to initialize alpar@1218: static PredMap *createPredMap(const GR &G) alpar@1218: { alpar@1218: return new PredMap(G); alpar@1218: } alpar@1218: alpar@1218: ///The type of the map that indicates which nodes are processed. alpar@1218: alpar@1218: ///The type of the map that indicates which nodes are processed. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: ///\todo named parameter to set this type, function to read and write. alpar@1218: typedef NullMap ProcessedMap; alpar@1218: ///Instantiates a ProcessedMap. alpar@1218: alpar@1218: ///This function instantiates a \ref ProcessedMap. alpar@1536: ///\param g is the graph, to which alpar@1218: ///we would like to define the \ref ProcessedMap alpar@1536: #ifdef DOXYGEN alpar@1536: static ProcessedMap *createProcessedMap(const GR &g) alpar@1536: #else alpar@1367: static ProcessedMap *createProcessedMap(const GR &) alpar@1536: #endif alpar@1218: { alpar@1218: return new ProcessedMap(); alpar@1218: } alpar@1218: ///The type of the map that indicates which nodes are reached. alpar@1218: alpar@1218: ///The type of the map that indicates which nodes are reached. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: ///\todo named parameter to set this type, function to read and write. alpar@1218: typedef typename Graph::template NodeMap ReachedMap; alpar@1218: ///Instantiates a ReachedMap. alpar@1218: alpar@1218: ///This function instantiates a \ref ReachedMap. alpar@1218: ///\param G is the graph, to which alpar@1218: ///we would like to define the \ref ReachedMap. alpar@1218: static ReachedMap *createReachedMap(const GR &G) alpar@1218: { alpar@1218: return new ReachedMap(G); alpar@1218: } alpar@1218: ///The type of the map that stores the dists of the nodes. alpar@1218: alpar@1218: ///The type of the map that stores the dists of the nodes. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: /// alpar@1218: typedef typename Graph::template NodeMap DistMap; alpar@1218: ///Instantiates a DistMap. alpar@1218: alpar@1218: ///This function instantiates a \ref DistMap. alpar@1218: ///\param G is the graph, to which we would like to define the \ref DistMap alpar@1218: static DistMap *createDistMap(const GR &G) alpar@1218: { alpar@1218: return new DistMap(G); alpar@1218: } alpar@1218: }; alpar@1218: alpar@781: ///%DFS algorithm class. alpar@1218: deba@2376: ///\ingroup search alpar@1218: ///This class provides an efficient implementation of the %DFS algorithm. alpar@780: /// alpar@1218: ///\param GR The graph type the algorithm runs on. The default value is alpar@1218: ///\ref ListGraph. The value of GR is not used directly by Dfs, it alpar@1218: ///is only passed to \ref DfsDefaultTraits. alpar@1218: ///\param TR Traits class to set various data types used by the algorithm. alpar@1218: ///The default traits class is alpar@1218: ///\ref DfsDefaultTraits "DfsDefaultTraits". alpar@1218: ///See \ref DfsDefaultTraits for the documentation of alpar@1218: ///a Dfs traits class. alpar@780: /// alpar@1218: ///\author Jacint Szabo and Alpar Juttner alpar@780: #ifdef DOXYGEN alpar@1218: template alpar@780: #else alpar@1218: template > alpar@780: #endif alpar@1218: class Dfs { alpar@780: public: alpar@1218: /** alpar@1218: * \brief \ref Exception for uninitialized parameters. alpar@1218: * alpar@1218: * This error represents problems in the initialization alpar@1218: * of the parameters of the algorithms. alpar@1218: */ alpar@1218: class UninitializedParameter : public lemon::UninitializedParameter { alpar@1218: public: alpar@2151: virtual const char* what() const throw() { alpar@1218: return "lemon::Dfs::UninitializedParameter"; alpar@1218: } alpar@1218: }; alpar@1218: alpar@1218: typedef TR Traits; alpar@780: ///The type of the underlying graph. alpar@1218: typedef typename TR::Graph Graph; alpar@911: ///\e alpar@780: typedef typename Graph::Node Node; alpar@911: ///\e alpar@780: typedef typename Graph::NodeIt NodeIt; alpar@911: ///\e alpar@780: typedef typename Graph::Edge Edge; alpar@911: ///\e alpar@780: typedef typename Graph::OutEdgeIt OutEdgeIt; alpar@780: alpar@780: ///\brief The type of the map that stores the last alpar@1218: ///edges of the %DFS paths. alpar@1218: typedef typename TR::PredMap PredMap; alpar@1218: ///The type of the map indicating which nodes are reached. alpar@1218: typedef typename TR::ReachedMap ReachedMap; alpar@1218: ///The type of the map indicating which nodes are processed. alpar@1218: typedef typename TR::ProcessedMap ProcessedMap; alpar@1218: ///The type of the map that stores the dists of the nodes. alpar@1218: typedef typename TR::DistMap DistMap; alpar@780: private: alpar@802: /// Pointer to the underlying graph. alpar@780: const Graph *G; alpar@802: ///Pointer to the map of predecessors edges. alpar@1218: PredMap *_pred; alpar@1218: ///Indicates if \ref _pred is locally allocated (\c true) or not. alpar@1218: bool local_pred; alpar@802: ///Pointer to the map of distances. alpar@1218: DistMap *_dist; alpar@1218: ///Indicates if \ref _dist is locally allocated (\c true) or not. alpar@1218: bool local_dist; alpar@1218: ///Pointer to the map of reached status of the nodes. alpar@1218: ReachedMap *_reached; alpar@1218: ///Indicates if \ref _reached is locally allocated (\c true) or not. alpar@1218: bool local_reached; alpar@1218: ///Pointer to the map of processed status of the nodes. alpar@1218: ProcessedMap *_processed; alpar@1218: ///Indicates if \ref _processed is locally allocated (\c true) or not. alpar@1218: bool local_processed; alpar@780: alpar@1218: std::vector _stack; alpar@1218: int _stack_head; alpar@780: alpar@1218: ///Creates the maps if necessary. alpar@1218: alpar@1218: ///\todo Better memory allocation (instead of new). alpar@1218: void create_maps() alpar@780: { alpar@1218: if(!_pred) { alpar@1218: local_pred = true; alpar@1218: _pred = Traits::createPredMap(*G); alpar@780: } alpar@1218: if(!_dist) { alpar@1218: local_dist = true; alpar@1218: _dist = Traits::createDistMap(*G); alpar@780: } alpar@1218: if(!_reached) { alpar@1218: local_reached = true; alpar@1218: _reached = Traits::createReachedMap(*G); alpar@1218: } alpar@1218: if(!_processed) { alpar@1218: local_processed = true; alpar@1218: _processed = Traits::createProcessedMap(*G); alpar@780: } alpar@780: } deba@1710: deba@1710: protected: deba@1710: deba@1710: Dfs() {} alpar@780: deba@1710: public: deba@1709: deba@1709: typedef Dfs Create; deba@1709: alpar@1218: ///\name Named template parameters alpar@1218: alpar@1218: ///@{ alpar@1218: alpar@1218: template alpar@1218: struct DefPredMapTraits : public Traits { alpar@1218: typedef T PredMap; alpar@1218: static PredMap *createPredMap(const Graph &G) alpar@1218: { alpar@1218: throw UninitializedParameter(); alpar@1218: } alpar@1218: }; deba@2490: ///\brief \ref named-templ-param "Named parameter" for setting deba@2490: ///PredMap type deba@2490: /// alpar@1218: ///\ref named-templ-param "Named parameter" for setting PredMap type alpar@1218: /// alpar@1218: template deba@1709: struct DefPredMap : public Dfs > { deba@1709: typedef Dfs > Create; deba@1709: }; alpar@1218: alpar@1218: alpar@1218: template alpar@1218: struct DefDistMapTraits : public Traits { alpar@1218: typedef T DistMap; deba@2092: static DistMap *createDistMap(const Graph &) alpar@1218: { alpar@1218: throw UninitializedParameter(); alpar@1218: } alpar@1218: }; deba@2490: ///\brief \ref named-templ-param "Named parameter" for setting deba@2490: ///DistMap type alpar@1218: /// deba@2490: ///\ref named-templ-param "Named parameter" for setting DistMap deba@2490: ///type alpar@1218: template deba@1709: struct DefDistMap { deba@1709: typedef Dfs > Create; deba@1709: }; alpar@1218: alpar@1218: template alpar@1218: struct DefReachedMapTraits : public Traits { alpar@1218: typedef T ReachedMap; deba@2092: static ReachedMap *createReachedMap(const Graph &) alpar@1218: { alpar@1218: throw UninitializedParameter(); alpar@1218: } alpar@1218: }; deba@2490: ///\brief \ref named-templ-param "Named parameter" for setting deba@2490: ///ReachedMap type deba@2490: /// alpar@1218: ///\ref named-templ-param "Named parameter" for setting ReachedMap type alpar@1218: /// alpar@1218: template deba@1749: struct DefReachedMap : public Dfs< Graph, DefReachedMapTraits > { deba@1709: typedef Dfs< Graph, DefReachedMapTraits > Create; alpar@1218: }; deba@1709: alpar@1218: template alpar@1218: struct DefProcessedMapTraits : public Traits { alpar@1218: typedef T ProcessedMap; deba@2092: static ProcessedMap *createProcessedMap(const Graph &) alpar@1218: { alpar@1218: throw UninitializedParameter(); alpar@1218: } alpar@1218: }; deba@2490: ///\brief \ref named-templ-param "Named parameter" for setting deba@2490: ///ProcessedMap type deba@2490: /// alpar@1218: ///\ref named-templ-param "Named parameter" for setting ProcessedMap type alpar@1218: /// alpar@1218: template deba@1694: struct DefProcessedMap : public Dfs< Graph, DefProcessedMapTraits > { deba@1709: typedef Dfs< Graph, DefProcessedMapTraits > Create; deba@1694: }; alpar@1218: alpar@1218: struct DefGraphProcessedMapTraits : public Traits { alpar@1218: typedef typename Graph::template NodeMap ProcessedMap; alpar@1218: static ProcessedMap *createProcessedMap(const Graph &G) alpar@1218: { alpar@1218: return new ProcessedMap(G); alpar@1218: } alpar@1218: }; alpar@1218: ///\brief \ref named-templ-param "Named parameter" alpar@1218: ///for setting the ProcessedMap type to be Graph::NodeMap. alpar@1218: /// alpar@1218: ///\ref named-templ-param "Named parameter" alpar@1218: ///for setting the ProcessedMap type to be Graph::NodeMap. alpar@1218: ///If you don't set it explicitely, it will be automatically allocated. alpar@1218: template alpar@1218: class DefProcessedMapToBeDefaultMap : deba@1709: public Dfs< Graph, DefGraphProcessedMapTraits> { deba@1709: typedef Dfs< Graph, DefGraphProcessedMapTraits> Create; deba@1709: }; alpar@1218: alpar@1218: ///@} alpar@1218: alpar@1218: public: alpar@1218: alpar@802: ///Constructor. alpar@802: alpar@802: ///\param _G the graph the algorithm will run on. alpar@911: /// alpar@780: Dfs(const Graph& _G) : alpar@780: G(&_G), alpar@1218: _pred(NULL), local_pred(false), alpar@1218: _dist(NULL), local_dist(false), alpar@1218: _reached(NULL), local_reached(false), alpar@1218: _processed(NULL), local_processed(false) alpar@780: { } alpar@780: alpar@802: ///Destructor. alpar@780: ~Dfs() alpar@780: { alpar@1218: if(local_pred) delete _pred; alpar@1218: if(local_dist) delete _dist; alpar@1218: if(local_reached) delete _reached; alpar@1218: if(local_processed) delete _processed; alpar@780: } alpar@780: alpar@780: ///Sets the map storing the predecessor edges. alpar@780: alpar@780: ///Sets the map storing the predecessor edges. alpar@780: ///If you don't use this function before calling \ref run(), alpar@780: ///it will allocate one. The destuctor deallocates this alpar@780: ///automatically allocated map, of course. alpar@780: ///\return (*this) alpar@1218: Dfs &predMap(PredMap &m) alpar@780: { alpar@1218: if(local_pred) { alpar@1218: delete _pred; alpar@1218: local_pred=false; alpar@780: } alpar@1218: _pred = &m; alpar@780: return *this; alpar@780: } alpar@780: alpar@780: ///Sets the map storing the distances calculated by the algorithm. alpar@780: alpar@780: ///Sets the map storing the distances calculated by the algorithm. alpar@780: ///If you don't use this function before calling \ref run(), alpar@780: ///it will allocate one. The destuctor deallocates this alpar@780: ///automatically allocated map, of course. alpar@780: ///\return (*this) alpar@1218: Dfs &distMap(DistMap &m) alpar@780: { alpar@1218: if(local_dist) { alpar@1218: delete _dist; alpar@1218: local_dist=false; alpar@780: } alpar@1218: _dist = &m; alpar@780: return *this; alpar@780: } alpar@780: alpar@1220: ///Sets the map indicating if a node is reached. alpar@1220: alpar@1220: ///Sets the map indicating if a node is reached. alpar@1220: ///If you don't use this function before calling \ref run(), alpar@1220: ///it will allocate one. The destuctor deallocates this alpar@1220: ///automatically allocated map, of course. alpar@1220: ///\return (*this) alpar@1220: Dfs &reachedMap(ReachedMap &m) alpar@1220: { alpar@1220: if(local_reached) { alpar@1220: delete _reached; alpar@1220: local_reached=false; alpar@1220: } alpar@1220: _reached = &m; alpar@1220: return *this; alpar@1220: } alpar@1220: alpar@1220: ///Sets the map indicating if a node is processed. alpar@1220: alpar@1220: ///Sets the map indicating if a node is processed. alpar@1220: ///If you don't use this function before calling \ref run(), alpar@1220: ///it will allocate one. The destuctor deallocates this alpar@1220: ///automatically allocated map, of course. alpar@1220: ///\return (*this) alpar@1220: Dfs &processedMap(ProcessedMap &m) alpar@1220: { alpar@1220: if(local_processed) { alpar@1220: delete _processed; alpar@1220: local_processed=false; alpar@1220: } alpar@1220: _processed = &m; alpar@1220: return *this; alpar@1220: } alpar@1220: alpar@1218: public: alpar@1218: ///\name Execution control alpar@1218: ///The simplest way to execute the algorithm is to use alpar@1218: ///one of the member functions called \c run(...). alpar@1218: ///\n alpar@1218: ///If you need more control on the execution, deba@1761: ///first you must call \ref init(), then you can add a source node alpar@1218: ///with \ref addSource(). alpar@1218: ///Finally \ref start() will perform the actual path alpar@1218: ///computation. alpar@1218: alpar@1218: ///@{ alpar@1218: alpar@1218: ///Initializes the internal data structures. alpar@1218: alpar@1218: ///Initializes the internal data structures. alpar@1218: /// alpar@1218: void init() alpar@1218: { alpar@1218: create_maps(); alpar@1218: _stack.resize(countNodes(*G)); alpar@1218: _stack_head=-1; alpar@780: for ( NodeIt u(*G) ; u!=INVALID ; ++u ) { alpar@1218: _pred->set(u,INVALID); alpar@1218: // _predNode->set(u,INVALID); alpar@1218: _reached->set(u,false); alpar@1218: _processed->set(u,false); alpar@780: } alpar@780: } alpar@780: alpar@1218: ///Adds a new source node. alpar@780: alpar@1218: ///Adds a new source node to the set of nodes to be processed. alpar@1218: /// alpar@1874: ///\warning dists are wrong (or at least strange) alpar@1874: ///in case of multiple sources. alpar@1218: void addSource(Node s) alpar@1218: { alpar@1218: if(!(*_reached)[s]) alpar@1218: { alpar@1218: _reached->set(s,true); alpar@1218: _pred->set(s,INVALID); alpar@1664: OutEdgeIt e(*G,s); alpar@1666: if(e!=INVALID) { alpar@1666: _stack[++_stack_head]=e; alpar@1666: _dist->set(s,_stack_head); alpar@1666: } alpar@1666: else { alpar@1666: _processed->set(s,true); alpar@1666: _dist->set(s,0); alpar@1666: } alpar@1218: } alpar@1218: } alpar@1218: deba@1529: ///Processes the next edge. alpar@1218: deba@1529: ///Processes the next edge. alpar@1218: /// alpar@1516: ///\return The processed edge. alpar@1516: /// athos@1443: ///\pre The stack must not be empty! alpar@1516: Edge processNextEdge() alpar@1218: { alpar@1218: Node m; alpar@1218: Edge e=_stack[_stack_head]; alpar@1218: if(!(*_reached)[m=G->target(e)]) { alpar@1218: _pred->set(m,e); alpar@1218: _reached->set(m,true); alpar@1233: ++_stack_head; alpar@1233: _stack[_stack_head] = OutEdgeIt(*G, m); alpar@1218: _dist->set(m,_stack_head); alpar@1218: } alpar@1218: else { alpar@1663: m=G->source(e); alpar@1663: ++_stack[_stack_head]; alpar@1663: } alpar@1663: while(_stack_head>=0 && _stack[_stack_head]==INVALID) { alpar@1663: _processed->set(m,true); alpar@1663: --_stack_head; alpar@1663: if(_stack_head>=0) { alpar@1663: m=G->source(_stack[_stack_head]); alpar@1663: ++_stack[_stack_head]; alpar@1663: } alpar@1218: } alpar@1516: return e; alpar@1218: } alpar@1665: ///Next edge to be processed. alpar@1665: alpar@1665: ///Next edge to be processed. alpar@1665: /// alpar@1665: ///\return The next edge to be processed or INVALID if the stack is alpar@1665: /// empty. deba@1694: OutEdgeIt nextEdge() alpar@1665: { alpar@1665: return _stack_head>=0?_stack[_stack_head]:INVALID; alpar@1665: } deba@1694: alpar@1218: ///\brief Returns \c false if there are nodes alpar@1218: ///to be processed in the queue alpar@1218: /// alpar@1218: ///Returns \c false if there are nodes alpar@1218: ///to be processed in the queue alpar@1218: bool emptyQueue() { return _stack_head<0; } alpar@1218: ///Returns the number of the nodes to be processed. alpar@1218: alpar@1218: ///Returns the number of the nodes to be processed in the queue. alpar@1218: int queueSize() { return _stack_head+1; } alpar@1218: alpar@1218: ///Executes the algorithm. alpar@1218: alpar@1218: ///Executes the algorithm. alpar@1218: /// alpar@1218: ///\pre init() must be called and at least one node should be added alpar@1218: ///with addSource() before using this function. alpar@1218: /// alpar@1218: ///This method runs the %DFS algorithm from the root node(s) alpar@1218: ///in order to alpar@1218: ///compute the alpar@1218: ///%DFS path to each node. The algorithm computes alpar@1218: ///- The %DFS tree. athos@1443: ///- The distance of each node from the root(s) in the %DFS tree. alpar@1218: /// alpar@1218: void start() alpar@1218: { alpar@1218: while ( !emptyQueue() ) processNextEdge(); alpar@1218: } alpar@1218: alpar@1218: ///Executes the algorithm until \c dest is reached. alpar@1218: alpar@1218: ///Executes the algorithm until \c dest is reached. alpar@1218: /// alpar@1218: ///\pre init() must be called and at least one node should be added alpar@1218: ///with addSource() before using this function. alpar@1218: /// alpar@1218: ///This method runs the %DFS algorithm from the root node(s) alpar@1218: ///in order to alpar@1218: ///compute the alpar@1218: ///%DFS path to \c dest. The algorithm computes alpar@1218: ///- The %DFS path to \c dest. athos@1443: ///- The distance of \c dest from the root(s) in the %DFS tree. alpar@1218: /// alpar@1218: void start(Node dest) alpar@1218: { alpar@1233: while ( !emptyQueue() && G->target(_stack[_stack_head])!=dest ) alpar@1233: processNextEdge(); alpar@1218: } alpar@1218: alpar@1218: ///Executes the algorithm until a condition is met. alpar@1218: alpar@1218: ///Executes the algorithm until a condition is met. alpar@1218: /// alpar@1218: ///\pre init() must be called and at least one node should be added alpar@1218: ///with addSource() before using this function. alpar@1218: /// deba@1865: ///\param em must be a bool (or convertible) edge map. The algorithm kpeter@2476: ///will stop when it reaches an edge \c e with em[e] true. athos@1443: /// kpeter@2476: ///\return The reached edge \c e with em[e] true or deba@2439: ///\c INVALID if no such edge was found. deba@2439: /// deba@2439: ///\warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map, alpar@1233: ///not a node map. deba@1749: template deba@2439: Edge start(const EM &em) deba@1749: { deba@2439: while ( !emptyQueue() && !em[_stack[_stack_head]] ) deba@2439: processNextEdge(); deba@2439: return emptyQueue() ? INVALID : _stack[_stack_head]; deba@1749: } deba@1749: deba@1981: ///Runs %DFS algorithm to visit all nodes in the graph. deba@1981: deba@1981: ///This method runs the %DFS algorithm in order to deba@1981: ///compute the deba@1981: ///%DFS path to each node. The algorithm computes deba@1981: ///- The %DFS tree. deba@1981: ///- The distance of each node from the root in the %DFS tree. deba@1981: /// deba@1981: ///\note d.run() is just a shortcut of the following code. deba@1981: ///\code deba@1981: /// d.init(); deba@1981: /// for (NodeIt it(graph); it != INVALID; ++it) { deba@1981: /// if (!d.reached(it)) { deba@1981: /// d.addSource(it); deba@1981: /// d.start(); deba@1981: /// } deba@1981: /// } deba@1981: ///\endcode deba@1981: void run() { deba@1981: init(); deba@1981: for (NodeIt it(*G); it != INVALID; ++it) { deba@1981: if (!reached(it)) { deba@1981: addSource(it); deba@1981: start(); deba@1981: } deba@1981: } deba@1981: } deba@1981: alpar@1218: ///Runs %DFS algorithm from node \c s. alpar@1218: alpar@1218: ///This method runs the %DFS algorithm from a root node \c s alpar@1218: ///in order to alpar@1218: ///compute the alpar@1218: ///%DFS path to each node. The algorithm computes alpar@1218: ///- The %DFS tree. athos@1443: ///- The distance of each node from the root in the %DFS tree. alpar@1218: /// alpar@1218: ///\note d.run(s) is just a shortcut of the following code. alpar@1218: ///\code alpar@1218: /// d.init(); alpar@1218: /// d.addSource(s); alpar@1218: /// d.start(); alpar@1218: ///\endcode alpar@1218: void run(Node s) { alpar@1218: init(); alpar@1218: addSource(s); alpar@1218: start(); alpar@1218: } alpar@1218: alpar@1218: ///Finds the %DFS path between \c s and \c t. alpar@1218: alpar@1218: ///Finds the %DFS path between \c s and \c t. alpar@1218: /// alpar@1218: ///\return The length of the %DFS s---t path if there exists one, alpar@1218: ///0 otherwise. athos@1540: ///\note Apart from the return value, d.run(s,t) is alpar@1218: ///just a shortcut of the following code. alpar@1218: ///\code alpar@1218: /// d.init(); alpar@1218: /// d.addSource(s); alpar@1218: /// d.start(t); alpar@1218: ///\endcode alpar@1218: int run(Node s,Node t) { alpar@1218: init(); alpar@1218: addSource(s); alpar@1218: start(t); alpar@1233: return reached(t)?_stack_head+1:0; alpar@1218: } alpar@1218: alpar@1218: ///@} alpar@1218: alpar@1218: ///\name Query Functions alpar@1218: ///The result of the %DFS algorithm can be obtained using these alpar@1218: ///functions.\n alpar@1218: ///Before the use of these functions, alpar@1218: ///either run() or start() must be called. alpar@1218: alpar@1218: ///@{ alpar@1218: deba@2335: typedef PredMapPath Path; deba@2335: deba@2335: ///Gives back the shortest path. alpar@1283: deba@2335: ///Gives back the shortest path. deba@2335: ///\pre The \c t should be reachable from the source. deba@2335: Path path(Node t) alpar@1283: { deba@2335: return Path(*G, *_pred, t); alpar@1283: } alpar@1283: alpar@1218: ///The distance of a node from the root(s). alpar@1218: alpar@1218: ///Returns the distance of a node from the root(s). alpar@780: ///\pre \ref run() must be called before using this function. deba@1981: ///\warning If node \c v is unreachable from the root(s) then the return deba@1981: ///value of this funcion is undefined. alpar@1218: int dist(Node v) const { return (*_dist)[v]; } alpar@780: alpar@1218: ///Returns the 'previous edge' of the %DFS tree. alpar@780: alpar@1218: ///For a node \c v it returns the 'previous edge' alpar@1218: ///of the %DFS path, alpar@1218: ///i.e. it returns the last edge of a %DFS path from the root(s) to \c alpar@780: ///v. It is \ref INVALID alpar@1218: ///if \c v is unreachable from the root(s) or \c v is a root. The alpar@781: ///%DFS tree used here is equal to the %DFS tree used in alpar@1631: ///\ref predNode(). alpar@1218: ///\pre Either \ref run() or \ref start() must be called before using alpar@780: ///this function. deba@1763: Edge predEdge(Node v) const { return (*_pred)[v];} alpar@780: alpar@781: ///Returns the 'previous node' of the %DFS tree. alpar@780: alpar@1218: ///For a node \c v it returns the 'previous node' alpar@1218: ///of the %DFS tree, alpar@1218: ///i.e. it returns the last but one node from a %DFS path from the alpar@2156: ///root(s) to \c v. alpar@1218: ///It is INVALID if \c v is unreachable from the root(s) or alpar@1218: ///if \c v itself a root. alpar@1218: ///The %DFS tree used here is equal to the %DFS deba@1763: ///tree used in \ref predEdge(). alpar@1218: ///\pre Either \ref run() or \ref start() must be called before alpar@780: ///using this function. alpar@1218: Node predNode(Node v) const { return (*_pred)[v]==INVALID ? INVALID: alpar@1218: G->source((*_pred)[v]); } alpar@780: alpar@1218: ///Returns a reference to the NodeMap of distances. alpar@1218: alpar@1218: ///Returns a reference to the NodeMap of distances. alpar@1218: ///\pre Either \ref run() or \ref init() must alpar@780: ///be called before using this function. alpar@1218: const DistMap &distMap() const { return *_dist;} alpar@780: alpar@1218: ///Returns a reference to the %DFS edge-tree map. alpar@780: alpar@780: ///Returns a reference to the NodeMap of the edges of the alpar@781: ///%DFS tree. alpar@1218: ///\pre Either \ref run() or \ref init() alpar@1218: ///must be called before using this function. alpar@1218: const PredMap &predMap() const { return *_pred;} alpar@780: alpar@780: ///Checks if a node is reachable from the root. alpar@780: athos@1438: ///Returns \c true if \c v is reachable from the root(s). athos@1438: ///\warning The source nodes are inditated as unreachable. alpar@1218: ///\pre Either \ref run() or \ref start() alpar@1218: ///must be called before using this function. alpar@780: /// alpar@1218: bool reached(Node v) { return (*_reached)[v]; } alpar@1218: alpar@1218: ///@} alpar@1218: }; alpar@1218: alpar@1218: ///Default traits class of Dfs function. alpar@1218: alpar@1218: ///Default traits class of Dfs function. alpar@1218: ///\param GR Graph type. alpar@1218: template alpar@1218: struct DfsWizardDefaultTraits alpar@1218: { alpar@1218: ///The graph type the algorithm runs on. alpar@1218: typedef GR Graph; alpar@1218: ///\brief The type of the map that stores the last alpar@1218: ///edges of the %DFS paths. alpar@1218: /// alpar@1218: ///The type of the map that stores the last alpar@1218: ///edges of the %DFS paths. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@780: /// alpar@1218: typedef NullMap PredMap; alpar@1218: ///Instantiates a PredMap. alpar@1218: alpar@1218: ///This function instantiates a \ref PredMap. alpar@1536: ///\param g is the graph, to which we would like to define the PredMap. alpar@1218: ///\todo The graph alone may be insufficient to initialize alpar@1536: #ifdef DOXYGEN alpar@1536: static PredMap *createPredMap(const GR &g) alpar@1536: #else alpar@1367: static PredMap *createPredMap(const GR &) alpar@1536: #endif alpar@1218: { alpar@1218: return new PredMap(); alpar@1218: } alpar@1218: alpar@1218: ///The type of the map that indicates which nodes are processed. alpar@1218: alpar@1218: ///The type of the map that indicates which nodes are processed. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: ///\todo named parameter to set this type, function to read and write. alpar@1218: typedef NullMap ProcessedMap; alpar@1218: ///Instantiates a ProcessedMap. alpar@1218: alpar@1218: ///This function instantiates a \ref ProcessedMap. alpar@1536: ///\param g is the graph, to which alpar@1218: ///we would like to define the \ref ProcessedMap alpar@1536: #ifdef DOXYGEN alpar@1536: static ProcessedMap *createProcessedMap(const GR &g) alpar@1536: #else alpar@1367: static ProcessedMap *createProcessedMap(const GR &) alpar@1536: #endif alpar@1218: { alpar@1218: return new ProcessedMap(); alpar@1218: } alpar@1218: ///The type of the map that indicates which nodes are reached. alpar@1218: alpar@1218: ///The type of the map that indicates which nodes are reached. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: ///\todo named parameter to set this type, function to read and write. alpar@1218: typedef typename Graph::template NodeMap ReachedMap; alpar@1218: ///Instantiates a ReachedMap. alpar@1218: alpar@1218: ///This function instantiates a \ref ReachedMap. alpar@1218: ///\param G is the graph, to which alpar@1218: ///we would like to define the \ref ReachedMap. alpar@1218: static ReachedMap *createReachedMap(const GR &G) alpar@1218: { alpar@1218: return new ReachedMap(G); alpar@1218: } alpar@1218: ///The type of the map that stores the dists of the nodes. alpar@1218: alpar@1218: ///The type of the map that stores the dists of the nodes. alpar@2260: ///It must meet the \ref concepts::WriteMap "WriteMap" concept. alpar@1218: /// alpar@1218: typedef NullMap DistMap; alpar@1218: ///Instantiates a DistMap. alpar@1218: alpar@1218: ///This function instantiates a \ref DistMap. alpar@1536: ///\param g is the graph, to which we would like to define the \ref DistMap alpar@1536: #ifdef DOXYGEN alpar@1536: static DistMap *createDistMap(const GR &g) alpar@1536: #else alpar@1367: static DistMap *createDistMap(const GR &) alpar@1536: #endif alpar@1218: { alpar@1218: return new DistMap(); alpar@1218: } alpar@1218: }; alpar@1218: alpar@1218: /// Default traits used by \ref DfsWizard alpar@1218: alpar@1218: /// To make it easier to use Dfs algorithm alpar@1218: ///we have created a wizard class. alpar@1218: /// This \ref DfsWizard class needs default traits, alpar@1218: ///as well as the \ref Dfs class. alpar@1218: /// The \ref DfsWizardBase is a class to be the default traits of the alpar@1218: /// \ref DfsWizard class. alpar@1218: template alpar@1218: class DfsWizardBase : public DfsWizardDefaultTraits alpar@1218: { alpar@1218: alpar@1218: typedef DfsWizardDefaultTraits Base; alpar@1218: protected: alpar@1218: /// Type of the nodes in the graph. alpar@1218: typedef typename Base::Graph::Node Node; alpar@1218: alpar@1218: /// Pointer to the underlying graph. alpar@1218: void *_g; alpar@1218: ///Pointer to the map of reached nodes. alpar@1218: void *_reached; alpar@1218: ///Pointer to the map of processed nodes. alpar@1218: void *_processed; alpar@1218: ///Pointer to the map of predecessors edges. alpar@1218: void *_pred; alpar@1218: ///Pointer to the map of distances. alpar@1218: void *_dist; alpar@1218: ///Pointer to the source node. alpar@1218: Node _source; alpar@1218: alpar@1218: public: alpar@1218: /// Constructor. alpar@1218: alpar@1218: /// This constructor does not require parameters, therefore it initiates alpar@1218: /// all of the attributes to default values (0, INVALID). alpar@1218: DfsWizardBase() : _g(0), _reached(0), _processed(0), _pred(0), alpar@1218: _dist(0), _source(INVALID) {} alpar@1218: alpar@1218: /// Constructor. alpar@1218: alpar@1218: /// This constructor requires some parameters, alpar@1218: /// listed in the parameters list. alpar@1218: /// Others are initiated to 0. alpar@1218: /// \param g is the initial value of \ref _g alpar@1218: /// \param s is the initial value of \ref _source alpar@1218: DfsWizardBase(const GR &g, Node s=INVALID) : deba@2386: _g(reinterpret_cast(const_cast(&g))), deba@2386: _reached(0), _processed(0), _pred(0), _dist(0), _source(s) {} alpar@1218: alpar@1218: }; alpar@1218: athos@1443: /// A class to make the usage of the Dfs algorithm easier alpar@1218: athos@1443: /// This class is created to make it easier to use the Dfs algorithm. alpar@1218: /// It uses the functions and features of the plain \ref Dfs, alpar@1218: /// but it is much simpler to use it. alpar@1218: /// alpar@1218: /// Simplicity means that the way to change the types defined alpar@1218: /// in the traits class is based on functions that returns the new class alpar@1218: /// and not on templatable built-in classes. alpar@1218: /// When using the plain \ref Dfs alpar@1218: /// the new class with the modified type comes from alpar@1218: /// the original class by using the :: alpar@1218: /// operator. In the case of \ref DfsWizard only alpar@1218: /// a function have to be called and it will alpar@1218: /// return the needed class. alpar@1218: /// alpar@1218: /// It does not have own \ref run method. When its \ref run method is called athos@1438: /// it initiates a plain \ref Dfs object, and calls the \ref Dfs::run alpar@1218: /// method of it. alpar@1218: template alpar@1218: class DfsWizard : public TR alpar@1218: { alpar@1218: typedef TR Base; alpar@1218: alpar@1218: ///The type of the underlying graph. alpar@1218: typedef typename TR::Graph Graph; alpar@1218: //\e alpar@1218: typedef typename Graph::Node Node; alpar@1218: //\e alpar@1218: typedef typename Graph::NodeIt NodeIt; alpar@1218: //\e alpar@1218: typedef typename Graph::Edge Edge; alpar@1218: //\e alpar@1218: typedef typename Graph::OutEdgeIt OutEdgeIt; alpar@1218: alpar@1218: ///\brief The type of the map that stores alpar@1218: ///the reached nodes alpar@1218: typedef typename TR::ReachedMap ReachedMap; alpar@1218: ///\brief The type of the map that stores alpar@1218: ///the processed nodes alpar@1218: typedef typename TR::ProcessedMap ProcessedMap; alpar@1218: ///\brief The type of the map that stores the last alpar@1218: ///edges of the %DFS paths. alpar@1218: typedef typename TR::PredMap PredMap; athos@1443: ///The type of the map that stores the distances of the nodes. alpar@1218: typedef typename TR::DistMap DistMap; alpar@1218: deba@2019: public: alpar@1218: /// Constructor. alpar@1218: DfsWizard() : TR() {} alpar@1218: alpar@1218: /// Constructor that requires parameters. alpar@1218: alpar@1218: /// Constructor that requires parameters. alpar@1218: /// These parameters will be the default values for the traits class. alpar@1218: DfsWizard(const Graph &g, Node s=INVALID) : alpar@1218: TR(g,s) {} alpar@1218: alpar@1218: ///Copy constructor alpar@1218: DfsWizard(const TR &b) : TR(b) {} alpar@1218: alpar@1218: ~DfsWizard() {} alpar@1218: alpar@1218: ///Runs Dfs algorithm from a given node. alpar@1218: alpar@1218: ///Runs Dfs algorithm from a given node. alpar@1218: ///The node can be given by the \ref source function. alpar@1218: void run() alpar@1218: { alpar@1218: if(Base::_source==INVALID) throw UninitializedParameter(); deba@2386: Dfs alg(*reinterpret_cast(Base::_g)); deba@2386: if(Base::_reached) deba@2386: alg.reachedMap(*reinterpret_cast(Base::_reached)); deba@2386: if(Base::_processed) deba@2386: alg.processedMap(*reinterpret_cast(Base::_processed)); deba@2386: if(Base::_pred) deba@2386: alg.predMap(*reinterpret_cast(Base::_pred)); deba@2386: if(Base::_dist) deba@2386: alg.distMap(*reinterpret_cast(Base::_dist)); alpar@1218: alg.run(Base::_source); alpar@1218: } alpar@1218: alpar@1218: ///Runs Dfs algorithm from the given node. alpar@1218: alpar@1218: ///Runs Dfs algorithm from the given node. alpar@1218: ///\param s is the given source. alpar@1218: void run(Node s) alpar@1218: { alpar@1218: Base::_source=s; alpar@1218: run(); alpar@1218: } alpar@1218: alpar@1218: template alpar@1218: struct DefPredMapBase : public Base { alpar@1218: typedef T PredMap; alpar@1367: static PredMap *createPredMap(const Graph &) { return 0; }; alpar@1236: DefPredMapBase(const TR &b) : TR(b) {} alpar@1218: }; alpar@1218: alpar@1218: ///\brief \ref named-templ-param "Named parameter" alpar@1218: ///function for setting PredMap type alpar@1218: /// alpar@1218: /// \ref named-templ-param "Named parameter" alpar@1218: ///function for setting PredMap type alpar@1218: /// alpar@1218: template alpar@1218: DfsWizard > predMap(const T &t) alpar@1218: { deba@2386: Base::_pred=reinterpret_cast(const_cast(&t)); alpar@1218: return DfsWizard >(*this); alpar@1218: } alpar@1218: alpar@1218: alpar@1218: template alpar@1218: struct DefReachedMapBase : public Base { alpar@1218: typedef T ReachedMap; alpar@1367: static ReachedMap *createReachedMap(const Graph &) { return 0; }; alpar@1236: DefReachedMapBase(const TR &b) : TR(b) {} alpar@1218: }; alpar@1218: alpar@1218: ///\brief \ref named-templ-param "Named parameter" alpar@1218: ///function for setting ReachedMap alpar@1218: /// alpar@1218: /// \ref named-templ-param "Named parameter" alpar@1218: ///function for setting ReachedMap alpar@1218: /// alpar@1218: template alpar@1218: DfsWizard > reachedMap(const T &t) alpar@1218: { deba@2386: Base::_pred=reinterpret_cast(const_cast(&t)); alpar@1218: return DfsWizard >(*this); alpar@1218: } alpar@1218: alpar@1218: alpar@1218: template alpar@1218: struct DefProcessedMapBase : public Base { alpar@1218: typedef T ProcessedMap; alpar@1367: static ProcessedMap *createProcessedMap(const Graph &) { return 0; }; alpar@1236: DefProcessedMapBase(const TR &b) : TR(b) {} alpar@1218: }; alpar@1218: alpar@1218: ///\brief \ref named-templ-param "Named parameter" alpar@1218: ///function for setting ProcessedMap alpar@1218: /// alpar@1218: /// \ref named-templ-param "Named parameter" alpar@1218: ///function for setting ProcessedMap alpar@1218: /// alpar@1218: template alpar@1218: DfsWizard > processedMap(const T &t) alpar@1218: { deba@2386: Base::_pred=reinterpret_cast(const_cast(&t)); alpar@1218: return DfsWizard >(*this); alpar@1218: } alpar@1218: alpar@1218: template alpar@1218: struct DefDistMapBase : public Base { alpar@1218: typedef T DistMap; alpar@1367: static DistMap *createDistMap(const Graph &) { return 0; }; alpar@1236: DefDistMapBase(const TR &b) : TR(b) {} alpar@1218: }; alpar@1218: alpar@1218: ///\brief \ref named-templ-param "Named parameter" alpar@1218: ///function for setting DistMap type alpar@1218: /// alpar@1218: /// \ref named-templ-param "Named parameter" alpar@1218: ///function for setting DistMap type alpar@1218: /// alpar@1218: template alpar@1218: DfsWizard > distMap(const T &t) alpar@1218: { deba@2386: Base::_dist=reinterpret_cast(const_cast(&t)); alpar@1218: return DfsWizard >(*this); alpar@1218: } alpar@1218: alpar@1218: /// Sets the source node, from which the Dfs algorithm runs. alpar@1218: alpar@1218: /// Sets the source node, from which the Dfs algorithm runs. alpar@1218: /// \param s is the source node. alpar@1218: DfsWizard &source(Node s) alpar@1218: { alpar@1218: Base::_source=s; alpar@1218: return *this; alpar@1218: } alpar@780: alpar@780: }; alpar@780: alpar@1218: ///Function type interface for Dfs algorithm. alpar@1218: deba@2376: ///\ingroup search alpar@1218: ///Function type interface for Dfs algorithm. alpar@1218: /// alpar@1218: ///This function also has several alpar@1218: ///\ref named-templ-func-param "named parameters", alpar@1218: ///they are declared as the members of class \ref DfsWizard. alpar@1218: ///The following alpar@1218: ///example shows how to use these parameters. alpar@1218: ///\code alpar@1218: /// dfs(g,source).predMap(preds).run(); alpar@1218: ///\endcode alpar@1218: ///\warning Don't forget to put the \ref DfsWizard::run() "run()" alpar@1218: ///to the end of the parameter list. alpar@1218: ///\sa DfsWizard alpar@1218: ///\sa Dfs alpar@1218: template alpar@1218: DfsWizard > alpar@1218: dfs(const GR &g,typename GR::Node s=INVALID) alpar@1218: { alpar@1218: return DfsWizard >(g,s); alpar@1218: } alpar@1218: deba@1799: #ifdef DOXYGEN deba@1749: /// \brief Visitor class for dfs. deba@1749: /// deba@1749: /// It gives a simple interface for a functional interface for dfs deba@1749: /// traversal. The traversal on a linear data structure. deba@1749: template deba@1749: struct DfsVisitor { deba@1749: typedef _Graph Graph; deba@1749: typedef typename Graph::Edge Edge; deba@1749: typedef typename Graph::Node Node; deba@1749: /// \brief Called when the edge reach a node. deba@1749: /// deba@1749: /// It is called when the dfs find an edge which target is not deba@1749: /// reached yet. deba@1749: void discover(const Edge& edge) {} deba@1749: /// \brief Called when the node reached first time. deba@1749: /// deba@1749: /// It is Called when the node reached first time. deba@1749: void reach(const Node& node) {} deba@1749: /// \brief Called when we step back on an edge. deba@1749: /// deba@1749: /// It is called when the dfs should step back on the edge. deba@1749: void backtrack(const Edge& edge) {} deba@1749: /// \brief Called when we step back from the node. deba@1749: /// deba@1749: /// It is called when we step back from the node. deba@1749: void leave(const Node& node) {} deba@1749: /// \brief Called when the edge examined but target of the edge deba@1749: /// already discovered. deba@1749: /// deba@1749: /// It called when the edge examined but the target of the edge deba@1749: /// already discovered. deba@1749: void examine(const Edge& edge) {} deba@1749: /// \brief Called for the source node of the dfs. deba@1749: /// deba@1749: /// It is called for the source node of the dfs. deba@1799: void start(const Node& node) {} deba@1749: /// \brief Called when we leave the source node of the dfs. deba@1749: /// deba@1749: /// It is called when we leave the source node of the dfs. deba@1799: void stop(const Node& node) {} deba@1799: deba@1799: }; deba@1799: #else deba@1799: template deba@1799: struct DfsVisitor { deba@1799: typedef _Graph Graph; deba@1799: typedef typename Graph::Edge Edge; deba@1799: typedef typename Graph::Node Node; deba@1799: void discover(const Edge&) {} deba@1799: void reach(const Node&) {} deba@1799: void backtrack(const Edge&) {} deba@1799: void leave(const Node&) {} deba@1799: void examine(const Edge&) {} deba@1799: void start(const Node&) {} deba@1749: void stop(const Node&) {} deba@1749: deba@1749: template deba@1749: struct Constraints { deba@1749: void constraints() { deba@1749: Edge edge; deba@1749: Node node; deba@1749: visitor.discover(edge); deba@1749: visitor.reach(node); deba@1749: visitor.backtrack(edge); deba@1749: visitor.leave(node); deba@1749: visitor.examine(edge); deba@1749: visitor.start(node); deba@1749: visitor.stop(edge); deba@1749: } deba@1749: _Visitor& visitor; deba@1749: }; deba@1749: }; deba@1799: #endif deba@1749: deba@1749: /// \brief Default traits class of DfsVisit class. deba@1749: /// deba@1749: /// Default traits class of DfsVisit class. deba@1749: /// \param _Graph Graph type. deba@1749: template deba@1749: struct DfsVisitDefaultTraits { deba@1749: deba@1749: /// \brief The graph type the algorithm runs on. deba@1749: typedef _Graph Graph; deba@1749: deba@1749: /// \brief The type of the map that indicates which nodes are reached. deba@1749: /// deba@1749: /// The type of the map that indicates which nodes are reached. alpar@2260: /// It must meet the \ref concepts::WriteMap "WriteMap" concept. deba@1749: /// \todo named parameter to set this type, function to read and write. deba@1749: typedef typename Graph::template NodeMap ReachedMap; deba@1749: deba@1749: /// \brief Instantiates a ReachedMap. deba@1749: /// deba@1749: /// This function instantiates a \ref ReachedMap. deba@1865: /// \param graph is the graph, to which deba@1749: /// we would like to define the \ref ReachedMap. deba@1749: static ReachedMap *createReachedMap(const Graph &graph) { deba@1749: return new ReachedMap(graph); deba@1749: } deba@1749: deba@1749: }; deba@1749: deba@1749: /// %DFS Visit algorithm class. deba@1749: deba@2376: /// \ingroup search deba@1749: /// This class provides an efficient implementation of the %DFS algorithm deba@1749: /// with visitor interface. deba@1749: /// deba@1749: /// The %DfsVisit class provides an alternative interface to the Dfs deba@1749: /// class. It works with callback mechanism, the DfsVisit object calls deba@1749: /// on every dfs event the \c Visitor class member functions. deba@1749: /// deba@1749: /// \param _Graph The graph type the algorithm runs on. The default value is deba@1749: /// \ref ListGraph. The value of _Graph is not used directly by Dfs, it deba@1749: /// is only passed to \ref DfsDefaultTraits. deba@1749: /// \param _Visitor The Visitor object for the algorithm. The deba@1749: /// \ref DfsVisitor "DfsVisitor<_Graph>" is an empty Visitor which deba@1749: /// does not observe the Dfs events. If you want to observe the dfs deba@1749: /// events you should implement your own Visitor class. deba@1749: /// \param _Traits Traits class to set various data types used by the deba@1749: /// algorithm. The default traits class is deba@1749: /// \ref DfsVisitDefaultTraits "DfsVisitDefaultTraits<_Graph>". deba@1749: /// See \ref DfsVisitDefaultTraits for the documentation of deba@1749: /// a Dfs visit traits class. deba@1749: /// deba@1749: /// \author Jacint Szabo, Alpar Juttner and Balazs Dezso deba@1749: #ifdef DOXYGEN deba@1749: template deba@1749: #else deba@1749: template , deba@1749: typename _Traits = DfsDefaultTraits<_Graph> > deba@1749: #endif deba@1749: class DfsVisit { deba@1749: public: deba@1749: deba@1749: /// \brief \ref Exception for uninitialized parameters. deba@1749: /// deba@1749: /// This error represents problems in the initialization deba@1749: /// of the parameters of the algorithms. deba@1749: class UninitializedParameter : public lemon::UninitializedParameter { deba@1749: public: alpar@2151: virtual const char* what() const throw() alpar@2152: { deba@1749: return "lemon::DfsVisit::UninitializedParameter"; deba@1749: } deba@1749: }; deba@1749: deba@1749: typedef _Traits Traits; deba@1749: deba@1749: typedef typename Traits::Graph Graph; deba@1749: deba@1749: typedef _Visitor Visitor; deba@1749: deba@1749: ///The type of the map indicating which nodes are reached. deba@1749: typedef typename Traits::ReachedMap ReachedMap; deba@1749: deba@1749: private: deba@1749: deba@1749: typedef typename Graph::Node Node; deba@1749: typedef typename Graph::NodeIt NodeIt; deba@1749: typedef typename Graph::Edge Edge; deba@1749: typedef typename Graph::OutEdgeIt OutEdgeIt; deba@1749: deba@1749: /// Pointer to the underlying graph. deba@1749: const Graph *_graph; deba@1749: /// Pointer to the visitor object. deba@1749: Visitor *_visitor; deba@1749: ///Pointer to the map of reached status of the nodes. deba@1749: ReachedMap *_reached; deba@1749: ///Indicates if \ref _reached is locally allocated (\c true) or not. deba@1749: bool local_reached; deba@1749: deba@1749: std::vector _stack; deba@1749: int _stack_head; deba@1749: deba@1749: /// \brief Creates the maps if necessary. deba@1749: /// deba@1749: /// Creates the maps if necessary. deba@1749: void create_maps() { deba@1749: if(!_reached) { deba@1749: local_reached = true; deba@1749: _reached = Traits::createReachedMap(*_graph); deba@1749: } deba@1749: } deba@1749: deba@1749: protected: deba@1749: deba@1749: DfsVisit() {} deba@1749: deba@1749: public: deba@1749: deba@1749: typedef DfsVisit Create; deba@1749: deba@1749: /// \name Named template parameters deba@1749: deba@1749: ///@{ deba@1749: template deba@1749: struct DefReachedMapTraits : public Traits { deba@1749: typedef T ReachedMap; deba@1749: static ReachedMap *createReachedMap(const Graph &graph) { deba@1749: throw UninitializedParameter(); deba@1749: } deba@1749: }; deba@1749: /// \brief \ref named-templ-param "Named parameter" for setting deba@1749: /// ReachedMap type deba@1749: /// deba@1749: /// \ref named-templ-param "Named parameter" for setting ReachedMap type deba@1749: template alpar@1773: struct DefReachedMap : public DfsVisit< Graph, Visitor, alpar@1773: DefReachedMapTraits > { alpar@1773: typedef DfsVisit< Graph, Visitor, DefReachedMapTraits > Create; deba@1749: }; deba@1749: ///@} deba@1749: deba@1749: public: deba@1749: deba@1749: /// \brief Constructor. deba@1749: /// deba@1749: /// Constructor. deba@1749: /// deba@1749: /// \param graph the graph the algorithm will run on. deba@1749: /// \param visitor The visitor of the algorithm. deba@1749: /// deba@1749: DfsVisit(const Graph& graph, Visitor& visitor) deba@1749: : _graph(&graph), _visitor(&visitor), deba@1749: _reached(0), local_reached(false) {} deba@1749: deba@1749: /// \brief Destructor. deba@1749: /// deba@1749: /// Destructor. deba@1749: ~DfsVisit() { deba@1749: if(local_reached) delete _reached; deba@1749: } deba@1749: deba@1749: /// \brief Sets the map indicating if a node is reached. deba@1749: /// deba@1749: /// Sets the map indicating if a node is reached. deba@1749: /// If you don't use this function before calling \ref run(), deba@1749: /// it will allocate one. The destuctor deallocates this deba@1749: /// automatically allocated map, of course. deba@1749: /// \return (*this) deba@1749: DfsVisit &reachedMap(ReachedMap &m) { deba@1749: if(local_reached) { deba@1749: delete _reached; deba@1749: local_reached=false; deba@1749: } deba@1749: _reached = &m; deba@1749: return *this; deba@1749: } deba@1749: deba@1749: public: deba@1749: /// \name Execution control deba@1749: /// The simplest way to execute the algorithm is to use deba@1749: /// one of the member functions called \c run(...). deba@1749: /// \n deba@1749: /// If you need more control on the execution, deba@1761: /// first you must call \ref init(), then you can adda source node deba@1749: /// with \ref addSource(). deba@1749: /// Finally \ref start() will perform the actual path deba@1749: /// computation. deba@1749: deba@1749: /// @{ deba@1749: /// \brief Initializes the internal data structures. deba@1749: /// deba@1749: /// Initializes the internal data structures. deba@1749: /// deba@1749: void init() { deba@1749: create_maps(); deba@1749: _stack.resize(countNodes(*_graph)); deba@1749: _stack_head = -1; deba@1749: for (NodeIt u(*_graph) ; u != INVALID ; ++u) { deba@1749: _reached->set(u, false); deba@1749: } deba@1749: } deba@1749: deba@1749: /// \brief Adds a new source node. deba@1749: /// deba@1749: /// Adds a new source node to the set of nodes to be processed. deba@1749: void addSource(Node s) { deba@1749: if(!(*_reached)[s]) { deba@1749: _reached->set(s,true); deba@1749: _visitor->start(s); deba@1749: _visitor->reach(s); deba@1749: Edge e; deba@1749: _graph->firstOut(e, s); deba@1749: if (e != INVALID) { deba@1749: _stack[++_stack_head] = e; deba@1749: } else { deba@1749: _visitor->leave(s); deba@1749: } deba@1749: } deba@1749: } deba@1749: deba@1749: /// \brief Processes the next edge. deba@1749: /// deba@1749: /// Processes the next edge. deba@1749: /// deba@1749: /// \return The processed edge. deba@1749: /// deba@1749: /// \pre The stack must not be empty! deba@1749: Edge processNextEdge() { deba@1749: Edge e = _stack[_stack_head]; deba@1749: Node m = _graph->target(e); deba@1749: if(!(*_reached)[m]) { deba@1749: _visitor->discover(e); deba@1749: _visitor->reach(m); deba@1749: _reached->set(m, true); deba@1749: _graph->firstOut(_stack[++_stack_head], m); deba@1749: } else { deba@1749: _visitor->examine(e); deba@1749: m = _graph->source(e); deba@1749: _graph->nextOut(_stack[_stack_head]); deba@1749: } deba@1749: while (_stack_head>=0 && _stack[_stack_head] == INVALID) { deba@1749: _visitor->leave(m); deba@1749: --_stack_head; deba@1749: if (_stack_head >= 0) { deba@1749: _visitor->backtrack(_stack[_stack_head]); deba@1749: m = _graph->source(_stack[_stack_head]); deba@1749: _graph->nextOut(_stack[_stack_head]); deba@1749: } else { deba@1749: _visitor->stop(m); deba@1749: } deba@1749: } deba@1749: return e; deba@1749: } deba@1749: deba@1749: /// \brief Next edge to be processed. deba@1749: /// deba@1749: /// Next edge to be processed. deba@1749: /// deba@1749: /// \return The next edge to be processed or INVALID if the stack is deba@1749: /// empty. deba@1749: Edge nextEdge() { deba@1749: return _stack_head >= 0 ? _stack[_stack_head] : INVALID; deba@1749: } deba@1749: deba@1749: /// \brief Returns \c false if there are nodes deba@1749: /// to be processed in the queue deba@1749: /// deba@1749: /// Returns \c false if there are nodes deba@1749: /// to be processed in the queue deba@1749: bool emptyQueue() { return _stack_head < 0; } deba@1749: deba@1749: /// \brief Returns the number of the nodes to be processed. deba@1749: /// deba@1749: /// Returns the number of the nodes to be processed in the queue. deba@1749: int queueSize() { return _stack_head + 1; } deba@1749: deba@1749: /// \brief Executes the algorithm. deba@1749: /// deba@1749: /// Executes the algorithm. deba@1749: /// deba@1749: /// \pre init() must be called and at least one node should be added deba@1749: /// with addSource() before using this function. deba@1749: void start() { deba@1749: while ( !emptyQueue() ) processNextEdge(); deba@1749: } deba@1749: deba@1749: /// \brief Executes the algorithm until \c dest is reached. deba@1749: /// deba@1749: /// Executes the algorithm until \c dest is reached. deba@1749: /// deba@1749: /// \pre init() must be called and at least one node should be added deba@1749: /// with addSource() before using this function. deba@1749: void start(Node dest) { deba@2439: while ( !emptyQueue() && _graph->target(_stack[_stack_head]) != dest ) deba@1749: processNextEdge(); deba@1749: } deba@1749: deba@1749: /// \brief Executes the algorithm until a condition is met. deba@1749: /// deba@1749: /// Executes the algorithm until a condition is met. deba@1749: /// deba@1749: /// \pre init() must be called and at least one node should be added deba@1749: /// with addSource() before using this function. deba@1749: /// deba@1865: /// \param em must be a bool (or convertible) edge map. The algorithm kpeter@2476: /// will stop when it reaches an edge \c e with em[e] true. deba@1749: /// kpeter@2476: ///\return The reached edge \c e with em[e] true or deba@2439: ///\c INVALID if no such edge was found. deba@2439: /// deba@2439: /// \warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map, deba@1749: /// not a node map. deba@1749: template deba@2439: Edge start(const EM &em) { deba@2439: while ( !emptyQueue() && !em[_stack[_stack_head]] ) deba@2439: processNextEdge(); deba@2439: return emptyQueue() ? INVALID : _stack[_stack_head]; deba@1749: } deba@1749: deba@1981: /// \brief Runs %DFSVisit algorithm from node \c s. deba@1749: /// deba@1749: /// This method runs the %DFS algorithm from a root node \c s. deba@1749: /// \note d.run(s) is just a shortcut of the following code. alpar@1946: ///\code deba@1749: /// d.init(); deba@1749: /// d.addSource(s); deba@1749: /// d.start(); alpar@1946: ///\endcode deba@1749: void run(Node s) { deba@1749: init(); deba@1749: addSource(s); deba@1749: start(); deba@1749: } deba@1981: deba@1981: /// \brief Runs %DFSVisit algorithm to visit all nodes in the graph. deba@1981: deba@1981: /// This method runs the %DFS algorithm in order to deba@1981: /// compute the %DFS path to each node. The algorithm computes deba@1981: /// - The %DFS tree. deba@1981: /// - The distance of each node from the root in the %DFS tree. deba@1981: /// deba@1981: ///\note d.run() is just a shortcut of the following code. deba@1981: ///\code deba@1981: /// d.init(); deba@1981: /// for (NodeIt it(graph); it != INVALID; ++it) { deba@1981: /// if (!d.reached(it)) { deba@1981: /// d.addSource(it); deba@1981: /// d.start(); deba@1981: /// } deba@1981: /// } deba@1981: ///\endcode deba@1981: void run() { deba@1981: init(); deba@1981: for (NodeIt it(*_graph); it != INVALID; ++it) { deba@1981: if (!reached(it)) { deba@1981: addSource(it); deba@1981: start(); deba@1981: } deba@1981: } deba@1981: } deba@1749: ///@} deba@1749: deba@1749: /// \name Query Functions deba@1749: /// The result of the %DFS algorithm can be obtained using these deba@1749: /// functions.\n deba@1749: /// Before the use of these functions, deba@1749: /// either run() or start() must be called. deba@1749: ///@{ deba@1749: /// \brief Checks if a node is reachable from the root. deba@1749: /// deba@1749: /// Returns \c true if \c v is reachable from the root(s). deba@1749: /// \warning The source nodes are inditated as unreachable. deba@1749: /// \pre Either \ref run() or \ref start() deba@1749: /// must be called before using this function. deba@1749: /// deba@1749: bool reached(Node v) { return (*_reached)[v]; } deba@1749: ///@} deba@1749: }; deba@1749: deba@1749: alpar@921: } //END OF NAMESPACE LEMON alpar@780: alpar@780: #endif alpar@780: