Graph-related section (see GRASS Directed Graph Library) More...
#include <dig_structs.h>
Data Fields | |
| int | line_type |
| Line type used to build the graph. | |
| dglGraph_s | graph_s |
| Graph structure. | |
| dglSPCache_s | spCache |
| Shortest path cache. | |
| double * | edge_fcosts |
| Forward costs used for graph. | |
| double * | edge_bcosts |
| backward costs used for graph | |
| double * | node_costs |
| Node costs used for graph. | |
| int | cost_multip |
| Edge and node costs multiplicator. | |
Detailed Description
Graph-related section (see GRASS Directed Graph Library)
Definition at line 1192 of file dig_structs.h.
Field Documentation
◆ cost_multip
| int Graph_info::cost_multip |
Edge and node costs multiplicator.
Definition at line 1222 of file dig_structs.h.
◆ edge_bcosts
| double* Graph_info::edge_bcosts |
backward costs used for graph
Definition at line 1214 of file dig_structs.h.
◆ edge_fcosts
| double* Graph_info::edge_fcosts |
Forward costs used for graph.
dglGetEdge() is not supported for _DGL_V1)
Definition at line 1210 of file dig_structs.h.
◆ graph_s
| dglGraph_s Graph_info::graph_s |
Graph structure.
Definition at line 1200 of file dig_structs.h.
◆ line_type
| int Graph_info::line_type |
Line type used to build the graph.
Definition at line 1196 of file dig_structs.h.
◆ node_costs
| double* Graph_info::node_costs |
Node costs used for graph.
Definition at line 1218 of file dig_structs.h.
◆ spCache
| dglSPCache_s Graph_info::spCache |
Shortest path cache.
Definition at line 1204 of file dig_structs.h.
The documentation for this struct was generated from the following file:
