
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 vinebuilding algorithm ( http://www.slideshare.net/ikkikim/vineshortestexample)
Thanks in advance
Dick Males
Cincinnati, Ohio, USA

