[GRASSLIST:1613] Re: GRASS 5.7: Vector networking tutorial

[Radim Blazek]

On Thursday 30 October 2003 17:54, Greg Sepesi wrote:
> As you can see, most of the time is spent on building the directed
> graphs but little is spent on calculating shortest paths.  It would be
> interesting to know where the time is being spent by v.net.iso.

v.net.iso calculates costs from each starting point to all network nodes.
Obviously an algorithm implemented in dglib would be much faster,
unfortunately it is not, and dglib is difficult to change.

Radim