summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/doc/latex/dijkstra/README
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2017-09-09 22:35:13 +0000
committerKarl Berry <karl@freefriends.org>2017-09-09 22:35:13 +0000
commit7effd978acf9bc18bab84dc4e449205e2157195c (patch)
tree15b24fb02136cd892df7d0d5a42ae8c9be22221b /Master/texmf-dist/doc/latex/dijkstra/README
parent14899457156244d2f29d3d5bdc099ff273215893 (diff)
dijkstra (9sep17)
git-svn-id: svn://tug.org/texlive/trunk@45256 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/doc/latex/dijkstra/README')
-rw-r--r--Master/texmf-dist/doc/latex/dijkstra/README9
1 files changed, 6 insertions, 3 deletions
diff --git a/Master/texmf-dist/doc/latex/dijkstra/README b/Master/texmf-dist/doc/latex/dijkstra/README
index cfc74a840b7..c619266cd50 100644
--- a/Master/texmf-dist/doc/latex/dijkstra/README
+++ b/Master/texmf-dist/doc/latex/dijkstra/README
@@ -3,9 +3,9 @@ ___________________________________
L'extension
dijkstra
- v0.1
+ v0.11
- 6 sptembre 2017
+ 9 sptembre 2017
___________________________________
Authors : Christian Tellechea
@@ -18,4 +18,7 @@ Licence : Released under the LaTeX Project Public License v1.3c or
----------------------------------------------------------------------
-Dijkstra algorithm for LaTeX
+This small package uses the Dijkstra algorithm for weighted
+graphs, directed or not: the search table of the shortest path can
+be displayed, the minimum distance between two vertices and
+the corresponding path are stored in macros.