ShortestPathWithBFM.h

Go to the documentation of this file.

/*
 * $Revision: 2299 $
 * 
 * last checkin:
 *   $Author: gutwenger $ 
 *   $Date: 2012-05-07 15:57:08 +0200 (Mon, 07 May 2012) $ 
 ***************************************************************/
 
#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_SHORTEST_PATH_BFM_H
#define OGDF_SHORTEST_PATH_BFM_H


#include <ogdf/module/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
    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
    );  


};


} // end namespace ogdf


#endif