ShortestPathAlgorithms.h File Reference

Declaration of several shortest path algorithms. More...

#include <ogdf/basic/Array.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/Graph_d.h>
#include <ogdf/basic/NodeArray.h>
#include <ogdf/basic/SList.h>
#include <ogdf/graphalg/Dijkstra.h>

Go to the source code of this file.

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.

Functions
template<typename TCost >
void	ogdf::bfs_SPAP (const Graph &G, NodeArray< NodeArray< TCost > > &distance, TCost edgeCosts)
	Computes all-pairs shortest paths in G using breadth-first serach (BFS).
template<typename TCost >
void	ogdf::bfs_SPSS (node s, const Graph &G, NodeArray< TCost > &distanceArray, TCost edgeCosts)
	Computes single-source shortest paths from s in G using breadth-first search (BFS).
template<typename TCost >
void	ogdf::dijkstra_SPAP (const Graph &G, NodeArray< NodeArray< TCost > > &shortestPathMatrix, const EdgeArray< TCost > &edgeCosts)
	Computes all-pairs shortest paths in graph G using Dijkstra's algorithm.
template<typename TCost >
double	ogdf::dijkstra_SPAP (const GraphAttributes &GA, NodeArray< NodeArray< TCost > > &shortestPathMatrix)
	Computes all-pairs shortest paths in GA using Dijkstra's algorithm.
template<typename TCost >
void	ogdf::dijkstra_SPSS (node s, const Graph &G, NodeArray< TCost > &shortestPathMatrix, const EdgeArray< TCost > &edgeCosts)
	Computes single-source shortest paths from node s in G using Disjkstra's algorithm.
template<typename TCost >
void	ogdf::floydWarshall_SPAP (NodeArray< NodeArray< TCost > > &shortestPathMatrix, const Graph &G)
	Computes all-pairs shortest paths in graph G using Floyd-Warshall's algorithm.

Detailed Description

Declaration of several shortest path algorithms.

Author

Mark Ortmann, University of Konstanz

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file ShortestPathAlgorithms.h.