[jgrapht-users] shortest path. request for help

[DORFMAN, M. <md...@in...>]

Hello,

I'm working with JgraphT for several months and it works fine for us.

Yet maybe I miss some options or algorithms that already exist and I'm just not aware of them. Will appreciate your advice.



I'm working on path calculation for optical transport networks in SDN. Path definition comes with multiple constraints of different types. There are several constraints used as weight and/or threshold. There are vertex properties that should be the same over the path. There are 'on turn' conditions caused by way physical devices are translated into vertices.



Currently I use your algorithm 'KShortestPaths'. I use 'PathValidator' callback for all calculation when algorithm runs. E.g. accumulations for threshold, 'on turn' decisions. All the rest I check from resulting K paths sorted per weight.



Recently you added a new algorithm 'MartinShortestPath'. It will be very efficient if you add there a few more options:

-        Callback for 'on turn' decisions

-        Resulting accumulated vector that can be retrieved for chosen effective paths after run

-        A way for user to define threshold vector with max value per dimension.

Is it possible ?



Are there other algorithms or solutions in library that can help?



Thanks, Masha Dorfman