NeAT - Pathfinder

Do multiple-to-multiple end path finding. Click on help for help.
Web service and interface by Karoline Faust. This program calls REA (Jimenez and Marzal, 1999). See Credits for other contributors.

1. Network help



Enter the network here (tab-delimited* or gml):

*The tab-delimiter can be replaced by two white spaces.

Or upload the network from a file:


OR enter a network id (id of previously submitted network):




Input format 

Directed network
Store network on server



2. Seed nodes help



Info: Matching of provided identifiers to identifiers of nodes in the network is case-insensitive.

Enter source and target nodes:

Source nodes  
Target nodes

Or upload a batch file:




3. Path finding options help



Rank
Warning: The edge weight is seen as edge cost, not as edge strength!
Weighting scheme
Identifiers of nodes to exclude
Identifiers of nodes to include
Maximal path weight
Maximal path length
Minimal path length




4. Output help



Output format  

Table:
Graph:
       Graph format:       
       Graph output type:


Email (optional)


RESET DEMO1 DEMO2 ADVANCED MANUAL TUTORIAL MAIL WSDL