Lines Matching defs:edge
33 EdgeNode *edge = vertexNode.firstEdge;
34 while (edge != nullptr) {
35 EdgeNode *nextEdge = edge->next;
36 delete edge;
37 edge = nextEdge;
47 LOG_WARN(UDMF_CLIENT, "abnormal edge, startNode:%{public}s, endNode:%{public}s. ",
56 EdgeNode *edge = new EdgeNode; // add new edge
57 edge->adjIndex = end;
58 edge->next = adjList_[start].firstEdge;
59 adjList_[start].firstEdge = edge;
69 EdgeNode *edge = nullptr;
76 edge = adjList_[nodes.top()].firstEdge;
77 while (edge) {
78 if (visited_[edge->adjIndex] == 0) {
79 visited_[edge->adjIndex] = 1;
80 nodes.push(edge->adjIndex);
81 if (action(adjList_[edge->adjIndex].value)) {
84 edge = adjList_[edge->adjIndex].firstEdge;
85 } else if (visited_[edge->adjIndex] == 1) {
88 edge = edge->next;
91 visited_[nodes.top()] = 2; // 2: all edge of the adj is visited.