|
| Voronoi (const Graph &G, const EdgeArray< T > &weights, const List< node > &seeds) |
| Build data structure to query Voronoi regions of edge-weighted graph G with given Voronoi seeds.
|
|
T | distance (node v) const |
| Returns the distance between v and its Voronoi seed.
|
|
const Graph & | getGraph () const |
| Returns a reference to the graph the Voronoi region has been computed for.
|
|
const List< node > & | getSeeds () const |
| Returns a reference to the list of seeds the Voronoi region has been computed for.
|
|
const ArrayBuffer< node > & | nodesInRegion (node v) const |
| Returns the list of nodes in the Voronoi region of node v .
|
|
node | predecessor (node v) const |
| Returns the nearest node to v on the shortest path to its Voronoi seed.
|
|
edge | predecessorEdge (node v) const |
| Returns the edge incident to v and its predecessor. Note that the predecessor of a terminal is nullptr .
|
|
node | seed (node v) const |
| Returns the Voronoi seed of node v .
|
|
template<typename T>
class ogdf::Voronoi< T >
Computes Voronoi regions in an edge-weighted graph.
Definition at line 49 of file Voronoi.h.