COIN-OR::LEMON - Graph Library

Changeset 1728:eb8bb91ba9e2 in lemon-0.x for test/heap_test.cc


Ignore:
Timestamp:
10/14/05 13:03:40 (15 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2255
Message:

Updating tests

File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/heap_test.cc

    r1435 r1728  
    1616#include <lemon/fib_heap.h>
    1717#include <lemon/radix_heap.h>
     18#include <lemon/linear_heap.h>
    1819
    1920#include "test_tools.h"
     
    2122#include "heap_test.h"
    2223
     24#include <lemon/time_measure.h>
    2325
    2426using namespace lemon;
     
    6668    typedef FibHeap<Node, Prio, Graph::NodeMap<int> > NodeHeap;
    6769    checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>();
     70    Timer timer;
    6871    dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start);
     72    std::cout << timer << std::endl;
    6973  }
    7074  {
     
    7882    typedef FibHeap<Node, Prio, Graph::NodeMap<int> > NodeHeap;
    7983    checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>();
     84    Timer timer;
    8085    dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start);
     86    std::cout << timer << std::endl;
    8187  }
    8288  {
     
    9096    typedef RadixHeap<Node, Graph::NodeMap<int> > NodeHeap;
    9197    checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>();
     98    Timer timer;
    9299    dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start);
     100    std::cout << timer << std::endl;
     101  }
     102
     103  {
     104    std::cerr << "Checking Linear Heap" << std::endl;
     105
     106    typedef LinearHeap<Item, ItemIntMap> IntHeap;
     107    checkConcept<Heap<Item, Prio, ItemIntMap>, IntHeap>();
     108    heapSortTest<IntHeap>(100);
     109    heapIncreaseTest<IntHeap>(100);
     110
     111    typedef LinearHeap<Node, Graph::NodeMap<int> > NodeHeap;
     112    checkConcept<Heap<Node, Prio, Graph::NodeMap<int> >, NodeHeap>();
     113    Timer timer;
     114    dijkstraHeapTest<Graph, LengthMap, NodeHeap>(graph, length, start);
     115    std::cout << timer << std::endl;
    93116  }
    94117
Note: See TracChangeset for help on using the changeset viewer.