| CARVIEW |
Select Language
HTTP/2 200
expires: Thu, 19 Nov 1981 08:52:00 GMT
cache-control: no-store, no-cache, must-revalidate
pragma: no-cache
set-cookie: PHPSESSID=69p3a3j3mhh6l2uqnrkomumrle; path=/
content-type: text/html; charset=UTF-8
date: Sat, 27 Dec 2025 03:58:16 GMT
server: Apache
pkgsrc.se | The NetBSD package collection
archivers
audio
benchmarks
biology
cad
chat
comms
converters
cross
crosspkgtools
databases
devel
doc
editors
emulators
filesystems
finance
fonts
games
geography
graphics
ham
inputmethod
lang
mail
math
graphopt
mbone
meta-pkgs
misc
multimedia
net
news
parallel
pkgtools
print
regress
security
shells
sysutils
textproc
time
wip
wm
www
x11
* = Virtual Category
Path to this page:
./math/graphopt, Optimize graph layouts
[
Branch: CURRENT, Version: 0.4.1nb5, Package name: graphopt-0.4.1nb5, Maintainer: pkgsrc-users
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.
Required to run:
[x11/gtk]
Required to build:
[pkgtools/x11-links] [pkgtools/cwrappers]
Navigation:
-
Browse pkgsrc
(this page)
archivers
audio
benchmarks
biology
cad
chat
comms
converters
cross
crosspkgtools
databases
devel
doc
editors
emulators
filesystems
finance
fonts
games
geography
graphics
ham
inputmethod
lang
math
graphoptmbone
meta-pkgs
misc
multimedia
net
news
parallel
pkgtools
regress
security
shells
sysutils
textproc
time
wip
wm
www
x11
* = Virtual Category
Path to this page:
./math/graphopt, Optimize graph layouts
[
CVSweb ] [
Homepage ] [
RSS ] [
Required by ] [
Add to tracker ]
Branch: CURRENT, Version: 0.4.1nb5, Package name: graphopt-0.4.1nb5, Maintainer: pkgsrc-users
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.
Required to run:
[x11/gtk]
Required to build:
[pkgtools/x11-links] [pkgtools/cwrappers]
Master sites:
Filesize: 75.793 KBVersion history: (Expand)
- (2025-10-24) Package has been reborn
- (2025-10-24) Package deleted from pkgsrc
- (2025-07-15) Package has been reborn
- (2025-07-15) Package deleted from pkgsrc
- (2011-04-22) Updated to version: graphopt-0.4.1nb5
- (2006-02-06) Updated to version: graphopt-0.4.1nb4
CVS history: (Expand)
| 2023-08-02 21:21:59 by Nia Alarie | Files touched by this commit (69) |
Log message: *: Mark packages that were originally identified as requiring C++03 due to failing to build with a C++14 default compiler with FORCE_CXX_STD instead of USE_LANGUAGES. |
| 2021-10-26 12:56:13 by Nia Alarie | Files touched by this commit (458) |
Log message: math: Replace RMD160 checksums with BLAKE2s checksums All checksums have been double-checked against existing RMD160 and SHA512 hashes |
| 2021-10-07 16:28:36 by Nia Alarie | Files touched by this commit (458) |
Log message: math: Remove SHA1 hashes for distfiles |
| 2018-07-18 02:06:25 by Joerg Sonnenberger | Files touched by this commit (168) |
Log message: Mark packages that require C++03 (or the GNU variants) if they fail with C++14 default language. |
| 2018-01-01 23:30:04 by Roland Illig | Files touched by this commit (537) |
Log message: 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 |
| 2017-08-16 22:21:18 by Thomas Klausner | Files touched by this commit (180) |
Log message: Follow some http redirects. |
| 2015-11-04 00:33:46 by Alistair G. Crooks | Files touched by this commit (262) |
Log message: Add SHA512 digests for distfiles for math category Problems found locating distfiles: Package dfftpack: missing distfile dfftpack-20001209.tar.gz Package eispack: missing distfile eispack-20001130.tar.gz Package fftpack: missing distfile fftpack-20001130.tar.gz Package linpack: missing distfile linpack-20010510.tar.gz Package minpack: missing distfile minpack-20001130.tar.gz Package odepack: missing distfile odepack-20001130.tar.gz Package py-networkx: missing distfile networkx-1.10.tar.gz Package py-sympy: missing distfile sympy-0.7.6.1.tar.gz Package quadpack: missing distfile quadpack-20001130.tar.gz Otherwise, existing SHA1 digests verified and found to be the same on the machine holding the existing distfiles (morden). All existing SHA1 digests retained for now as an audit trail. |
| 2012-09-12 01:04:36 by Aleksej Saushev | Files touched by this commit (180) |
Log message: "user-destdir" is default these days |
