Location: LEMON/LEMON-official/test/path_test.cc - annotation
Load file history
Use DEBUG instead of ASSERT in graph extenders (ticket #17)
r209:765619b7cbb2 r96:b55e501a90ee r209:765619b7cbb2 r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r96:b55e501a90ee r209:765619b7cbb2 r96:b55e501a90ee r96:b55e501a90ee | /* -*- mode: C++; indent-tabs-mode: nil; -*-
*
* This file is a part of LEMON, a generic C++ optimization library.
*
* Copyright (C) 2003-2008
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Research Group on Combinatorial Optimization, EGRES).
*
* Permission to use, modify and distribute this software is granted
* provided that this copyright notice appears in all copies. For
* precise terms see the accompanying LICENSE file.
*
* This software is provided "AS IS" with no warranty of any kind,
* express or implied, and with no claim as to its suitability for any
* purpose.
*
*/
#include <string>
#include <iostream>
#include <lemon/concepts/path.h>
#include <lemon/concepts/digraph.h>
#include <lemon/path.h>
#include <lemon/list_graph.h>
#include "test_tools.h"
using namespace std;
using namespace lemon;
void check_concepts() {
checkConcept<concepts::Path<ListDigraph>, concepts::Path<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, Path<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, SimplePath<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, StaticPath<ListDigraph> >();
checkConcept<concepts::Path<ListDigraph>, ListPath<ListDigraph> >();
}
int main() {
check_concepts();
return 0;
}
|