lemon/dfs.h
changeset 901 63e4468c680e
parent 825 75e6020b19b1
child 907 1937b6455b7d
child 964 2b6bffe0e7e8
equal deleted inserted replaced
35:dc4bae04bea7 36:04ef2e10783c
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     2  *
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library.
     3  * This file is a part of LEMON, a generic C++ optimization library.
     4  *
     4  *
     5  * Copyright (C) 2003-2009
     5  * Copyright (C) 2003-2010
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     8  *
     9  * Permission to use, modify and distribute this software is granted
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    10  * provided that this copyright notice appears in all copies. For
    80     }
    80     }
    81 
    81 
    82     ///The type of the map that indicates which nodes are reached.
    82     ///The type of the map that indicates which nodes are reached.
    83 
    83 
    84     ///The type of the map that indicates which nodes are reached.
    84     ///The type of the map that indicates which nodes are reached.
    85     ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    85     ///It must conform to
       
    86     ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    86     typedef typename Digraph::template NodeMap<bool> ReachedMap;
    87     typedef typename Digraph::template NodeMap<bool> ReachedMap;
    87     ///Instantiates a \c ReachedMap.
    88     ///Instantiates a \c ReachedMap.
    88 
    89 
    89     ///This function instantiates a \ref ReachedMap.
    90     ///This function instantiates a \ref ReachedMap.
    90     ///\param g is the digraph, to which
    91     ///\param g is the digraph, to which
   268     ///\brief \ref named-templ-param "Named parameter" for setting
   269     ///\brief \ref named-templ-param "Named parameter" for setting
   269     ///\c ReachedMap type.
   270     ///\c ReachedMap type.
   270     ///
   271     ///
   271     ///\ref named-templ-param "Named parameter" for setting
   272     ///\ref named-templ-param "Named parameter" for setting
   272     ///\c ReachedMap type.
   273     ///\c ReachedMap type.
   273     ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   274     ///It must conform to
       
   275     ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   274     template <class T>
   276     template <class T>
   275     struct SetReachedMap : public Dfs< Digraph, SetReachedMapTraits<T> > {
   277     struct SetReachedMap : public Dfs< Digraph, SetReachedMapTraits<T> > {
   276       typedef Dfs< Digraph, SetReachedMapTraits<T> > Create;
   278       typedef Dfs< Digraph, SetReachedMapTraits<T> > Create;
   277     };
   279     };
   278 
   280 
   800     }
   802     }
   801 
   803 
   802     ///The type of the map that indicates which nodes are reached.
   804     ///The type of the map that indicates which nodes are reached.
   803 
   805 
   804     ///The type of the map that indicates which nodes are reached.
   806     ///The type of the map that indicates which nodes are reached.
   805     ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   807     ///It must conform to
       
   808     ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   806     typedef typename Digraph::template NodeMap<bool> ReachedMap;
   809     typedef typename Digraph::template NodeMap<bool> ReachedMap;
   807     ///Instantiates a ReachedMap.
   810     ///Instantiates a ReachedMap.
   808 
   811 
   809     ///This function instantiates a ReachedMap.
   812     ///This function instantiates a ReachedMap.
   810     ///\param g is the digraph, to which
   813     ///\param g is the digraph, to which
  1205     typedef GR Digraph;
  1208     typedef GR Digraph;
  1206 
  1209 
  1207     /// \brief The type of the map that indicates which nodes are reached.
  1210     /// \brief The type of the map that indicates which nodes are reached.
  1208     ///
  1211     ///
  1209     /// The type of the map that indicates which nodes are reached.
  1212     /// The type of the map that indicates which nodes are reached.
  1210     /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
  1213     /// It must conform to the
       
  1214     /// \ref concepts::ReadWriteMap "ReadWriteMap" concept.
  1211     typedef typename Digraph::template NodeMap<bool> ReachedMap;
  1215     typedef typename Digraph::template NodeMap<bool> ReachedMap;
  1212 
  1216 
  1213     /// \brief Instantiates a ReachedMap.
  1217     /// \brief Instantiates a ReachedMap.
  1214     ///
  1218     ///
  1215     /// This function instantiates a ReachedMap.
  1219     /// This function instantiates a ReachedMap.