A B C D E F G H I K L M N O P Q R S T V

F

finalResult(Iterable<Position>) - Method in class net.datastructures.FindCycleDFS

finalResult(Iterable<Position>) - Method in class net.datastructures.FindPathDFS

find(K) - Method in class net.datastructures.BinarySearchTree

Returns an entry containing the given key.

find(K) - Method in interface net.datastructures.Dictionary

Returns an entry containing the given key, or null if no such entry exists.

findAll(K) - Method in class net.datastructures.BinarySearchTree

Returns an iterable collection of all the entries containing the given key.

findAll(K) - Method in interface net.datastructures.Dictionary

Returns an iterator containing all the entries containing the given key, or an empty iterator if no such entries exist.

FindCycleDFS<V,E> - Class in net.datastructures

This class specializes DFS to find a cycle.

FindCycleDFS() - Constructor for class net.datastructures.FindCycleDFS

FindPathDFS<V,E> - Class in net.datastructures

Class specializing DFS to find a path between a start vertex and a target vertex.

FindPathDFS() - Constructor for class net.datastructures.FindPathDFS

first() - Method in class net.datastructures.NodePositionList

Returns the first position in the list; O(1) time

first() - Method in interface net.datastructures.PositionList

Returns the first node in the list.

forEachToString(PositionList<E>) - Static method in class net.datastructures.NodePositionList

Returns a textual representation of a given node list using for-each

front() - Method in class net.datastructures.NodeQueue

Inspects the element at the front of the queue.

front() - Method in interface net.datastructures.Queue

Inspects the element at the front of the queue.

FullStackException - Exception in net.datastructures

Runtime exception thrown when the capacity of the array used by an ArrayStack has been exceeded.

FullStackException(String) - Constructor for exception net.datastructures.FullStackException