COIN-OR::LEMON - Graph Library

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

hugo -> lemon

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/test/dijkstra_heap_test.cc

    r906 r921  
    11/* -*- C++ -*-
    2  * src/test/dijkstra_heap_test.cc - Part of HUGOlib, a generic C++ optimization library
     2 * src/test/dijkstra_heap_test.cc - Part of LEMON, a generic C++ optimization library
    33 *
    44 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     
    2020
    2121//The input is a graph in standard dimacs format from the standard input (like
    22 //in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
     22//in /lemon_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
    2323//heaps, checking two postconditions:
    2424
     
    3131#include <math.h>
    3232
    33 #include <hugo/smart_graph.h>
    34 #include <hugo/dimacs.h>
    35 #include <hugo/dijkstra.h>
    36 #include <hugo/time_measure.h>
    37 #include <hugo/bin_heap.h>
    38 #include <hugo/fib_heap.h>
     33#include <lemon/smart_graph.h>
     34#include <lemon/dimacs.h>
     35#include <lemon/dijkstra.h>
     36#include <lemon/time_measure.h>
     37#include <lemon/bin_heap.h>
     38#include <lemon/fib_heap.h>
    3939
    40 using namespace hugo;
     40using namespace lemon;
    4141
    4242int main(int, char **) {
Note: See TracChangeset for help on using the changeset viewer.