All Classes
-
All Classes Interface Summary Class Summary Class Description AdjacencyListSeamFinder Adjacency list graph single-sourceShortestPathSolverimplementation of theSeamFinderinterface.AdjacencyListSeamFinder.PixelGraph Adjacency list graph ofAdjacencyListSeamFinder.PixelGraph.Pixelvertices andEnergyFunction-weighted edges.AStarGraph<V> Directed, edge-weighted graph with a heuristic function to estimate distances between vertices.AStarSolver<V> A* search implementation for single-pair shortest paths in anAStarGraph.Autocomplete Suggest exact-character prefix matches for any queryCharSequence.BinarySearchAutocomplete Binary search implementation of theAutocompleteinterface.Cities Search the world's cities.CitiesInputSizeExperiments Run timing experiments and save a CSV file for eachAutocompleteimplementation.CitiesMultiTest Compare differentAutocompleteimplementations to check that they compute the same values.DijkstraSolver<V> Dijkstra's algorithm implementation of theShortestPathSolverinterface.DNA Search DNA by autocompleting across all suffixes.DoubleMapMinPQ<T> DualGradientEnergyFunction Dual-gradient implementation of theEnergyFunctioninterface forPictureobjects.DynamicProgrammingSeamFinder Dynamic programming implementation of theSeamFinderinterface.Edge<V> Weighted, directed edge.EnergyFunction Determines the energy of a given (x, y) pixel index in aPicture.ExtrinsicMinPQ<T> Priority queue where objects have extrinsic priority.GenerativeSeamFinder Generative adjacency list graph single-sourceShortestPathSolverimplementation of theSeamFinderinterface.GenerativeSeamFinder.PixelGraph Generative adjacency list graph ofGenerativeSeamFinder.PixelGraph.Pixelvertices andEnergyFunction-weighted edges.Graph<V> Directed, edge-weighted graph.HeapMinPQ<T> PriorityQueueimplementation of theExtrinsicMinPQinterface.MapGraph AStarGraphof places asPointvertices and streets edges weighted by physical distance.MapServer Run thehuskymapsserver.Moderator Simulate a content moderation priority queue with "streaming" data.ModeratorMultiTest Compare differentExtrinsicMinPQimplementations to check that they compute the same values.Node A node in a graph representation of a picture.OptimizedHeapMinPQ<T> Optimized binary heap implementation of theExtrinsicMinPQinterface.Picture A digital picture represented as red-green-blue colorintpixels.PriorityNode<T> Represents the item-priority pair for use inExtrinsicMinPQimplementations.SeamCarver Seam carving, an approach for content-aware image resizing.SeamFinder Finds a horizontal seam through thePicturewith the lowest sum ofEnergyFunctioncosts.SeamFinderInputSizeExperiments Run timing experiments and save a CSV file for eachSeamFinderimplementation.SeamFinderMultiTest Compare differentSeamFinderimplementations to check that they compute the same values.SequentialSearchAutocomplete Sequential search implementation of theAutocompleteinterface.ShortestPathSolver<V> Single-source shortest paths from a start vertex to all reachable vertices.ShortestPathSolver.Constructor<V> Constructor forShortestPathSolver.SuffixCollection Generates all (length - 1) suffixes of the given sequence of characters and presents them in a collection.TernarySearchTreeAutocomplete Ternary search tree (TST) implementation of theAutocompleteinterface.TernarySearchTreeAutocomplete.Node A search tree node representing a single character in an autocompletion term.ToposortDAGSolver<V> Topological sorting implementation of theShortestPathSolverinterface for directed acyclic graphs.TreeSetAutocomplete TreeSetimplementation of theAutocompleteinterface.UnsortedArrayMinPQ<T> Unsorted array (orArrayList) implementation of theExtrinsicMinPQinterface.