| /dports/databases/grass7/grass-7.8.6/lib/vector/neta/ |
| H A D | flow.c | 102 dglInt32_t id = dglEdgeGet_Id(graph, edge); in NetA_flow()
127 edge_id = dglEdgeGet_Id(graph, prev[node]); in NetA_flow()
134 edge_id = dglEdgeGet_Id(graph, prev[node]); in NetA_flow()
147 edge_id = dglEdgeGet_Id(graph, prev[node]); in NetA_flow()
214 dglInt32_t id = dglEdgeGet_Id(graph, edge); in NetA_min_cut()
239 edge_id = abs(dglEdgeGet_Id(graph, edge)); in NetA_min_cut()
|
| H A D | bridge.c | 93 …Vect_list_append(bridge_list, dglEdgeGet_Id(graph, current_edge[node_id])); /*so it must be a brid… in NetA_compute_bridges()
104 dglEdgeGet_Id(graph, current_edge[node_id]); in NetA_compute_bridges()
|
| H A D | spanningtree.c | 122 if (dglEdgeGet_Id(graph, edge) > 0) { in NetA_spanning_tree()
141 Vect_list_append(tree_list, dglEdgeGet_Id(graph, perm[i].edge)); in NetA_spanning_tree()
|
| H A D | path.c | 296 dglInt32_t edge_id = abs(dglEdgeGet_Id(graph, edge)); in NetA_find_path()
316 Vect_list_append(list, abs(dglEdgeGet_Id(graph, prev[cur]))); in NetA_find_path()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/dglib/examples/ |
| H A D | shortest_path.c | 75 printf(" edge : %ld\n", dglEdgeGet_Id(pgraph, pIn->pnEdge)); in clipper()
197 dglEdgeGet_Id(&graph, pReport->pArc[i].pnEdge), in main()
|
| H A D | cr_from_a.c | 165 dglEdgeGet_Id(&graph, pEdge), in main()
|
| H A D | view.c | 107 dglEdgeGet_Id(pgraph, pedge) in _print_node()
|
| H A D | cr_large_graph.c | 278 dglEdgeGet_Id(&graph, pEdge), in main()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/Vlib/ |
| H A D | graph.c | 38 (int)dglEdgeGet_Id(pgraph, pargIn->pnEdge), in clipper()
232 line = dglEdgeGet_Id(graph, pSPReport->pArc[i].pnEdge); in Vect_graph_shortest_path()
|
| H A D | net_analyze.c | 35 (int)dglEdgeGet_Id(pgraph, pargIn->pnEdge), in clipper()
73 dglEdgeGet_Id(&(Map->dgraph.graph_s), pSPReport->pArc[i].pnEdge); in convert_dgl_shortest_path_result()
98 dglEdgeGet_Id(&(Map->dgraph.graph_s), pSPReport->pArc[i].pnEdge); in ttb_convert_dgl_shortest_path_result()
|
| /dports/databases/grass7/grass-7.8.6/vector/v.generalize/ |
| H A D | network.c | 123 id = abs(dglEdgeGet_Id(gr, edge)); in graph_generalization()
138 int id2 = abs(dglEdgeGet_Id(gr, to_edge)); in graph_generalization()
|
| /dports/databases/grass7/grass-7.8.6/vector/v.net.alloc/ |
| H A D | alloc.c | 240 Nodes[to_id].edge = dglEdgeGet_Id(graph, edge); in alloc_from_centers()
331 Nodes[from_id].edge = dglEdgeGet_Id(graph, edge); in alloc_to_centers()
|
| /dports/databases/grass7/grass-7.8.6/vector/v.net.iso/ |
| H A D | alloc.c | 240 Nodes[to_id].edge = dglEdgeGet_Id(graph, edge); in alloc_from_centers()
331 Nodes[from_id].edge = dglEdgeGet_Id(graph, edge); in alloc_to_centers()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/dglib/ |
| H A D | graph.h | 342 dglInt32_t dglEdgeGet_Id(dglGraph_s * pGraph, dglInt32_t * pnEdge);
|
| H A D | dglib.dox | 296 dglEdgeGet_Id()
|
| H A D | graph.c | 438 dglInt32_t dglEdgeGet_Id(dglGraph_s * pGraph, dglInt32_t * pnEdge) in dglEdgeGet_Id() function
|
| /dports/databases/grass7/grass-7.8.6/vector/v.net.distance/ |
| H A D | main.c | 339 edge_id = (int) dglEdgeGet_Id(graph, nxt[vertex_id]); in main()
|