lemon/bfs.h
changeset 884 6dd226d3dcba
parent 825 75e6020b19b1
child 976 426a704d7483
equal deleted inserted replaced
31:76b0452852ff 32:591ffe790aa9
     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
   269     ///\brief \ref named-templ-param "Named parameter" for setting
   270     ///\brief \ref named-templ-param "Named parameter" for setting
   270     ///\c ReachedMap type.
   271     ///\c ReachedMap type.
   271     ///
   272     ///
   272     ///\ref named-templ-param "Named parameter" for setting
   273     ///\ref named-templ-param "Named parameter" for setting
   273     ///\c ReachedMap type.
   274     ///\c ReachedMap type.
   274     ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   275     ///It must conform to
       
   276     ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   275     template <class T>
   277     template <class T>
   276     struct SetReachedMap : public Bfs< Digraph, SetReachedMapTraits<T> > {
   278     struct SetReachedMap : public Bfs< Digraph, SetReachedMapTraits<T> > {
   277       typedef Bfs< Digraph, SetReachedMapTraits<T> > Create;
   279       typedef Bfs< Digraph, SetReachedMapTraits<T> > Create;
   278     };
   280     };
   279 
   281 
   870     }
   872     }
   871 
   873 
   872     ///The type of the map that indicates which nodes are reached.
   874     ///The type of the map that indicates which nodes are reached.
   873 
   875 
   874     ///The type of the map that indicates which nodes are reached.
   876     ///The type of the map that indicates which nodes are reached.
   875     ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   877     ///It must conform to
       
   878     ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
   876     typedef typename Digraph::template NodeMap<bool> ReachedMap;
   879     typedef typename Digraph::template NodeMap<bool> ReachedMap;
   877     ///Instantiates a ReachedMap.
   880     ///Instantiates a ReachedMap.
   878 
   881 
   879     ///This function instantiates a ReachedMap.
   882     ///This function instantiates a ReachedMap.
   880     ///\param g is the digraph, to which
   883     ///\param g is the digraph, to which
  1263     typedef GR Digraph;
  1266     typedef GR Digraph;
  1264 
  1267 
  1265     /// \brief The type of the map that indicates which nodes are reached.
  1268     /// \brief The type of the map that indicates which nodes are reached.
  1266     ///
  1269     ///
  1267     /// The type of the map that indicates which nodes are reached.
  1270     /// The type of the map that indicates which nodes are reached.
  1268     /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
  1271     /// It must conform to
       
  1272     ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
  1269     typedef typename Digraph::template NodeMap<bool> ReachedMap;
  1273     typedef typename Digraph::template NodeMap<bool> ReachedMap;
  1270 
  1274 
  1271     /// \brief Instantiates a ReachedMap.
  1275     /// \brief Instantiates a ReachedMap.
  1272     ///
  1276     ///
  1273     /// This function instantiates a ReachedMap.
  1277     /// This function instantiates a ReachedMap.