summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2019-04-08 17:23:59 +0000
committerKarl Berry <karl@freefriends.org>2019-04-08 17:23:59 +0000
commit9da8ac113f97e68e91e3a1ef26467f9814eb4312 (patch)
treef36b76c9a982931638dde95501c51072185dec56 /Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua
parente919fa4b004d0ef401808c337d7def5fa259da0f (diff)
pgf revert to previous release (r49607, committed 5jan19)
git-svn-id: svn://tug.org/texlive/trunk@50867 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua12
1 files changed, 6 insertions, 6 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua
index 4bfa896ef95..05b480713b0 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/lib/PathLengths.lua
@@ -27,11 +27,11 @@ local PriorityQueue = require "pgf.gd.lib.PriorityQueue"
---
--- Performs the Dijkstra algorithm to solve the single-source shortest path problem.
+-- Performs the Dijkstra algorithm to solve the single-source shortes path problem.
--
--- The algorithm computes the shortest paths from |source| to all nodes
--- in the graph. It also generates a table with distance level sets, each of
--- which contain all nodes that have the same corresponding distance to
+-- The algorithm computes the shortest paths from |source| to all nodes
+-- in the graph. It also generates a table with distance level sets, each of
+-- which contain all nodes that have the same corresponding distance to
-- |source|. Finally, a mapping of nodes to their parents along the
-- shortest paths is generated to allow the reconstruction of the paths
-- that were chosen by the Dijkstra algorithm.
@@ -39,7 +39,7 @@ local PriorityQueue = require "pgf.gd.lib.PriorityQueue"
-- @param graph The graph to compute the shortest paths for.
-- @param source The node to compute the distances to.
--
--- @return A mapping of nodes to their distance to |source|.
+-- @return A mapping of nodes to their distance to |source|.
-- @return An array of distance level sets. The set at index |i| contains
-- all nodes that have a distance of |i| to |source|.
-- @return A mapping of nodes to their parents to allow the reconstruction
@@ -95,7 +95,7 @@ end
---
--- Performs the Floyd-Warshall algorithm to solve the all-source shortest path problem.
+-- Performs the Floyd-Warshall algorithm to solve the all-source shortes path problem.
--
-- @param graph The graph to compute the shortest paths for.
--