ShortestPathWithBFM.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
#include <ogdf/graphalg/ShortestPathModule.h>
 
namespace ogdf {
 
 
class OGDF_EXPORT ShortestPathWithBFM : public ShortestPathModule {
public:
    ShortestPathWithBFM() { }
 
    // computes shortest paths
    // Precond.:
    //
    // returns false iff the graph contains a negative cycle
    virtual bool call(const Graph& G, // directed graph
            const node s, // source node
            const EdgeArray<int>& length, // length of an edge
            NodeArray<int>& d, // contains shortest path distances after call
            NodeArray<edge>& pi) override;
};
 
}