Interface SparqlKShortestPathFinder

All Known Implementing Classes:
SparqlKShortestPathFinderMem, SparqlKShortestPathFinderYen

public interface SparqlKShortestPathFinder
Interface for finding k shortest paths between a given start and end nodes Either of the nodes may be null (or Node.ANY - but not both) in which case all accepting paths will be returned. Implementing classes are expected to be bound to the appropriate dataset.
Author:
raven
  • Method Summary

    Modifier and Type
    Method
    Description
    Iterator<org.aksw.commons.util.triplet.TripletPath<org.apache.jena.graph.Node,org.aksw.commons.util.Directed<org.apache.jena.graph.Node>>>
    findPaths(org.apache.jena.graph.Node start, org.apache.jena.graph.Node end, org.apache.jena.sparql.path.Path pathExpr, Long k)
     
  • Method Details

    • findPaths

      Iterator<org.aksw.commons.util.triplet.TripletPath<org.apache.jena.graph.Node,org.aksw.commons.util.Directed<org.apache.jena.graph.Node>>> findPaths(org.apache.jena.graph.Node start, org.apache.jena.graph.Node end, org.apache.jena.sparql.path.Path pathExpr, Long k)