Uses of Interface
org.jhotdraw8.graph.algo.AddToSet

Packages that use AddToSet

Package	Description
org.jhotdraw8.graph	References: Wikipedia.
org.jhotdraw8.graph.algo
org.jhotdraw8.graph.iterator
org.jhotdraw8.graph.path
org.jhotdraw8.graph.path.algo

Uses of AddToSet in org.jhotdraw8.graph

Methods in org.jhotdraw8.graph with parameters of type AddToSet

Modifier and Type	Method	Description
default @NonNull Enumerator<V>	DirectedGraph.searchNextVertices(@NonNull V start, @NonNull AddToSet<V> visited, boolean dfs)	Searches for vertices starting at the provided vertex.
default @NonNull Enumerator<V>	BidiGraph.searchPrevVertices(@NonNull V start, @NonNull AddToSet<V> visited, boolean dfs)	Searches for vertices starting at the provided vertex.

Uses of AddToSet in org.jhotdraw8.graph.algo

Subinterfaces of AddToSet in org.jhotdraw8.graph.algo

Modifier and Type	Interface	Description
interface	AddToIntSet	Represents a function that adds an element to a set if not already present.

Uses of AddToSet in org.jhotdraw8.graph.iterator

Constructors in org.jhotdraw8.graph.iterator with parameters of type AddToSet

Modifier	Constructor	Description
	BfsDfsArcSpliterator(@Nullable Function<V,Iterable<Arc<V,A>>> nextFunction, @Nullable V root, @Nullable AddToSet<Arc<V,A>> visited, boolean dfs)	Creates a new instance.
	BfsDfsVertexSpliterator(@NonNull Function<V,Iterable<V>> nextFunction, @NonNull V root, @NonNull AddToSet<V> visited, boolean dfs)	Creates a new instance.

Uses of AddToSet in org.jhotdraw8.graph.path

Methods in org.jhotdraw8.graph.path with parameters of type AddToSet

Modifier and Type	Method	Description
default @Nullable OrderedPair<ImmutableList<Arc<V,A>>,C>	ArcSequenceFinder.findArcSequence(@NonNull V start, @NonNull V goal, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds an arc sequence from start to goal.
@Nullable OrderedPair<ImmutableList<Arc<V,A>>,C>	ArcSequenceFinder.findArcSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds an arc sequence from a set of start vertices to a vertex that satisfies the goal predicate.
@Nullable OrderedPair<ImmutableList<Arc<V,A>>,C>	SimpleCombinedSequenceFinder.findArcSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)
default @Nullable OrderedPair<ImmutableList<A>,C>	ArrowSequenceFinder.findArrowSequence(@NonNull V start, @NonNull V goal, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds an arrow sequence from start to goal.
@Nullable SimpleOrderedPair<ImmutableList<A>,C>	ArrowSequenceFinder.findArrowSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds an arrow sequence from a set of start vertices to a vertex that satisfies the goal predicate.
@Nullable SimpleOrderedPair<ImmutableList<A>,C>	SimpleCombinedSequenceFinder.findArrowSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)
@Nullable SimpleOrderedPair<ImmutableList<V>,C>	SimpleCombinedSequenceFinder.findVertexSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)
@Nullable SimpleOrderedPair<ImmutableList<Integer>,C>	SimpleIndexedVertexSequenceFinder.findVertexSequence(@NonNull Iterable<Integer> startVertices, @NonNull Predicate<Integer> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<Integer> visited)
@Nullable SimpleOrderedPair<ImmutableList<V>,C>	SimpleVertexSequenceFinder.findVertexSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)
default @Nullable SimpleOrderedPair<ImmutableList<V>,C>	VertexSequenceFinder.findVertexSequence(@NonNull V start, @NonNull V goal, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds a vertex sequence from start to goal.
default @Nullable OrderedPair<ImmutableList<V>,C>	VertexSequenceFinder.findVertexSequence(@NonNull V start, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds a vertex sequence from a start vertex to a vertex that satisfies the goal predicate.
@Nullable SimpleOrderedPair<ImmutableList<V>,C>	VertexSequenceFinder.findVertexSequence(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Finds a vertex sequence from a set of start vertices to a vertex that satisfies the goal predicate.
boolean	ReachabilityChecker.isReachable(@NonNull V start, @NonNull V goal, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Checks if a vertex sequence from start to goal exists.
boolean	ReachabilityChecker.isReachable(@NonNull V start, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Checks if a vertex sequence from a start vertex to a vertex that satisfies the goal predicate exists.
boolean	ReachabilityChecker.isReachable(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)	Checks if a vertex sequence from a set of start vertices to a vertex that satisfies the goal predicate exists.
boolean	SimpleReachabilityChecker.isReachable(@NonNull V start, @NonNull V goal, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)
boolean	SimpleReachabilityChecker.isReachable(@NonNull V start, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)
boolean	SimpleReachabilityChecker.isReachable(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C costLimit, @NonNull AddToSet<V> visited)

Method parameters in org.jhotdraw8.graph.path with type arguments of type AddToSet

Modifier and Type	Method	Description
@Nullable OrderedPair<ImmutableList<Arc<V,A>>,C>	ArcSequenceFinder.findArcSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)	Finds an arc sequence through the given waypoints.
@Nullable OrderedPair<ImmutableList<Arc<V,A>>,C>	SimpleCombinedSequenceFinder.findArcSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)
@Nullable SimpleOrderedPair<ImmutableList<A>,C>	ArrowSequenceFinder.findArrowSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)	Finds an arrow sequence through the given waypoints.
@Nullable SimpleOrderedPair<ImmutableList<A>,C>	SimpleCombinedSequenceFinder.findArrowSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)
@Nullable SimpleOrderedPair<ImmutableList<V>,C>	SimpleCombinedSequenceFinder.findVertexSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)
@Nullable SimpleOrderedPair<ImmutableList<Integer>,C>	SimpleIndexedVertexSequenceFinder.findVertexSequenceOverWaypoints(@NonNull Iterable<Integer> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<Integer>> visitedSetFactory)
@Nullable SimpleOrderedPair<ImmutableList<V>,C>	SimpleVertexSequenceFinder.findVertexSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)
@Nullable SimpleOrderedPair<ImmutableList<V>,C>	VertexSequenceFinder.findVertexSequenceOverWaypoints(@NonNull Iterable<V> waypoints, int maxDepth, @NonNull C costLimit, @NonNull Supplier<AddToSet<V>> visitedSetFactory)	Finds a vertex sequence through the given waypoints.

