Path to this page:
./
wip/pygato,
Pythonbased toolbox to visualise algorithms on graphs
Branch: CURRENT,
Version: 1.2.2,
Package name: py27gato1.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:
maximalflow, weighted and nonweighted matching and mincost 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/pyTk] [
lang/python27]
Required to build:[
pkgtools/cwrappers]
Master sites:
SHA1: 70f5cdf87dc26b614d683b33dd988f726a418ca0
RMD160: 05f2798a9549bb4dc441b998c85f06656369f43b
Filesize: 267.938 KB
Version history: (Expand)
 (20180313) Package has been reborn
 (20180308) Package deleted from pkgsrc
 (20180307) Package has been reborn
 (20180307) Package deleted from pkgsrc
 (20171123) Package has been reborn
 (20170502) Package has been reborn
CVS history: (Expand)
20150218 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.

20150216 23:06:44 by Kamel Ibn Aziz Derouiche  Files touched by this commit (5) 
Log message:
Import py27gato1.2.2 as wip/pygato.
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:
maximalflow, weighted and nonweighted matching and mincost 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.
