src/lemon/attic/tight_edge_filter_map.h
changeset 927 dec4eef5a65c
parent 919 6153d9cf78c6
equal deleted inserted replaced
0:2b8d87a68e68 0:e3eca7af7866
     1 /* -*- C++ -*-
     1 /* -*- C++ -*-
     2  * src/hugo/tight_edge_filter_map.h - Part of HUGOlib, a generic C++ optimization library
     2  * src/lemon/tight_edge_filter_map.h - Part of LEMON, a generic C++ optimization library
     3  *
     3  *
     4  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     4  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     5  * (Egervary Combinatorial Optimization Research Group, EGRES).
     5  * (Egervary Combinatorial Optimization Research Group, EGRES).
     6  *
     6  *
     7  * Permission to use, modify and distribute this software is granted
     7  * Permission to use, modify and distribute this software is granted
    12  * express or implied, and with no claim as to its suitability for any
    12  * express or implied, and with no claim as to its suitability for any
    13  * purpose.
    13  * purpose.
    14  *
    14  *
    15  */
    15  */
    16 
    16 
    17 #ifndef HUGO_TIGHT_EDGE_FILTER_MAP_H
    17 #ifndef LEMON_TIGHT_EDGE_FILTER_MAP_H
    18 #define HUGO_TIGHT_EDGE_FILTER_MAP_H
    18 #define LEMON_TIGHT_EDGE_FILTER_MAP_H
    19 
    19 
    20 #include <hugo/maps.h>
    20 #include <lemon/maps.h>
    21 
    21 
    22 // /// \file
    22 // /// \file
    23 // /// \brief Maximum flow algorithms.
    23 // /// \brief Maximum flow algorithms.
    24 // /// \ingroup galgs
    24 // /// \ingroup galgs
    25 
    25 
    26 namespace hugo {
    26 namespace lemon {
    27 
    27 
    28   /// \brief A map for filtering the edge-set to those edges 
    28   /// \brief A map for filtering the edge-set to those edges 
    29   /// which are tight w.r.t. some node_potential map and 
    29   /// which are tight w.r.t. some node_potential map and 
    30   /// edge_distance map.
    30   /// edge_distance map.
    31   ///
    31   ///
    54       return ((*node_potential)[g->head(e)] == 
    54       return ((*node_potential)[g->head(e)] == 
    55 	      (*edge_distance)[e]+(*node_potential)[g->tail(e)]);
    55 	      (*edge_distance)[e]+(*node_potential)[g->tail(e)]);
    56     }
    56     }
    57   };
    57   };
    58 
    58 
    59 } //namespace hugo
    59 } //namespace lemon
    60 
    60 
    61 #endif //HUGO_TIGHT_EDGE_FILTER_MAP_H
    61 #endif //LEMON_TIGHT_EDGE_FILTER_MAP_H
    62 
    62 
    63 
    63