CTAN
Comprehensive TeX Archive Network

New on CTAN: di­jk­stra

Date: Septem­ber 7, 2017 8:02:17 PM CEST
Chris­tian Tel­lechea sub­mit­ted the di­jk­stra pack­age. Ver­sion num­ber: 0.1 Li­cense type: lp­pl1.3c Sum­mary de­scrip­tion: Di­jk­stra al­go­rithm for LaTeX An­nounce­ment text:
This small pack­age uses the Di­jk­stra al­go­rithm for weighted graphs, di­rected or not: the search ta­ble of the short­est path can be dis­played, the min­i­mum dis­tance be­tween two ver­tices and the cor­re­spond­ing path are stored in macros.
The pack­age's Cat­a­logue en­try can be viewed at http://www.ctan.org/pkg/di­jk­stra The pack­age's files them­selves can be in­spected at http://mir­ror.ctan.org/macros/la­tex/con­trib/di­jk­stra
Thanks for the up­load. For the CTAN Team Erik Braun
We are sup­ported by the TeX users groups. Please join a users group; see http://www.tug.org/user­groups.html .

di­jk­stra – Di­jk­stra al­go­rithm for

This small pack­age uses the Di­jk­stra al­go­rithm for weighted graphs,di­rected or not: the search ta­ble of the short­est path can be dis­played, the min­i­mum dis­tance be­tween two ver­tices and the cor­re­spond­ing path are stored in macros.

This pack­ages de­pends on sim­plekv.

Pack­agedi­jk­stra
Ver­sion0.11 2017-09-09
Main­tainer Chris­tian Tel­lechea

An­nounce­ments

more

Guest Book Sitemap Contact Contact Author