Skip to content
August 29, 2010 / Gagan

Shortest Path with Geometric Network

In my project GeometricNet (Geometric Network) I have added the functionality to find the shortest path between two nodes. This is based on A-Start Algorithm . A JavaScript  implementation of A- Star is nicely done by Brian Grinstead,  same code I have included in my project. Actually scalability of the graph and related operations like shortest path on javascript is doubtful considering amount of vector data need to be loaded ( say full network of a city roads) and operation time.  I’ll test both in coming days and post the result for same.  Here is demo of the shortest path with Geometric Network.                                                                                               

By drawing  a edge network with draw edge tool, it will create network topology itself.  The graph is implemented with modified adjacency list data structure. By drawing the flags near any two nodes initiate the process to find the shortest path between these nodes. The shortest path is shown by selecting the edges of the path.

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

%d bloggers like this: