| /src/usr.bin/tsort/ |
| tsort.c | 89 NODE *n_next; /* next node in graph */
104 static NODE *graph, **cycle_buf, **longest_cycle; variable in typeref:typename:NODE *
163 /* parse input and build the graph */
200 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
201 * the graph, then add them.
237 /* Find a node in the graph (insert if not found) and return a pointer to it. */
272 if ((n->n_next = graph) != NULL)
273 graph->n_prevp = &n->n_next;
274 n->n_prevp = &graph;
275 graph = n
[all...] |
| tsort.c | 89 NODE *n_next; /* next node in graph */
104 static NODE *graph, **cycle_buf, **longest_cycle; variable in typeref:typename:NODE *
163 /* parse input and build the graph */
200 * add an arc from node s1 to node s2 in the graph. If s1 or s2 are not in
201 * the graph, then add them.
237 /* Find a node in the graph (insert if not found) and return a pointer to it. */
272 if ((n->n_next = graph) != NULL)
273 graph->n_prevp = &n->n_next;
274 n->n_prevp = &graph;
275 graph = n
[all...] |
| /src/usr.sbin/map-mbone/ |
| mapper.c | 765 printf("GRAPH \"Multicast Router Connectivity: %s\" = UNDIRECTED\n",
814 int flood = FALSE, graph = FALSE; local in function:main
835 graph = TRUE;
859 fprintf(stderr, "\t-f Flood the routing graph with queries\n");
939 if (graph)
|
| mapper.c | 765 printf("GRAPH \"Multicast Router Connectivity: %s\" = UNDIRECTED\n",
814 int flood = FALSE, graph = FALSE; local in function:main
835 graph = TRUE;
859 fprintf(stderr, "\t-f Flood the routing graph with queries\n");
939 if (graph)
|
