CVS log for pkgsrc/math/graphopt/PLIST

Up to [cvs.NetBSD.org] / pkgsrc / math / graphopt

Request diff between arbitrary revisions

Keyword substitution: kv
Default branch: MAIN

Sort PLIST files.

Unsorted entries in PLIST files have generated a pkglint warning for at
least 12 years. Somewhat more recently, pkglint has learned to sort
PLIST files automatically. Since pkglint 5.4.23, the sorting is only
done in obvious, simple cases. These have been applied by running:

  pkglint -Cnone,PLIST -Wnone,plist-sort -r -F

Remove @dirrm entries from PLISTs

Update to 0.4.1:
        * Changed pixmap directory to $prefix/share/pixmaps/graphopt

Update to 0.4.
        * Added postscript export
        * Made the pixmaps install correctly

Properly install the xpm graphics that graphopt uses for the buttons.

Initial import of graphopt-0.1, a graph layout optimizer:
In contrast to Graphviz and other graph optimizers, graphopt does
not use a heuristic approach to layout optimization.  Instead, it
uses basic principles of physics to iteratively determine optimal
layout.  Each node is given mass and an electric charge, and each
edge is represented as a spring.  Node mass, electric charge,
optimal spring length, and the spring constant are tweakable in
the gui in realtime.

For most graphs, this is all that is needed - hit 'go' and the
graph organizes itself much as the analagous real-life system would
if constrained to two dimensions.  For more complex graphs, some
fiddling with the physical parameters at different stages of
optimization usually does the trick.

To accomodate very large graphs, an additional mechanism called
layering was added.  When a graph is loaded, nodes are assigned to
layers based on their relative positions.  During optimization,
you can choose to hide any number of layers.  Any nodes assigned
to a layer lower than the selected layer are not only hidden, but
neither their electric charges nor the forces of the springs attached
to them are figured into the forces acting on the visible nodes.
In effect, those nodes cease to exist, and a smaller graph is
allowed to lay itself out without being constrained by an excessive
number of nodes.

Initial revision