The pathfinding service enumerates the k shortest paths between a set of source and target nodes in a weighted graph. It is a wrapper of REA developped by Jimenez and Marzal.
|Date||Description of Changes|
Test #1: Pathfinder test
This test enumerates the k lightest paths in the weighted KEGG RPAIR network.