kevin-wayne/algs4

Features

• Data Structure Implementations - Provides a comprehensive reference collection of fundamental data structure implementations including stacks, queues, and graphs.
• Algorithmic Reference Implementations - Provides standardized reference implementations of fundamental sorting, searching, and graph algorithms for educational use.
• Algorithm Reference Libraries - Serves as a comprehensive collection of standard algorithm implementations and data structures for educational reference.
• Indexed - Provides an indexed priority queue to efficiently retrieve and update elements associated with integer indices.
• Graph Theory - Offers a mathematical framework for representing graphs and performing traversals and pathfinding.
• Graph Cycle Detection - Includes algorithms to determine if a directed graph contains cycles.
• Graph Topology Analysis - Traverses networks to analyze structural properties such as cycles, strong components, and planarity.
• Hash Tables - Implements a hash table symbol table using separate chaining for constant-time key-value lookups.
• Linear Probing Implementations - Implements a symbol table using linear probing to resolve hash collisions in an array.
• Adjacency Lists - Provides an adjacency list implementation for representing graphs and optimizing network traversal.
• Sorted Sets - Implements a sorted integer set using a sorted array for fast membership queries and rank lookups.
• Divide And Conquer Algorithms - Implements recursive divide-and-conquer algorithms for efficient sorting and searching of data.
• Graph Traversal Algorithms - Provides implementations for visiting vertices in graphs using depth-first and breadth-first searches.
• Resizable Array Collections - Provides resizable array collections that maintain amortized constant time for data storage.
• Balanced Search Trees - Implements self-balancing binary search trees to maintain logarithmic time complexity for membership lookups.
• AVL Tree Operations - Provides a symbol table implementation using self-balancing AVL trees for efficient key-value retrieval.
• Graph Algorithm Utilities - Offers auxiliary graph operations including vertex degree calculation and edge management.
• Connected Component Analysis - Implements algorithms for grouping nodes in undirected graphs into connected components.
• Sorting Algorithms - Includes a wide suite of educational sorting implementations including quicksort, mergesort, and heapsort.
• Curriculum Implementation Sources - Provides the full set of source code and libraries used as the implementation reference for a standard algorithms textbook.
• FIFO Queues - Implements a first-in-first-out queue using a resizing array for amortized constant time operations.
• Java Utility Libraries - Provides a comprehensive library of reference data structures, such as stacks and symbol tables, implemented in Java.
• LIFO Stacks - Implements a last-in-first-out stack for managing a collection of generic items with constant-time operations.
• Heaps - Implements binary heaps to provide a min-priority queue for efficient removal of the minimum element.
• Sorted Array Symbol Tables - Implements a symbol table using sorted arrays to support fast retrieval and range queries.
• Data Structure Implementations - Implements fundamental containers like priority queues, symbol tables, and stacks to manage data efficiently.
• Graph Pathfinding Algorithms - Algorithms and Data Structures finds the longest paths from a single source to all other vertices in directed acyclic graphs.
• Network Graph Analysis - Analyzes network topology and computes shortest paths or connectivity in directed and undirected graphs.
• Shortest Path Algorithms - Implements algorithms to calculate paths from a source vertex to all reachable vertices.
• Topological Sorting - Produces a linear ordering of vertices for acyclic directed graphs.
• Multiset Implementations - Implements a generic bag collection as a multiset using a singly linked list.
• Disjoint Set Union - Provides a disjoint-set union data structure for tracking and merging non-overlapping sets.
• Hash Tables - Implements hash tables using separate chaining with linked lists to resolve collisions.
• Heaps - Implements binary heaps to provide a max-priority queue for extracting the largest element.
• Singly - Provides a singly-linked list implementation for constant-time insertion and iteration of generic items.
• Priority Heaps - Implements a binary heap to provide efficient extraction of minimum or maximum elements in a priority queue.
• Sorting Algorithms - Provides high-performance sorting implementations including three-pivot quicksort and Timsort.
• Quicksorts - Implements an optimized quicksort featuring 3-way partitioning and adaptive pivot selection.
• Linear Regression - Provides linear regression capabilities to estimate response variables based on predictor values.
• Negative Cycle Detection - Identifies negative cycles in directed graphs, useful for finding currency arbitrage opportunities.
• Full-Text Inverted Indexes - Implements an inverted index that maps individual words to the files containing them for fast document retrieval.
• User Rank Retrievals - Implements rank-based retrieval to locate keys based on their relative order or specific numerical position.
• Node Reachability Analyses - Provides algorithms to determine reachability between nodes in a directed graph using depth-first search.
• Order-Based Lookups - Provides capabilities to find minimum, maximum, floor, and ceiling keys within sorted symbol tables.
• Search and Indexing - Builds inverted indexes and filters text streams to enable fast word retrieval and document search.
• Algorithmic Performance Comparison - Measures execution time and CPU usage to analyze the growth rate and scaling of different algorithms.
• Network Flow Algorithms - Computes maximum flow and minimum-cost flow using network simplex and bipartite matching.
• Eulerian Tour Algorithms - Implements algorithms to identify Eulerian cycles that visit every edge in a directed graph exactly once.
• Wall-Clock Time Measurement - Measures total elapsed wall-clock time between timer initialization and request.
• Bipartite Analysis - Detects whether an undirected graph is bipartite or contains an odd-length cycle.
• Inversion Counting Algorithms - Implements an inversion counting algorithm using a modified mergesort to identify out-of-order pairs in a sequence.
• Computational Geometry - Provides tools for representing points and intervals to calculate intersections and spatial orientations.
• Statistical Metric Calculators - Calculates mathematical metrics from datasets to analyze trends and patterns in numerical information.
• Online Running Statistics - Implements one-pass algorithms for tracking mean, sample standard deviation, and variance of a real number stream.
• Sparse Vector Storage - Implements d-dimensional mathematical vectors using symbol tables of nonzero coordinates to optimize memory.
• Vector Operations - Provides mathematical primitives for vector arithmetic including dot products, addition, and scalar products.
• Sorted Array Merging - Provides a mechanism to merge multiple sorted input streams into a single sorted output using a priority queue.
• Trie Data Structures - Uses tries and radix sorts for efficient string storage, sorting, and prefix-based lookups.
• CPU Time Profiling - Tracks actual processor time consumed by specific threads to evaluate computational efficiency.

Historique des stars