graphAlgorithms.h

#ifndef GRAPHALGORITHMS_H
#define GRAPHALGORITHMS_H

#include "GraphInterface.h"
#include <vector>
#include <deque>
#include <map>


using namespace std;
namespace mho {

std::vector<std::pair<cost_t,std::vector<NodeInterface*> > > enumerate_paths(GraphInterface *g, NodeInterface *x, NodeInterface *destination, cost_t max_cost);
std::vector<std::pair<cost_t,std::vector<NodeInterface*> > > enumerate_paths(GraphInterface *g, NodeInterface *x, NodeInterface *destination=0);
pair<cost_t, vector<NodeInterface *> > random_path(GraphInterface *g, NodeInterface *x, NodeInterface *destination,cost_t max_cost);
pair<cost_t, vector<NodeInterface *> > random_path(GraphInterface *g, NodeInterface *x, NodeInterface *destination);

std::pair<cost_t,std::deque<NodeInterface*> > dijkstra(GraphInterface *g,NodeInterface* n1,NodeInterface* n2);
std::pair<cost_t,std::vector<NodeInterface*> > dijkstra(GraphInterface *g,NodeInterface* n1,NodeInterface* n2,bool vect);

class ReverseDisjkstra{
public:
    ReverseDisjkstra(GraphInterface *g=0);
    void setGraph(GraphInterface *g);
    void setTarget(NodeInterface *target);
    NodeInterface* getTarget(){return target;}
    void compute(NodeInterface *target);
    void compute();
    std::pair<cost_t,std::deque<NodeInterface*> > getPathDeque(NodeInterface *start);
    std::pair<cost_t,std::vector<NodeInterface*> > getPathVector(NodeInterface *start);

private:
    GraphInterface *g;
    NodeInterface *target;
    std::map<NodeInterface*,cost_t> dist;
    std::map<NodeInterface*,NodeInterface*> pred;
};


}
#endif // GRAPHALGORITHMS_H