Disperse flows throughout a network based on a input vectors of origin points and associated densities
dodgr_flows_disperse(graph, from, dens, wt_profile = "bicycle", contract = FALSE, k = 2, heap = "BHeap", quiet = TRUE)
graph 


from  Vector or matrix of points from which aggregate dispersed flows are to be calculated (see Details) 
dens  Vectors of densities correponsing to the 
wt_profile  Name of weighting profile for street networks (one of foot, horse, wheelchair, bicycle, moped, motorcycle, motorcar, goods, hgv, psv). 
contract  If 
k  Width coefficient of exponential diffusion function defined as

heap  Type of heap to use in priority queue. Options include
Fibonacci Heap (default; 
quiet  If 
Modified version of graph with additonal flow
column added.
graph < weight_streetnet (hampi) from < sample (graph$from_id, size = 10) dens < rep (1, length (from)) # Uniform densities graph < dodgr_flows_disperse (graph, from = from, dens = dens) # graph then has an additonal 'flows` column of aggregate flows along all # edges. These flows are directed, and can be aggregated to equivalent # undirected flows on an equivalent undirected graph with: graph_undir < merge_directed_flows (graph)