Package org.metasyntactic.math

Interface Summary
DirectedGraph  
Function  
Graph A Graph G is a pair (V, E), where V is a finite set and E is a binary relation on V.
Graph.Edge  
Graph.Path A path of length k from a vertex u to a vertex u' in a Graph G = (V, E) is a sequence ⟨v0, v1, 2, …, vk⟩ of vertices such that u = v0, u' = vk, and (vi-1, vi) ∈ E for i = 1, 2, …, k.
Predicate  
UndirectedGraph In an undirected graph G = (V, E), the edge set E consists of unordered pairs of vertices, rather then ordered pairs.
 

Class Summary
AbstractGraph  
Alphabet  
BigDecimalUtilities  
BigInteger Immutable arbitrary-precision integers.
BigIntegerFactory  
Complex The lack of built-in complex arithmetic in Java is a nuisance for numerical work.
Counting  
DirectedGraph.DirectedEdge  
DirectedGraphFactory This class can for any V, E generate G such that G = (V, E)
Edge  
Fraction  
Functions Simple alternative mathematical functions.
Tuple In languages, a data object containing two or more components.
UndirectedGraphFactory  
 

Exception Summary
NonExistentInverseException