Home
last modified time | relevance | path

Searched refs:ED_xpenalty (Results 1 – 6 of 6) sorted by relevance

/dports/graphics/graphviz/graphviz-2.44.1/lib/dotgen/
H A Dfastgr.c179 ED_xpenalty(e) = ED_xpenalty(orig); in new_virtual_edge()
195 ED_minlen(e) = ED_count(e) = ED_xpenalty(e) = ED_weight(e) = 1; in new_virtual_edge()
332 ED_xpenalty(rep) += ED_xpenalty(e); in basic_merge()
354 ED_xpenalty(rep) -= ED_xpenalty(e); in unrep()
H A Dmincross.c569 register int cnt = ED_xpenalty(*e2); in in_cross()
578 cross += ED_xpenalty(*e1) * cnt; in in_cross()
590 register int cnt = ED_xpenalty(*e2); in out_cross()
598 cross += ((ED_xpenalty(*e1)) * cnt); in out_cross()
1682 cross += ED_xpenalty(e) * ED_xpenalty(f); in local_cross()
1687 cross += ED_xpenalty(e) * ED_xpenalty(f); in local_cross()
1716 cross += Count[k] * ED_xpenalty(e); in rcross()
1723 Count[inv] += ED_xpenalty(e); in rcross()
1818 if (ED_xpenalty(e) > 0) in medians()
1822 if (ED_xpenalty(e) > 0) in medians()
H A Ddotinit.c60 ED_count(e) = ED_xpenalty(e) = 1; in dot_init_edge()
62 ED_xpenalty(e) = CL_CROSS; in dot_init_edge()
66 ED_xpenalty(e) = 0; in dot_init_edge()
H A Dclass2.c155 ED_xpenalty(rep) += ED_xpenalty(e); in merge_chain()
H A Dcluster.c357 ED_xpenalty(e) *= CL_CROSS; in build_skeleton()
/dports/graphics/graphviz/graphviz-2.44.1/lib/common/
H A Dtypes.h604 #define ED_xpenalty(e) (((Agedgeinfo_t*)AGDATA(e))->xpenalty) macro