Searched refs:dglEdgeGet_Head (Results 1 – 10 of 10) sorted by relevance
| /dports/databases/grass7/grass-7.8.6/lib/vector/neta/ |
| H A D | components.c | 122 to = dglNodeGet_Id(graph, dglEdgeGet_Head(graph, edge)); in NetA_weakly_connected_components()
261 to = dglNodeGet_Id(graph, dglEdgeGet_Head(graph, edge)); in NetA_strongly_connected_components()
266 memcpy(&ncost, dglNodeGet_Attr(graph, dglEdgeGet_Head(graph, edge)), in NetA_strongly_connected_components()
|
| H A D | path.c | 209 dglInt32_t *from = dglEdgeGet_Head(graph, edge); in NetA_distance_to_points()
317 cur = dglNodeGet_Id(graph, dglEdgeGet_Head(graph, prev[cur])); in NetA_find_path()
|
| H A D | flow.c | 141 node = dglNodeGet_Id(graph, dglEdgeGet_Head(graph, prev[node])); in NetA_flow()
149 node = dglNodeGet_Id(graph, dglEdgeGet_Head(graph, prev[node])); in NetA_flow()
|
| H A D | spanningtree.c | 135 dglNodeGet_Id(graph, dglEdgeGet_Head(graph, perm[i].edge)); in NetA_spanning_tree()
|
| /dports/databases/grass7/grass-7.8.6/vector/v.generalize/ |
| H A D | network.c | 115 from = dglEdgeGet_Head(gr, edge); in graph_generalization()
|
| /dports/databases/grass7/grass-7.8.6/vector/v.net.alloc/ |
| H A D | alloc.c | 325 dglInt32_t *from = dglEdgeGet_Head(graph, edge); in alloc_to_centers()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/dglib/ |
| H A D | graph.h | 344 dglInt32_t *dglEdgeGet_Head(dglGraph_s * pGraph, dglInt32_t * pnEdge);
|
| H A D | graph.c | 458 dglInt32_t *dglEdgeGet_Head(dglGraph_s * pGraph, dglInt32_t * pnEdge) in dglEdgeGet_Head() function
|
| /dports/databases/grass7/grass-7.8.6/vector/v.net.iso/ |
| H A D | alloc.c | 325 dglInt32_t *from = dglEdgeGet_Head(graph, edge); in alloc_to_centers()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/Vlib/ |
| H A D | net_analyze.c | 102 dglEdgeGet_Head(&(Map->dgraph.graph_s), in ttb_convert_dgl_shortest_path_result()
|