pathfinding

FAILED
2810
Service version1.0
Contributor URLhttp://rsat.ulb.ac.be/neat/
WSDL URLhttp://wwwsup.scmbb.ulb.ac.be/be.ac.ulb.bigre.graphtools.server/wsdl/GraphAlgorithmsNeAT.wsdlFAILED Show/Hide Details

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.

WSDL Changes

DateDescription of Changes
FAILED

Test #1: Pathfinder test

This test enumerates the k lightest paths in the weighted KEGG RPAIR network.

Submitted by karoline on Thu, 06/10/2010 - 13:20