successive_shortest.h

// The Flowlessly project
// Copyright (c) 2013-2016 Ionel Gog <ionel.gog@cl.cam.ac.uk>

#ifndef FLOWLESSLY_SUCCESSIVE_SHORTEST_H
#define FLOWLESSLY_SUCCESSIVE_SHORTEST_H

#include "solvers/solver.h"

#include <vector>

#include "graphs/adjacency_map_graph.h"
#include "misc/statistics.h"

namespace flowlessly {

class SuccessiveShortest : public Solver {
 public:
  SuccessiveShortest(AdjacencyMapGraph* graph, Statistics* stats);
  ~SuccessiveShortest();

  void PrepareState();
  bool Run();

 private:
  void SuccessiveShortestBellman();

  void SuccessiveShortestDijkstra();

  AdjacencyMapGraph* graph_;
};

}  // namespace flowlessly
#endif  // FLOWLESSLY_SUCCESSIVE_SHORTEST_H