New on CTAN: dijkstra
Datum: 7. September 2017 20:02:17 MESZ
Christian Tellechea submitted the
dijkstra
package.
Version number: 0.1
License type: lppl1.3c
Summary description: Dijkstra algorithm for LaTeX
Announcement text:
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.
The package's Catalogue entry can be viewed at http://www.ctan.org/pkg/dijkstra The package's files themselves can be inspected at http://mirror.ctan.org/macros/latex/contrib/dijkstra
Thanks for the upload. For the CTAN Team Erik Braun
We are supported by the TeX users groups. Please join a users group; see http://www.tug.org/usergroups.html .
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.
The package's Catalogue entry can be viewed at http://www.ctan.org/pkg/dijkstra The package's files themselves can be inspected at http://mirror.ctan.org/macros/latex/contrib/dijkstra
Thanks for the upload. For the CTAN Team Erik Braun
We are supported by the TeX users groups. Please join a users group; see http://www.tug.org/usergroups.html .
dijkstra – 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.
This packages depends on simplekv.
| Paket | dijkstra |
| Version | 0.13 2022-10-01 |
| Copyright | 2017–2020 Christian Tellechea |
| Betreuer | Christian Tellechea |