Hello,

is it possible to query a graph for routes between two given nodes ? Ideally, some shortest route determination could be obtained using weighted edges. Any ideas are appreciated

Lars

Hello,

is it possible to query a graph for routes between two given nodes ? Ideally, some shortest route determination could be obtained using weighted edges. Any ideas are appreciated

Lars

You canâ€™t really do it using the standard SPARQL (although you can query for reachable nodes given some fixed path structure using property paths). The most performant option would be to write custom search (BFS) code to traverse the graph.

Weâ€™re working on an extension of SPARQL which would allow this. Should be available some time this Fall.

Cheers,

Pavel

PS. Beware that the number of paths in a graph can quickly explode.

You also might want to look into using Gremlin with Stardog property graphs

http://www.tinkerpop.com/docs/wikidocs/gremlin/2.1.0/Finding-All-Paths-Between-2-Vertices.html

This topic was automatically closed 14 days after the last reply. New replies are no longer allowed.