Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::ShortestPathWithBFM Class Reference

Computes single-source shortest-paths with Bellman-Ford-Moore's algorithm. More...

#include <ogdf/graphalg/ShortestPathWithBFM.h>

+ Inheritance diagram for ogdf::ShortestPathWithBFM:

Public Member Functions

 ShortestPathWithBFM ()
 
virtual bool call (const Graph &G, const node s, const EdgeArray< int > &length, NodeArray< int > &d, NodeArray< edge > &pi) override
 
- Public Member Functions inherited from ogdf::ShortestPathModule
 ShortestPathModule ()
 
virtual ~ShortestPathModule ()
 

Detailed Description

Computes single-source shortest-paths with Bellman-Ford-Moore's algorithm.

Definition at line 43 of file ShortestPathWithBFM.h.

Constructor & Destructor Documentation

◆ ShortestPathWithBFM()

ogdf::ShortestPathWithBFM::ShortestPathWithBFM ( )
inline

Definition at line 46 of file ShortestPathWithBFM.h.

Member Function Documentation

◆ call()

virtual bool ogdf::ShortestPathWithBFM::call ( const Graph G,
const node  s,
const EdgeArray< int > &  length,
NodeArray< int > &  d,
NodeArray< edge > &  pi 
)
overridevirtual

The documentation for this class was generated from the following file: