Isochrones (Travel Time Map) and Isodistances

I want to create an isochron (travel time map) and equidistant based on city line data.

For example this image
This is a map that shows how many seconds you can go from one point.

Is there a Grasshopper component suitable for this program?
Can I use ”DecodingSpaces”?

That’s classic graph theory:

If you have roads (or parcels) you’ll need stuff the likes of Straight Skeleton for creating a center/road axis line graph. If the city is big maybe you’ll need an approach for limiting the search into some boundary with regard a focus graph node.

Then you’ll need Dijkstra’s node to every other routing calculation (not node to node shortest path).

It’s most unlikely that you could do anything of these without code.

Thank you for reply.

I want to use simple roads. (Simple city of lattice shape)

I only knew the shortest path. How are all the routing calculations done?
Is it possible with python?

Since the Dijkstra routing is done (my stuff) with C# ( but using // for big graphs the likes of Steiner etc etc) then I assume that is also doable with P.

So cool!!!

But,It’s difficult for me and I can’t make it myself …

Thank you

I’m so sorry: that type of stuff is strictly internal to the practice (plus: you can’t auto-translate C# to P).

I do hope that your next case could be less sensitive.


1 Like

1 Like

I believe you could use spiderweb for this.

I’ve implemented networkx in GHPython quite extensively for solving such graph problems. There’s a couple of threads on how to implement the module both here and on the old Grasshopper forum. Try giving it a search.

Edit: this thread might be a good start, though I seem to recall someone here getting a newer version running in Rhino 6 (which uses a newer version of IronPython that might have resolved some of the incompatibility issues I mentioned in that old post).