Shortest Path 01

Linked Topics

https://naeimdesigntechnologies.wordpress.com/research/research-areas/mapping-and-data-visualization/

Subject: Shortest Path 01

Shortest path problem is a set of algorithms used in analysing in a graph or network to find the fastest or shortest path between two points on the graph. It also used to list all the rest alternative or possible paths to reach the same destination, from the origin. The shortest path used widely in mapping and city planning to navigate through complex systems of streets and building blocks, it’s also used to draw the safest paths in difficult terrains and topography. Dijkstra is one good example of short path algorithms, which take us back to the description of graph theory and its applications.

Sshortest Path

Applications

The shortest path used widely in mapping and city planning to navigate through complex systems of streets and building blocks, it’s also used to draw the safest paths in difficult terrains and topography.

Reference

http://en.wikipedia.org/wiki/Shortest_path_problem

http://www.grasshopper3d.com/forum/topics/shortest-walk?commentId=2985220%3AComment%3A387620

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s