X7ROOT File Manager
Current Path:
/usr/share/graphviz/gvpr
usr
/
share
/
graphviz
/
gvpr
/
📁
..
📄
addedges
(291 B)
📄
addranks
(830 B)
📄
addrings
(1.29 KB)
📄
anon
(422 B)
📄
attr
(151 B)
📄
bb
(997 B)
📄
bbox
(532 B)
📄
binduce
(1.14 KB)
📄
bipart
(455 B)
📄
chkclusters
(532 B)
📄
chkedges
(916 B)
📄
cliptree
(178 B)
📄
col
(601 B)
📄
collapse
(469 B)
📄
color
(1.41 KB)
📄
cycle
(560 B)
📄
dechain
(264 B)
📄
deghist
(351 B)
📄
deledges
(116 B)
📄
delmulti
(397 B)
📄
delnodes
(249 B)
📄
depath
(547 B)
📄
dijkstra
(647 B)
📄
flatten
(88 B)
📄
get-layers-list
(277 B)
📄
group
(791 B)
📄
histogram
(319 B)
📄
indent
(378 B)
📄
knbhd
(1.2 KB)
📄
maxdeg
(307 B)
📄
path
(449 B)
📄
rotate
(1.17 KB)
📄
scale
(1.12 KB)
📄
scalexy
(1.1 KB)
📄
span
(139 B)
📄
topon
(429 B)
📄
treetoclust
(988 B)
Editing: dijkstra
/* Given graph processed by dijkstra, and node, * color shortest path * Assumes path has been computed by dijkstra */ BEG_G { node_t n = isNode($,ARGV[0]); node_t nxt; edge_t e; double d, totd = 0; if (n == NULL) { printf(2, "no node named \"%s\"\n", ARGV[0]); exit(1); } while (n.prev != "") { nxt = isNode($,n.prev); /* printf(2, "nxt \"%s\"\n", nxt.name); */ e = isEdge (n, nxt, ""); if (e == NULL) { printf(2, "no edge between %s and %s\n", n.name, nxt.name); } e.color = "blue"; /* printf(2, "len %s\n", e.len); */ /* sscanf (e.len, "%f", &d); */ /* totd += d; */ n = nxt; } }
Upload File
Create Folder