COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changeset 921:818510fa3d99 in lemon-0.x for src/work/athos


Ignore:
Timestamp:
09/29/04 17:30:04 (20 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
Message:

hugo -> lemon

Location:
src/work/athos
Files:
15 edited

Legend:

Unmodified
Added
Removed

  • src/work/athos/bfs_test.cc

    r671 r921  
    55#include <sage_graph.h>
    66//#include <smart_graph.h>
    7 #include <hugo/dimacs.h>
    8 #include <hugo/time_measure.h>
    9 #include <hugo/for_each_macros.h>
     7#include <lemon/dimacs.h>
     8#include <lemon/time_measure.h>
     9#include <lemon/for_each_macros.h>
    1010#include <bfs_dfs.h>
    1111
    12 using namespace hugo;
     12using namespace lemon;
    1313
    1414int main() {

  • src/work/athos/dijkstra_at.h

    r250 r921  
    2525using namespace std;
    2626
    27 namespace hugo {
     27namespace lemon {
    2828
    2929  template <typename graph_type, typename T>
    … …  
    119119
    120120
    121 }//namespace hugo
     121}//namespace lemon
    122122
    123123#endif //DIJKSTRA_AT

  • src/work/athos/dijkstra_demo.cc

    r250 r921  
    66#include <dijkstra_at.h>
    77
    8 using namespace hugo;
     8using namespace lemon;
    99
    1010

  • src/work/athos/kruskal.h

    r250 r921  
    88#include <union_find.h>
    99
    10 namespace hugo {
     10namespace lemon {
    1111 
    1212  template <typename graph_type, typename T>
    … …  
    5757  }
    5858
    59 }//namespacc hugo
     59}//namespacc lemon
    6060
    6161#endif

  • src/work/athos/min_cost_flow.cc

    r672 r921  
    11#include <iostream>
    22//#include "test_tools.h"
    3 #include <hugo/list_graph.h>
     3#include <lemon/list_graph.h>
    44#include <mincostflow.h>
    55//#include <path.h>
    … …  
    77
    88using namespace std;
    9 using namespace hugo;
     9using namespace lemon;
    1010
    1111

  • src/work/athos/mincostflow.h

    r672 r921  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINCOSTFLOW_H
    3 #define HUGO_MINCOSTFLOW_H
     2#ifndef LEMON_MINCOSTFLOW_H
     3#define LEMON_MINCOSTFLOW_H
    44
    55///\ingroup galgs
    … …  
    77///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
    88
    9 #include <hugo/dijkstra.h>
    10 #include <hugo/graph_wrapper.h>
    11 #include <hugo/maps.h>
     9#include <lemon/dijkstra.h>
     10#include <lemon/graph_wrapper.h>
     11#include <lemon/maps.h>
    1212#include <vector>
    1313#include <list>
    1414#include <values.h>
    15 #include <hugo/for_each_macros.h>
    16 #include <hugo/unionfind.h>
    17 #include <hugo/bin_heap.h>
     15#include <lemon/for_each_macros.h>
     16#include <lemon/unionfind.h>
     17#include <lemon/bin_heap.h>
    1818#include <bfs_dfs.h>
    1919
    20 namespace hugo {
     20namespace lemon {
    2121
    2222/// \addtogroup galgs
    … …  
    2727  ///
    2828  ///
    29   /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
     29  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
    3030  /// an algorithm for solving the following general minimum cost flow problem>
    3131  ///
    … …  
    509509  ///@}
    510510
    511 } //namespace hugo
    512 
    513 #endif //HUGO_MINCOSTFLOW_H
     511} //namespace lemon
     512
     513#endif //LEMON_MINCOSTFLOW_H

  • src/work/athos/minlength_demo.cc

    r607 r921  
    33
    44#include <list_graph.h>
    5 #include <hugo/dimacs.h>
    6 #include <hugo/time_measure.h>
     5#include <lemon/dimacs.h>
     6#include <lemon/time_measure.h>
    77#include "minlengthpaths.h"
    88//#include <time_measure.h>
    99
    10 using namespace hugo;
     10using namespace lemon;
    1111
    1212// Use a DIMACS max flow file as stdin.

  • src/work/athos/old/minlengthpaths.h

    r607 r921  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINLENGTHPATHS_H
    3 #define HUGO_MINLENGTHPATHS_H
     2#ifndef LEMON_MINLENGTHPATHS_H
     3#define LEMON_MINLENGTHPATHS_H
    44
    55///\ingroup galgs
    … …  
    88
    99#include <iostream>
    10 #include <hugo/dijkstra.h>
    11 #include <hugo/graph_wrapper.h>
    12 #include <hugo/maps.h>
     10#include <lemon/dijkstra.h>
     11#include <lemon/graph_wrapper.h>
     12#include <lemon/maps.h>
    1313#include <vector>
    1414
    1515
    16 namespace hugo {
     16namespace lemon {
    1717
    1818/// \addtogroup galgs
    … …  
    2222  /// of minimal total length
    2323  ///
    24   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
     24  /// The class \ref lemon::MinLengthPaths "MinLengthPaths" implements
    2525  /// an algorithm for finding k edge-disjoint paths
    2626  /// from a given source node to a given target node in an
    … …  
    198198  ///@}
    199199
    200 } //namespace hugo
    201 
    202 #endif //HUGO_MINLENGTHPATHS_H
     200} //namespace lemon
     201
     202#endif //LEMON_MINLENGTHPATHS_H

  • src/work/athos/pf_demo.cc

    r331 r921  
    88#include "preflow_push.hh"
    99
    10 using namespace hugo;
     10using namespace lemon;
    1111
    1212

  • src/work/athos/preflow_push_wogw.h

    r331 r921  
    1 #ifndef HUGO_PREFLOW_PUSH_HH
    2 #define HUGO_PREFLOW_PUSH_HH
     1#ifndef LEMON_PREFLOW_PUSH_HH
     2#define LEMON_PREFLOW_PUSH_HH
    33
    44//#include <algorithm>
    … …  
    1414using namespace std;
    1515
    16 namespace hugo {
     16namespace lemon {
    1717
    1818  template <typename Graph, typename T>
    … …  
    459459
    460460
    461 }//namespace hugo
     461}//namespace lemon
    462462
    463463#endif //PREFLOW_PUSH_HH

  • src/work/athos/suurballe.cc

    r314 r921  
    77#include <minlengthpaths.h>
    88
    9 using namespace hugo;
     9using namespace lemon;
    1010
    1111

  • src/work/athos/uf_demo.cc

    r250 r921  
    55#include <iostream>
    66#include <list_graph.hh>
    7 using namespace hugo;
     7using namespace lemon;
    88using namespace std;
    99

  • src/work/athos/union_find.h

    r250 r921  
    1414
    1515
    16 namespace hugo {
     16namespace lemon {
    1717 
    1818  template <typename KeyType, typename KeyIntMap>
    … …  
    9191  };
    9292 
    93 }//namespace hugo
     93}//namespace lemon
    9494#endif

  • src/work/athos/xy/boundingbox.cc

    r244 r921  
    33#include <iostream>
    44using namespace std;
    5 using namespace hugo;
     5using namespace lemon;
    66int main()
    77{

  • src/work/athos/xy/xy.cc

    r513 r921  
    33#include <vector>
    44using namespace std;
    5 using namespace hugo;
     5using namespace lemon;
    66
    77
Note: See TracChangeset for help on using the changeset viewer.