CTAN update: adigraph
Date: March 11, 2018 2:44:55 PM CET
Luca Cappelletti submitted an update to the
adigraph
package.
Version number: 1.3 2018-03-10
License type: mit
Summary description: Augmenting directed graphs
Announcement text:
Hello everyone, With the version 1.3 it is possible to simply: - draw graphs - augment paths of said graphs - dispose nodes automatically around a circle - apply cuts Hope it can be helpful!
This package is located at http://mirror.ctan.org/graphics/pgf/contrib/adigraph More information is at https://www.ctan.org/pkg/adigraph
Thanks for the upload. For the CTAN Team Manfred Lotz We are supported by the TeX user groups. Please join a users group; see http://www.tug.org/usergroups.html .
Hello everyone, With the version 1.3 it is possible to simply: - draw graphs - augment paths of said graphs - dispose nodes automatically around a circle - apply cuts Hope it can be helpful!
This package is located at http://mirror.ctan.org/graphics/pgf/contrib/adigraph More information is at https://www.ctan.org/pkg/adigraph
Thanks for the upload. For the CTAN Team Manfred Lotz We are supported by the TeX user groups. Please join a users group; see http://www.tug.org/usergroups.html .
adigraph – Augmenting directed graphs
This LaTeX package provides the means to easily draw augmenting oriented graphs, as well as cuts on them, to demonstrate steps of algorithms for solving max-flow min-cut problems.
This package requires the other LaTeX packages fp, xparse, xstring, and TikZ (in particular the TikZ calc library).
| Package | adigraph |
| Version | 1.7.2 |
| Copyright | 2018 Luca Cappelletti |
| Maintainer | Luca Cappelletti |