Searched refs:EdgeNode (Results 1 – 2 of 2) sorted by relevance
33 EdgeNode *edge = vertexNode.firstEdge; in ~Graph()35 EdgeNode *nextEdge = edge->next; in ~Graph()56 EdgeNode *edge = new EdgeNode; // add new edge in AddEdge()69 EdgeNode *edge = nullptr; in Dfs()
27 struct EdgeNode { struct29 EdgeNode* next; argument34 EdgeNode* firstEdge;