Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
ShortestPathModule.h
Go to the documentation of this file.
1
34#pragma once
35
36#include <ogdf/basic/Graph.h>
37
38namespace ogdf {
39
40
42public:
44
45 virtual ~ShortestPathModule() { }
46
47 // computes shortest paths
48 // Precond.:
49 // returns true iff a feasible min-cost flow exists
50 virtual bool call(const Graph& G, // directed graph
51 const node s, // source node
52 const EdgeArray<int>& length, // length of an edge
53 NodeArray<int>& d, // contains shortest path distances after call
54 NodeArray<edge>& pi) = 0;
55};
56
57}
Includes declaration of graph class.
Dynamic arrays indexed with edges.
Definition EdgeArray.h:125
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
Dynamic arrays indexed with nodes.
Definition NodeArray.h:125
Class for the representation of nodes.
Definition Graph_d.h:177
virtual bool call(const Graph &G, const node s, const EdgeArray< int > &length, NodeArray< int > &d, NodeArray< edge > &pi)=0
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.