Searched refs:cgl_node (Results 1 – 3 of 3) sorted by relevance
47 } cgl_node; typedef53 cgl_node * nodes;132 cgl_node *nodes; /* array of the nodes - see "types_db.h" */
507 bool best(cgl_node * x, cgl_node * y) { in best()521 cgl_node * nodes = graph->nodes; in cglShortestPath()532 std::vector <cgl_node *> nodes_; in cglShortestPath()541 cgl_node * bestNode = nodes_.front(); in cglShortestPath()
786 a_graph->nodes = reinterpret_cast<cgl_node *> (calloc((a_graph->nnodes + 1),sizeof(cgl_node))); in define_aux_graph()946 void print_node(cgl_node *n) in print_node()961 void print_node_vect(char *s,cgl_node *v,int n) in print_node_vect()1205 cgl_node * nodes = new cgl_node[nNodes+1]; in get_shortest_odd_cycle_list()