RhodeCode

#include <lemon/smart_graph.h>

#include <lemon/list_graph.h>

#include <lemon/lgf_reader.h>

#include <lemon/bellman_ford.h>

#include <lemon/path.h>

#include "graph_test.h"

#include "test_tools.h"

using namespace lemon;

char test_lgf[] =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "2\n"

  "3\n"

  "4\n"

  "@arcs\n"

  "    length\n"

  "0 1 3\n"

  "1 2 -3\n"

  "1 2 -5\n"

  "1 3 -2\n"

  "0 2 -1\n"

  "1 2 -4\n"

  "0 3 2\n"

  "4 2 -5\n"

  "2 3 1\n"

  "@attributes\n"

  "source 0\n"

  "target 3\n";

void checkBellmanFordCompile()

{

  typedef int Value;

  typedef concepts::Digraph Digraph;

  typedef concepts::ReadMap<Digraph::Arc,Value> LengthMap;

  typedef BellmanFord<Digraph, LengthMap> BF;

  typedef Digraph::Node Node;

  typedef Digraph::Arc Arc;

  Digraph gr;

  Node s, t, n;

  Arc e;

  Value l;

  bool b;

  BF::DistMap d(gr);

  BF::PredMap p(gr);

  LengthMap length;

  concepts::Path<Digraph> pp;

  {

    BF bf_test(gr,length);

    const BF& const_bf_test = bf_test;

    bf_test.run(s);

    bf_test.run(s,k);

    bf_test.init();

    bf_test.addSource(s);

    bf_test.addSource(s, 1);

    b = bf_test.processNextRound();

    b = bf_test.processNextWeakRound();

    bf_test.start();

    bf_test.checkedStart();

    bf_test.limitedStart(k);

    l  = const_bf_test.dist(t);

    e  = const_bf_test.predArc(t);

    s  = const_bf_test.predNode(t);

    b  = const_bf_test.reached(t);

    d  = const_bf_test.distMap();

    p  = const_bf_test.predMap();

    pp = const_bf_test.path(t);

    for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {}

  }

  {

    BF::SetPredMap<concepts::ReadWriteMap<Node,Arc> >

      ::SetDistMap<concepts::ReadWriteMap<Node,Value> >

      ::SetOperationTraits<BellmanFordDefaultOperationTraits<Value> >

      ::Create bf_test(gr,length);

    LengthMap length_map;

    concepts::ReadWriteMap<Node,Arc> pred_map;

    concepts::ReadWriteMap<Node,Value> dist_map;

    bf_test

      .lengthMap(length_map)

      .predMap(pred_map)

      .distMap(dist_map);