89 static NODE *graph, **cycle_buf, **longest_cycle;  variable
261 	if ((n->n_next = graph) != NULL)  in get_node()
262 		graph->n_prevp = &n->n_next;  in get_node()
263 	n->n_prevp = &graph;  in get_node()
264 	graph = n;  in get_node()
283 	for (n = graph; n != NULL; n = n->n_next)  in clear_cycle()
294 	while (graph != NULL) {  in tsort()
301 			for (cnt = 0, n = graph; n != NULL; n = next) {  in tsort()
308 		} while (graph != NULL && cnt);  in tsort()
310 		if (graph == NULL)  in tsort()
319 			for (cnt = 0, n = graph; n != NULL; n = n->n_next)  in tsort()
326 		for (n = graph; n != NULL; n = n->n_next)  in tsort()