Uses of Interface
org.aksw.jena_sparql_api.sparql_path2.Nfa

Packages that use Nfa

Package	Description
org.aksw.jena_sparql_api_sparql_path2.playground
org.aksw.jena_sparql_api.sparql_path2

Uses of Nfa in org.aksw.jena_sparql_api_sparql_path2.playground

Fields in org.aksw.jena_sparql_api_sparql_path2.playground declared as Nfa

Modifier and Type	Field	Description
protected Nfa<S,T>	QefNfaSuccessor.nfa

Methods in org.aksw.jena_sparql_api_sparql_path2.playground that return Nfa

Modifier and Type	Method	Description
static <S, T> Nfa<S,T>	NfaUtils.reverse(Nfa<S,T> nfa)

Methods in org.aksw.jena_sparql_api_sparql_path2.playground with parameters of type Nfa

Modifier and Type	Method	Description
static <S, T, V, E> org.aksw.commons.util.triplet.TripletPath<V,E>	NfaDijkstra.dijkstra(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,Pair<ValueSet<V>>> transToVertexClass, Function<Pair<ValueSet<V>>,Function<? super Iterable<V>,Map<V,Set<org.aksw.commons.util.triplet.Triplet<V,E>>>>> createTripletLookupService, V source, V target)	Finds the shortest path connecting the source and target nodes in accordance with an nfa
static <S, T> NfaAnalysisResult<S>	EdgeReducer.estimateFrontierCost(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,PredicateClass> transToPredicateClass, Pair<Map<org.apache.jena.graph.Node,Number>> initPredFreqs, JoinSummaryService joinSummaryService)	- Vertices: are mapped to the estimated set of predicates with their estimated (maximum) frequency - Edge: Their property classes are resolved to explicit sets of predicates.
static <S, T, V, E> List<org.aksw.commons.util.triplet.TripletPath<Map.Entry<S,V>,org.aksw.commons.util.Directed<E>>>	YensKShortestPaths.findPaths(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,? extends Pair<ValueSet<V>>> transToVertexClass, Function<Pair<ValueSet<V>>,? extends Function<? super Iterable<V>,Map<V,Set<org.aksw.commons.util.triplet.Triplet<V,E>>>>> createTripletLookupService, V source, V target, int maxK)
static <S, T, P> Set<P>	EdgeReducer.getReferencedPredicates(Nfa<S,T> nfa, Predicate<Map.Entry<P,P>> joins, Predicate<T> isEpsilon, Function<Set<T>,Set<P>> transitionsToPredicates)	Based on the nfa, a list of all predicates and a predicate join summary, determine the set of predicates referenced by the nfa The set of all predicates is implicitly used by transitionsToPredicates, as this function must resolve negated predicate sets BiHashMultimap<P, P> joinSummary
static <S, T, V, E> Map<Map.Entry<S,V>,Set<org.aksw.commons.util.triplet.Triplet<Map.Entry<S,V>,org.aksw.commons.util.Directed<E>>>>	NfaDijkstra.getSuccessors(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,? extends Pair<ValueSet<V>>> transToVertexClass, Function<Pair<ValueSet<V>>,? extends Function<? super Iterable<V>,Map<V,Set<org.aksw.commons.util.triplet.Triplet<V,E>>>>> createTripletLookupService, Iterable<Map.Entry<S,V>> stateVertexPairs)	Note: When when requesting successors of a vertex, the state component will be resolved to non-epsilon state, and the result will be accociated back with the requested state Note: we could require T to be T extends Pair<ValueSet>
static <S, T> Nfa<S,T>	NfaUtils.reverse(Nfa<S,T> nfa)
<S, T> Set<T>	NfaSegmenter.segment(Nfa<S,T> nfa)
static <S, T> Map<T,Double>	EdgeReducer.trimPredicates(Nfa<S,T> nfa, Predicate<T> isEpsilon, Function<T,PredicateClass> transitionToPredicateClass, Pair<Map<org.apache.jena.graph.Node,Number>> initDiPredToCost, Map<S,Pair<Map<org.apache.jena.graph.Node,Number>>> stateToDiPredToCost, JoinSummaryService joinSummaryService)	This method takes as input an nfa where edges are labeled with the predicates according to the join summary.

Uses of Nfa in org.aksw.jena_sparql_api.sparql_path2

