Path to this page:
./
wip/py-gato,
Python-based toolbox to visualise algorithms on graphs
Branch: CURRENT,
Version: 1.2.2,
Package name: py27-gato-1.2.2,
Maintainer: kamelderouicheParaphrasing the website:
Gato - the Graph Animation Toolbox - is software [toolkit] which visualizes
algorithms on graphs.
- Graphs are mathematical objects consisting of vertices, and edges
connecting pairs of vertices.
- Algorithms might find a shortest path - the fastest route - or a minimal
spanning tree or solve one of other interesting problems on graphs:
maximal-flow, weighted and non-weighted matching and min-cost flow.
- Visualisation means linking cause - the statements of an algorithm -
immediately to an effect - changes to the graph the algorithm has as its
input - by terms of blinking, changing colors and other visual effects.
Required to run:[
x11/py-Tk] [
lang/python27]
Required to build:[
pkgtools/cwrappers]
Master sites:
RMD160: 05f2798a9549bb4dc441b998c85f06656369f43b
Filesize: 267.938 KB
Version history: (Expand)
- (2024-09-19) Package has been reborn
- (2024-09-15) Package deleted from pkgsrc
- (2023-02-13) Package has been reborn
- (2020-09-29) Package has been reborn
- (2020-09-29) Package deleted from pkgsrc
- (2020-01-02) Package has been reborn
CVS history: (Expand)
2015-02-18 09:09:25 by Thomas Klausner | Files touched by this commit (2) |
Log message:
Convert to distutils.mk. Fix PLIST for python!=2.7. Mark as not ready for
python 3.x. Replace interpreter path in installed files.
|
2015-02-16 23:06:44 by Kamel Ibn Aziz Derouiche | Files touched by this commit (5) |
Log message:
Import py27-gato-1.2.2 as wip/py-gato.
Paraphrasing the website:
Gato - the Graph Animation Toolbox - is software [toolkit] which visualizes
algorithms on graphs.
- Graphs are mathematical objects consisting of vertices, and edges
connecting pairs of vertices.
- Algorithms might find a shortest path - the fastest route - or a minimal
spanning tree or solve one of other interesting problems on graphs:
maximal-flow, weighted and non-weighted matching and min-cost flow.
- Visualisation means linking cause - the statements of an algorithm -
immediately to an effect - changes to the graph the algorithm has as its
input - by terms of blinking, changing colors and other visual effects.
|