21 #include <grass/dgl/graph.h> 33 struct ilist *articulation_list)
53 tin = (
int *)
G_calloc(nnodes + 1,
sizeof(
int));
54 min_tin = (
int *)
G_calloc(nnodes + 1,
sizeof(
int));
58 mark = (
int *)
G_calloc(nnodes + 1,
sizeof(
int));
59 if (!tin || !min_tin || !parent || !stack || !current || !mark) {
64 for (i = 1; i <= nnodes; i++) {
79 if (tin[current_id] == 0) {
82 stack[0] = current_node;
84 parent[current_id] =
NULL;
89 if (tin[node_id] == 0)
90 min_tin[node_id] = tin[node_id] = ++time;
96 if (min_tin[to] >= tin[node_id])
99 if (min_tin[to] < min_tin[node_id])
100 min_tin[node_id] = min_tin[to];
104 for (; current_edge[node_id]; current_edge[node_id] =
dglEdgeset_T_Next(¤t[node_id])) {
107 if (to == parent[node_id])
112 if (tin[to_id] < min_tin[node_id])
113 min_tin[node_id] = tin[to_id];
116 if (node_id == current_id)
118 parent[to_id] = node;
119 stack[stack_size++] = to;
123 if (!current_edge[node_id])
127 mark[current_id] = 1;
132 for (i = 1; i <= nnodes; i++)
139 for (i = 1; i <= nnodes; i++)
void void void void G_fatal_error(const char *,...) __attribute__((format(printf
dglInt32_t * dglGetNode(dglGraph_s *pGraph, dglInt32_t nNodeId)
dglInt32_t dglNodeGet_Id(dglGraph_s *pGraph, dglInt32_t *pnNode)
void dglNode_T_Release(dglNodeTraverser_s *pT)
void G_free(void *)
Free allocated memory.
int dglGet_NodeCount(dglGraph_s *pgraph)
dglInt32_t * dglEdgeGet_Tail(dglGraph_s *pGraph, dglInt32_t *pnEdge)
dglInt32_t * dglNode_T_First(dglNodeTraverser_s *pT)
dglInt32_t * dglEdgeset_T_First(dglEdgesetTraverser_s *pT)
void dglEdgeset_T_Release(dglEdgesetTraverser_s *pT)
int Vect_list_append(struct ilist *, int)
Append new item to the end of list if not yet present.
int NetA_articulation_points(dglGraph_s *graph, struct ilist *articulation_list)
Get number of articulation points in the graph.
int dglNode_T_Initialize(dglNodeTraverser_s *pT, dglGraph_s *pGraph)
dglInt32_t * dglEdgeset_T_Next(dglEdgesetTraverser_s *pT)
dglInt32_t * dglNodeGet_OutEdgeset(dglGraph_s *pGraph, dglInt32_t *pnNode)
int dglEdgeset_T_Initialize(dglEdgesetTraverser_s *pT, dglGraph_s *pGraph, dglInt32_t *pnEdgeset)
dglInt32_t * dglNode_T_Next(dglNodeTraverser_s *pT)