Package org.aksw.jena_sparql_api.sparql_path2
package org.aksw.jena_sparql_api.sparql_path2
-
ClassDescriptionBidirectionalSearch<S,
G, V, E> EdgeLabelAccessor<E,T> EdgeLabelAccessorImpl<V,E, T> Graphlet<V,E> A set of Triplet<V, E>HalfEdge<V,E> NestedPath<V,E> Nfa<V,E> NfaFrontier<S,G, V, E> A nfa frontier maps states to the corresponding paths.NfaImpl<V,E> Pair<T>A pair is a collection having 2 entries of same type Note: For a pair with two different types, use Map.SimpleEntryParentLink<V,E> PartialNfa<V,T> Util method to process a SPARQL 1.1 Property Path into an NFA using Thompson's Construction.PathVisitorNfaCompilerImpl<V,E, D> The main reason this class extends pair is to have the list interface which allows iterating the directions with get(0) and get(1)Select ?path { ?s path:find (?expr ?path ?target ?k) } ?s: The start node for which to find paths ?expr: A string representation of a property expression ?path: The target variable, this variable will be bound to ?target: A target node the property path must terminate it ?k: How many paths, ordered by length, to retrieve ?path iInterface 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.TripletLookup<T,G, V, E> ValueSet<T>Deprecated.VertexClass<V>The main reason this class extends pair is to have the list interface which allows iterating the directions with get(0) and get(1)