Name	Size	Mode	Actions
addedges	291	0644	editdlrm
addranks	830	0644	editdlrm
addrings	1319	0644	editdlrm
anon	422	0644	editdlrm
attr	151	0644	editdlrm
bb	997	0644	editdlrm
bbox	532	0644	editdlrm
binduce	1166	0644	editdlrm
bipart	455	0644	editdlrm
chkclusters	532	0644	editdlrm
chkedges	916	0644	editdlrm
cliptree	178	0644	editdlrm
col	601	0644	editdlrm
collapse	469	0644	editdlrm
color	1440	0644	editdlrm
cycle	560	0644	editdlrm
dechain	264	0644	editdlrm
deghist	351	0644	editdlrm
deledges	116	0644	editdlrm
delmulti	397	0644	editdlrm
delnodes	249	0644	editdlrm
depath	547	0644	editdlrm
dijkstra	647	0644	editdlrm
flatten	88	0644	editdlrm
get-layers-list	277	0644	editdlrm
group	791	0644	editdlrm
histogram	319	0644	editdlrm
indent	378	0644	editdlrm
knbhd	1226	0644	editdlrm
maxdeg	307	0644	editdlrm
path	449	0644	editdlrm
rotate	1194	0644	editdlrm
scale	1147	0644	editdlrm
scalexy	1123	0644	editdlrm
span	139	0644	editdlrm
topon	429	0644	editdlrm
treetoclust	988	0644	editdlrm

/* Determine if a graph is bipartite or not. */ BEG_G{ int vc, c, color[node_t]; node_t v; edge_t e; $tvtype = TV_dfs; $tvroot = fstnode($); } N{ if ($tvedge == NULL) color[$] = 1; if (color[$] == 1) c = 2; else c = 1; for (e = fstedge($); e; e = nxtedge(e,$)) { v = opp(e,$); vc = color[v]; if (vc == 0) color[v] = c; else if (vc != c) { printf(2, "Not bipartite\n"); exit(1); } } }