Classes in org.aksw.jena_sparql_api.sparql_path2 that implement Nfa

Modifier and Type	Class	Description
class	NfaImpl<V,E>

Methods in org.aksw.jena_sparql_api.sparql_path2 that return Nfa

Modifier and Type	Method	Description
static Nfa<Integer,LabeledEdge<Integer,PredicateClass>>	PathCompiler.compileToNfa(org.apache.jena.sparql.path.Path path)
Nfa<V,E>	PathVisitorNfaCompilerImpl.complete()
static <V, E> Nfa<V,E>	NfaImpl.reverse(Nfa<V,E> nfa)	IMPORTANT: Only provides an edge reverse view, does not change the edges themselves

Methods in org.aksw.jena_sparql_api.sparql_path2 with parameters of type Nfa

Modifier and Type	Method	Description
static <S, T, G, V, E> boolean	NfaExecutionUtils.collectPaths(Nfa<S,T> nfa, NfaFrontier<S,G,V,E> frontier, Predicate<T> isEpsilon, Predicate<NestedPath<V,E>> pathFilter, Function<NestedPath<V,E>,Boolean> pathCallback)
static <S, T, G, V, E> void	NfaExecutionUtils.executeNfa(Nfa<S,T> nfa, Set<S> startStates, Predicate<T> isEpsilon, Set<V> startVertices, Function<NestedPath<V,E>,G> pathGrouper, TripletLookup<T,G,V,E> getMatchingTriplets, Function<NestedPath<V,E>,Boolean> pathCallback)	Generic Nfa execution
static boolean	JoinSummaryUtils.existsJoinSummaryPath(Nfa<Integer,LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph, org.apache.jena.graph.Node augStart, org.apache.jena.graph.Node augEnd)	Checks whether there exists a path connecting start and end nodes via the nfa
static boolean	JoinSummaryUtils.existsReachability(Nfa<Integer,LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> endAugJoinGraph, org.apache.jena.graph.Node augEnd, org.apache.jena.graph.Node predicate, boolean reverse)	Given a predicate and a direction, determine whether a path exists for this predicate
static List<NestedPath<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge>>	JoinSummaryUtils.findJoinSummaryPaths(Nfa<Integer,LabeledEdge<Integer,PredicateClass>> nfa, Set<Integer> states, org.jgrapht.Graph<org.apache.jena.graph.Node,org.jgrapht.graph.DefaultEdge> joinGraph, org.apache.jena.graph.Node augStart, org.apache.jena.graph.Node augEnd, Long k)
static <S, T, P, Q> List<NestedPath<P,Q>>	NfaExecutionUtils.findPathsInJoinSummary(Nfa<S,T> nfa, Predicate<T> isEpsilon, Set<S> states, org.jgrapht.Graph<P,Q> joinGraph, P startVertex, Long k, BiFunction<T,P,Set<org.aksw.commons.util.Directed<P>>> initPred, BiFunction<T,org.aksw.commons.util.Directed<P>,Set<org.aksw.commons.util.Directed<P>>> transAndNodesToTriplets, Function<NestedPath<P,Q>,Boolean> pathCallback)	matcher(Directed, joinGraph, vertex)
static <S, T> boolean	NfaExecutionUtils.isFinalState(Nfa<S,T> nfa, S state, Predicate<T> isEpsilon)	Tests if a state is final.
static <S, T> boolean	NfaExecutionUtils.isStartState(Nfa<S,T> nfa, S state, Predicate<T> isEpsilon)
static <S, T, P, Q> boolean	NfaExecutionUtils.isTargetReachable(Nfa<S,T> nfa, Predicate<T> isEpsilon, Set<S> states, BiPredicate<org.aksw.commons.util.Directed<T>,Q> matcher, org.jgrapht.Graph<P,Q> joinGraph, org.aksw.commons.util.Directed<P> diPredicate, Pair<Set<P>> targetPreds)	Given - an nfa and - join graph, determine for a given - predicate (pointing either forwards or backwards) in a certain set of //nestedPath in a certain set of - nfa states of whether it can reach the - set of predicates leading to the target states.
static <V, E> Nfa<V,E>	NfaImpl.reverse(Nfa<V,E> nfa)	IMPORTANT: Only provides an edge reverse view, does not change the edges themselves