Package org.episteme.core.mathematics.discrete
package org.episteme.core.mathematics.discrete
-
ClassDescriptionAStarHeuristic<V,
W> Heuristic function for A* search.AStarSearch<V,W> A* search algorithm for heuristic-guided shortest path finding.Bellman-Ford algorithm for single-source shortest paths.Combinatorial functions and utilities.Provides algorithms for detecting communities in graphs.DefaultWeightedEdge<V,W> Default implementation of a weighted edge.DijkstraShortestPath<V,W> Dijkstra's algorithm for finding the shortest paths in a weighted graph.Adjacency list implementation of a directed weighted graph.FiniteAutomaton<S,A> Deterministic Finite Automaton (DFA).Floyd-Warshall algorithm for all-pairs shortest paths.Graph<V>Represents a mathematical graph G = (V, E).Graph.Edge<V>Represents an edge in a graph.Graph algorithms including traversal, shortest paths, and connectivity.Adapter for handling generic edge weights in graph algorithms.Kruskal's algorithm for finding Minimum Spanning Tree.MinimumSpanningTree<V,W> Interface for Minimum Spanning Tree (MST) algorithms.NetworkGraph<V>High-level graph implementation optimized for network visualization and social analysis.Implementation of Prim's algorithm for finding the Minimum Spanning Tree. *PushdownAutomaton<S,A, G> Pushdown Automaton (PDA).RootedTree<V>A mutable implementation of a rooted tree.ShortestPathResult<V,W> Result of a shortest path computation.High-performance bit-parallel text matching algorithms.Tree<V>Represents a tree data structure - a connected acyclic graph.TuringMachine<S,T> Turing Machine (TM).Adjacency list implementation of an undirected graph.WeightedEdge<V,W> An edge in a weighted graph.WeightedGraph<V,W> A graph with weighted edges.WeightedGraphBuilder<V,W> Fluent builder for weighted graphs.