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: chkedges
/* Looks for multiedges and loops, and output * those found along with counts. If the -d flag * is given, edge direction is taken into account. */ BEGIN{ char* ename; char* n; int doDir, cnt[]; int loopcnt[]; int nloops, nmulti; if ((ARGC > 0) && (ARGV[0] == "-d")) doDir = 1; else doDir = 0; } BEG_G{unset(cnt); unset(loopcnt); nloops = nmulti = 0;} E{ if (doDir || (tail.name <= head.name)) ename=tail.name+"_"+head.name; else ename = head.name+"_"+tail.name; if (tail == head) { loopcnt[ename] += 1; if (loopcnt[ename] == 1) nloops += 1; } else { cnt[ename] += 1; if (cnt[ename] == 2) nmulti += 1; } } END_G{ printf ("graph %s: %d loops %d multiedges\n", $.name, nloops, nmulti); for (cnt[n]) { if (cnt[n] > 1) printf ("%s : %d\n", n, cnt[n]); } for (loopcnt[n]) { if (loopcnt[n] > 0) printf ("%s : %d\n", n, loopcnt[n]); } }
Upload File
Create Folder