RhodeCode

{

  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);