Uses of Package
org.episteme.core.mathematics.discrete

Packages that use org.episteme.core.mathematics.discrete

Package	Description
org.episteme.core.mathematics.discrete
org.episteme.core.mathematics.discrete.generators
org.episteme.core.mathematics.discrete.graph	Provides pluggable traversal algorithms for graphs with optional
org.episteme.core.mathematics.discrete.graph.flow
org.episteme.core.mathematics.discrete.graph.providers
org.episteme.core.mathematics.geometry.csg.d2
org.episteme.core.mathematics.geometry.polyhedra
org.episteme.core.mathematics.ml
org.episteme.natural.biology.phylogeny	Biological modeling, genetics, and life science simulations.
org.episteme.natural.chemistry
org.episteme.social.economics	Provides comprehensive mathematical models for economic systems, agent-based modeling, and financial analysis.
org.episteme.social.philosophy.storytelling	Provides the org.episteme.social.philosophy.storytelling module.
org.episteme.social.sociology	- social structures, persons, and cultural modeling.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.discrete

Class	Description
AStarHeuristic	Heuristic function for A* search.
AStarSearch	A* search algorithm for heuristic-guided shortest path finding.
BellmanFordShortestPath	Bellman-Ford algorithm for single-source shortest paths.
DijkstraShortestPath	Dijkstra's algorithm for finding the shortest paths in a weighted graph.
FloydWarshallShortestPath	Floyd-Warshall algorithm for all-pairs shortest paths.
Graph	Represents a mathematical graph G = (V, E).
Graph.Edge	Represents an edge in a graph.
GraphWeightAdapter	Adapter for handling generic edge weights in graph algorithms.
KruskalMinimumSpanningTree	Kruskal's algorithm for finding Minimum Spanning Tree.
MinimumSpanningTree	Interface for Minimum Spanning Tree (MST) algorithms.
PrimMinimumSpanningTree	Implementation of Prim's algorithm for finding the Minimum Spanning Tree. *
RootedTree	A mutable implementation of a rooted tree.
ShortestPathResult	Result of a shortest path computation.
Tree	Represents a tree data structure - a connected acyclic graph.
TuringMachine.Direction
WeightedEdge	An edge in a weighted graph.
WeightedGraph	A graph with weighted edges.
WeightedGraphBuilder	Fluent builder for weighted graphs.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.discrete.generators

Class	Description
Graph	Represents a mathematical graph G = (V, E).

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.discrete.graph

Class	Description
Graph	Represents a mathematical graph G = (V, E).

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.discrete.graph.flow

Class	Description
WeightedGraph	A graph with weighted edges.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.discrete.graph.providers

Class	Description
Graph	Represents a mathematical graph G = (V, E).

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.geometry.csg.d2

Class	Description
Graph.Edge	Represents an edge in a graph.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.geometry.polyhedra

Class	Description
Graph	Represents a mathematical graph G = (V, E).
Graph.Edge	Represents an edge in a graph.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.core.mathematics.ml

Class	Description
DirectedWeightedGraph	Adjacency list implementation of a directed weighted graph.
Graph	Represents a mathematical graph G = (V, E).
WeightedGraph	A graph with weighted edges.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.natural.biology.phylogeny

Class	Description
Tree	Represents a tree data structure - a connected acyclic graph.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.natural.chemistry

Class	Description
Graph	Represents a mathematical graph G = (V, E).
Graph.Edge	Represents an edge in a graph.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.social.economics

Class	Description
RootedTree	A mutable implementation of a rooted tree.
Tree	Represents a tree data structure - a connected acyclic graph.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.social.philosophy.storytelling

Class	Description
Graph	Represents a mathematical graph G = (V, E).
Graph.Edge	Represents an edge in a graph.

Classes in org.episteme.core.mathematics.discrete used by org.episteme.social.sociology

Class	Description
Graph	Represents a mathematical graph G = (V, E).
Graph.Edge	Represents an edge in a graph.
WeightedEdge	An edge in a weighted graph.
WeightedGraph	A graph with weighted edges.