I am using qgis and pgrouting plugin to find the shortest path between two nodes and display the route. Currently, the plot shows the shortest path. However, I also want to know which nodes the path passes through. So is it possible to actually get this information?
[GIS] Plot the nodes of the shortest path found by dijkstra algorithm
pgroutingqgis
Best Answer
Presumably you are using Postgresql, PostGIS and pgrouting.
pgrouting returns a result set of nodes that represent the nodes within the shortest path.
A simple way to plot this in qgis is to save the shortest path result set into a table in postgresql (use an select into statement).
Once you have the table in postgresql, you will be add that table as a separate layer in your project.