Uses of AddToSet in org.jhotdraw8.graph.path.algo

Methods in org.jhotdraw8.graph.path.algo with parameters of type AddToSet

Modifier and Type	Method	Description
@Nullable ArcBackLinkWithCost<V,A,C>	AnyArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable ArcBackLink<V,A>	AnyArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, @NonNull AddToSet<V> visited, int maxDepth)	Search engine method.
@Nullable ArcBackLinkWithCost<V,A,C>	AnyShortestArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	AnyShortestVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	AnyVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
protected @Nullable VertexBackLink<V>	AnyVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, @NonNull AddToSet<V> visited, int maxDepth)	Search engine method.
@Nullable ArcBackLinkWithCost<V,A,C>	ArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable ArcBackLinkWithCost<V,A,C>	UniqueArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable ArcBackLinkWithCost<V,A,C>	UniqueOnAcyclicGraphArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	UniqueOnAcyclicGraphVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	UniqueOrOneHopVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)
@Nullable VertexBackLinkWithCost<V,C>	UniqueOrOneHopVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, @NonNull AddToSet<V> visited, int maxDepth, @NonNull C zero, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction)	Search engine method.
@Nullable ArcBackLinkWithCost<V,A,C>	UniqueShortestArcPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<Arc<V,A>>> nextArcsFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function3<V,V,A,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	UniqueShortestVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVertices, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	UniqueVertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
@Nullable VertexBackLinkWithCost<V,C>	VertexPathSearchAlgo.search(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, @NonNull Function<V,Iterable<V>> nextVerticesFunction, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.
boolean	VertexReachabilityAlgo.tryToReach(@NonNull Iterable<V> startVertices, @NonNull Predicate<V> goalPredicate, int maxDepth, @NonNull C zero, @NonNull C costLimit, @NonNull Function<V,Iterable<V>> nextVerticesFunction, @NonNull BiFunction<V,V,C> costFunction, @NonNull BiFunction<C,C,C> sumFunction, @NonNull AddToSet<V> visited)	Search engine method.