3 int label_ (int64_t *n, int64_t *e2, int64_t *adj, int64_t *
4 xadj, int64_t *nnn, int64_t *iw, int64_t *oldpro, int64_t *newpro)
9 static int64_t i, snode, i1, i2, i3;
11 static int64_t lstnum;
68 for (i = 1; i <= i__1; ++i)
90 diamtr_ (n, e2, &adj[1], &xadj[1], &nnn[1], &iw[i1], &iw[i2], &iw[i3],
95 number_ (n, &nc, &snode, &lstnum, e2, &adj[1], &xadj[1], &nnn[1], &iw[
101 profi1_ (n, &nnn[1], e2, &adj[1], &xadj[1], oldpro, newpro);
int diamtr_(int64_t *n, int64_t *e2, int64_t *adj, int64_t *xadj, int64_t *mask, int64_t *ls, int64_t *xls, int64_t *hlevel, int64_t *snode, int64_t *nc)
Purpose: Find nodes which define a pseudo-diameter of a graph and store distances from end node...
int label_(int64_t *n, int64_t *e2, int64_t *adj, int64_t *xadj, int64_t *nnn, int64_t *iw, int64_t *oldpro, int64_t *newpro)
int number_(int64_t *, int64_t *nc, int64_t *snode, int64_t *lstnum, int64_t *, int64_t *adj, int64_t *xadj, int64_t *s, int64_t *q, int64_t *p)
int profi1_(int64_t *n, int64_t *nnn, int64_t *, int64_t *adj, int64_t *xadj, int64_t *oldpro, int64_t *newpro)