algorithm with node penalty? (vine-building)

Topics: algorithm, graph
Dec 6, 2013 at 7:58 PM
I have used QuickGraph very successfully on a transportation road network to find the shortest path using the Dijkstra algorithm. I am interested in any information on alternative algorithms that incorporate node penalties, in particular turning penalties (for example to represent the additional time spent in attempting to make a left turn from one link to another). This is generically referred to as a vine-building algorithm (http://www.slideshare.net/ikkikim/vine-shortest-example)

Thanks in advance

Dick Males
Cincinnati, Ohio, USA