COIN-OR::LEMON - Graph Library

Changeset 901:69a8e672acb1 in lemon-0.x


Ignore:
Timestamp:
09/22/04 12:47:59 (15 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1209
Message:

correction of HUGO_... preproc defines.

Location:
src
Files:
13 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/array_map.h

    r897 r901  
    11// -*- c++ -*-
    2 #ifndef ARRAY_MAP_H
    3 #define ARRAY_MAP_H
     2#ifndef HUGO_ARRAY_MAP_H
     3#define HUGO_ARRAY_MAP_H
    44
    55#include <memory>
     
    332332}
    333333
    334 #endif
     334#endif //HUGO_ARRAY_MAP_H
  • src/hugo/bin_heap.h

    r776 r901  
    245245} // namespace hugo
    246246
    247 #endif // BIN_HEAP_HH
     247#endif // HUGO_BIN_HEAP_H
  • src/hugo/default_map.h

    r897 r901  
    11// -*- c++ -*-
    2 #ifndef DEFAULT_MAP_H
    3 #define DEFAULT_MAP_H
     2#ifndef HUGO_DEFAULT_MAP_H
     3#define HUGO_DEFAULT_MAP_H
    44
    55
  • src/hugo/extended_pair.h

    r897 r901  
    11// -*- c++ -*-
    2 #ifndef EXTENDED_PAIR_H
    3 #define EXTENDED_PAIR_H
     2#ifndef HUGO_EXTENDED_PAIR_H
     3#define HUGO_EXTENDED_PAIR_H
    44
    55template <typename T1, typename A1, typename T2, typename A2>
  • src/hugo/map_bits.h

    r844 r901  
    11// -*- c++ -*-
    2 #ifndef MAP_BITS_H
    3 #define MAP_BITS_H
     2#ifndef HUGO_MAP_BITS_H
     3#define HUGO_MAP_BITS_H
    44
    55///\ingroup graphmaps
  • src/hugo/map_defines.h

    r897 r901  
    11// -*- c++ -*-
    2 #ifndef MAP_DEFINES_H
    3 #define MAP_DEFINES_H
     2#ifndef HUGO_MAP_DEFINES_H
     3#define HUGO_MAP_DEFINES_H
    44
    55///\ingroup graphmaps
  • src/hugo/map_iterator.h

    r844 r901  
    11// -*- c++ -*-
    2 #ifndef MAP_ITERATOR_H
    3 #define MAP_ITERATOR_H
     2#ifndef HUGO_MAP_ITERATOR_H
     3#define HUGO_MAP_ITERATOR_H
    44
    55#include <iterator>
  • src/hugo/map_registry.h

    r891 r901  
    11// -*- c++ -*-
    2 #ifndef MAP_REGISTRY_H
    3 #define MAP_REGISTRY_H
     2#ifndef HUGO_MAP_REGISTRY_H
     3#define HUGO_MAP_REGISTRY_H
    44
    55#include <vector>
  • src/hugo/min_cost_flow.h

    r899 r901  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINCOSTFLOWS_H
    3 #define HUGO_MINCOSTFLOWS_H
     2#ifndef HUGO_MIN_COST_FLOW_H
     3#define HUGO_MIN_COST_FLOW_H
    44
    55///\ingroup flowalgs
     
    239239} //namespace hugo
    240240
    241 #endif //HUGO_MINCOSTFLOWS_H
     241#endif //HUGO_MIN_COST_FLOW_H
  • src/hugo/suurballe.h

    r899 r901  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINLENGTHPATHS_H
    3 #define HUGO_MINLENGTHPATHS_H
     2#ifndef HUGO_SUURBALLE_H
     3#define HUGO_SUURBALLE_H
    44
    55///\ingroup flowalgs
     
    198198} //namespace hugo
    199199
    200 #endif //HUGO_MINLENGTHPATHS_H
     200#endif //HUGO_SUURBALLE_H
  • src/hugo/sym_map.h

    r897 r901  
    11// -*- c++ -*-
    2 #ifndef SYM_MAP_H
    3 #define SYM_MAP_H
     2#ifndef HUGO_SYM_MAP_H
     3#define HUGO_SYM_MAP_H
    44
    55///\ingroup graphmaps
  • src/hugo/vector_map.h

    r897 r901  
    11// -*- c++ -*-
    2 #ifndef VECTOR_MAP_H
    3 #define VECTOR_MAP_H
     2#ifndef HUGO_VECTOR_MAP_H
     3#define HUGO_VECTOR_MAP_H
    44
    55#include <vector>
  • src/work/marci/makefile

    r864 r901  
    55
    66LEDABINARIES = leda_graph_demo leda_bfs_dfs max_bipartite_matching_demo
    7 BINARIES = sub_graph_wrapper_demo.cc graph_wrapper_time max_flow_demo iterator_bfs_demo macro_test lg_vs_sg_vs_sg bfsit_vs_byhand bipartite_graph_wrapper_test bipartite_matching_demo top_sort_test max_flow_1 proba7 proba8
     7BINARIES = sub_graph_wrapper_demo.cc graph_wrapper_time max_flow_demo iterator_bfs_demo macro_test lg_vs_sg_vs_sg bfsit_vs_byhand bipartite_graph_wrapper_test bipartite_matching_demo top_sort_test max_flow_1 proba7 proba10
    88#BINARIES = preflow_bug
    99#gw_vs_not preflow_demo_boost edmonds_karp_demo_boost preflow_demo_jacint preflow_demo_athos edmonds_karp_demo_alpar preflow_demo_leda
Note: See TracChangeset for help on using the changeset viewer.