Index

A B C D E F G H I K M N O P R S T U V W 
All Classes and Interfaces|All Packages

A

acyclic(WeightedGraph<V, E>, V, BinaryOperator<E>, E, Comparator<E>) - Static method in class com.phasmidsoftware.gryphon.java.ShortestPaths
Runs the acyclic shortest-paths algorithm with a custom edge attribute type.
acyclic(WeightedGraph<V, Double>, V) - Static method in class com.phasmidsoftware.gryphon.java.ShortestPaths
Runs the acyclic shortest-paths algorithm on a directed acyclic graph whose edges carry Double weights.
addEdge(Edge<V>) - Method in class com.phasmidsoftware.gryphon.java.Graph
Adds an edge to this graph.
addEdge(Edge<V>) - Method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Adds an unweighted edge.
addEdge(WeightedEdge<V, E>) - Method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Adds a typed weighted edge to this graph.
addEdge(V, V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Adds an unweighted edge between from and to.
addVertex(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Adds an isolated vertex to this graph.
attribute() - Method in class com.phasmidsoftware.gryphon.java.WeightedEdge
Returns the attribute (weight) of this edge.

B

bellmanFord(WeightedGraph<V, E>, V, BinaryOperator<E>, E, Comparator<E>) - Static method in class com.phasmidsoftware.gryphon.java.ShortestPaths
Runs the Bellman-Ford algorithm with a custom edge attribute type.
bellmanFord(WeightedGraph<V, Double>, V) - Static method in class com.phasmidsoftware.gryphon.java.ShortestPaths
Runs the Bellman-Ford algorithm on a graph whose edges carry Double weights.
bfs(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Performs a breadth-first search from start.
bfs(V, Function<V, Iterable<V>>) - Method in class com.phasmidsoftware.gryphon.java.Graph
Performs a breadth-first search from start using a custom neighbour function.
bfsUntil(V, Predicate<V>) - Method in class com.phasmidsoftware.gryphon.java.Graph
Performs a breadth-first search from start, stopping as soon as goal holds for a discovered vertex.
boruvka(WeightedGraph<V, E>, Comparator<E>) - Static method in class com.phasmidsoftware.gryphon.java.MinimumSpanningTree
Runs Borůvka's algorithm with a custom edge attribute type, ordered by the supplied Comparator.
boruvka(WeightedGraph<V, Double>) - Static method in class com.phasmidsoftware.gryphon.java.MinimumSpanningTree
Runs Borůvka's algorithm on a graph whose edges carry Double weights.

C

com.phasmidsoftware.gryphon.java - package com.phasmidsoftware.gryphon.java
 
componentIds(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.ConnectedComponents
Returns a map from each vertex to its integer component id.
components(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.ConnectedComponents
Returns the vertices grouped by component as a Map<Integer, Set<V>>.
components(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.StronglyConnectedComponents
Returns the vertices grouped by SCC as a Map<Integer, Set<V>>.
connect(V, V) - Method in class com.phasmidsoftware.gryphon.java.Connectivity
Merges the components containing v1 and v2.
ConnectedComponents - Class in com.phasmidsoftware.gryphon.java
Java façade for connected-components analysis on undirected graphs.
Connectivity<V> - Class in com.phasmidsoftware.gryphon.java
A mutable façade over Gryphon's purely functional disjoint-set implementations, providing a Java-idiomatic API for connectivity queries.
count(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.ConnectedComponents
Returns the number of connected components in the graph.
count(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.StronglyConnectedComponents
Returns the number of strongly connected components in the graph.
createLazy(List<V>) - Static method in class com.phasmidsoftware.gryphon.java.Connectivity
Creates a Connectivity using Weighted Quick Union (O(log n)).
createLazy(V...) - Static method in class com.phasmidsoftware.gryphon.java.Connectivity
Convenience overload accepting varargs.
createOptimized(List<V>) - Static method in class com.phasmidsoftware.gryphon.java.Connectivity
Creates a Connectivity using Weighted Quick Union with path compression (amortized near-O(1)).
createOptimized(V...) - Static method in class com.phasmidsoftware.gryphon.java.Connectivity
Convenience overload accepting varargs, using path compression.

D

degree(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the degree of vertex: the number of edges incident to it.
dfs(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Performs a depth-first search from start.
dfs(V, Function<V, Iterable<V>>) - Method in class com.phasmidsoftware.gryphon.java.Graph
Performs a depth-first search from start using a custom neighbour function.
dfsAll() - Method in class com.phasmidsoftware.gryphon.java.Graph
Performs a depth-first search over every component of the graph.
dijkstra(WeightedGraph<V, E>, V, BinaryOperator<E>, E, Comparator<E>) - Static method in class com.phasmidsoftware.gryphon.java.ShortestPaths
Runs Dijkstra's algorithm with a custom edge attribute type.
dijkstra(WeightedGraph<V, Double>, V) - Static method in class com.phasmidsoftware.gryphon.java.ShortestPaths
Runs Dijkstra's algorithm on a graph whose edges carry Double weights.
directed() - Static method in class com.phasmidsoftware.gryphon.java.Graph
Creates an empty directed graph.
directedFromResource(String) - Static method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Reads a directed weighted graph with Integer vertices and Double edge weights from a classpath resource.
directedFromResource(String, Function<String, V>, Function<String, E>) - Static method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Reads a directed weighted graph from a classpath resource using custom vertex and edge parsers.
directedWeighted() - Static method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Creates an empty directed weighted graph.

E

Edge<V> - Class in com.phasmidsoftware.gryphon.java
Represents an unweighted directed or undirected edge between two vertices.
Edge(V, V) - Constructor for class com.phasmidsoftware.gryphon.java.Edge
Constructs an edge from from to to.
edges() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns all edges in this graph.
edgesFrom(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the edges incident from vertex.
equals(Object) - Method in class com.phasmidsoftware.gryphon.java.Edge
 
equals(Object) - Method in class com.phasmidsoftware.gryphon.java.WeightedEdge
 

F

from() - Method in class com.phasmidsoftware.gryphon.java.Edge
Returns the source vertex of this edge.

G

getComponent(V) - Method in class com.phasmidsoftware.gryphon.java.Connectivity
Returns the representative (root) of the component containing key.
Graph<V> - Class in com.phasmidsoftware.gryphon.java
A mutable, lazily-materialised façade over Gryphon's purely functional graph types.

H

hashCode() - Method in class com.phasmidsoftware.gryphon.java.Edge
 
hashCode() - Method in class com.phasmidsoftware.gryphon.java.WeightedEdge
 

I

inDegree(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the in-degree of vertex: the number of edges arriving at it.
isBipartite() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns whether the vertices can be two-coloured so that no edge joins two vertices of the same colour.
isConnected() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns whether every vertex is reachable from every other.
isConnected(V, V) - Method in class com.phasmidsoftware.gryphon.java.Connectivity
Returns true if v1 and v2 belong to the same component.
isCyclic() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns whether this graph contains a cycle.
isDAG(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.TopologicalSort
Returns true if the graph is a DAG (contains no directed cycle).
isDirected() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns whether this graph is directed.

K

kosaraju(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.StronglyConnectedComponents
Computes the strongly connected components of a directed graph using Kosaraju's algorithm.
kruskal(WeightedGraph<V, E>, Comparator<E>) - Static method in class com.phasmidsoftware.gryphon.java.MinimumSpanningTree
Runs Kruskal's algorithm with a custom edge attribute type, ordered by the supplied Comparator.
kruskal(WeightedGraph<V, Double>) - Static method in class com.phasmidsoftware.gryphon.java.MinimumSpanningTree
Runs Kruskal's algorithm on a graph whose edges carry Double weights.

M

maxDegree() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the largest degree of any vertex.
meanDegree() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the mean degree, 2M/N.
MinimumSpanningTree - Class in com.phasmidsoftware.gryphon.java
Java façade for minimum spanning tree algorithms on weighted undirected graphs.

N

neighbours(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the neighbours of vertex.
numberOfSelfLoops() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the number of self-loops: edges whose endpoints are the same vertex.

O

of(V, V) - Static method in class com.phasmidsoftware.gryphon.java.Edge
Creates a new Edge from from to to.
of(V, V, E) - Static method in class com.phasmidsoftware.gryphon.java.WeightedEdge
Creates a new WeightedEdge.
order() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the number of vertices — N in Sedgewick's notation.
outDegree(V) - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the out-degree of vertex: the number of edges leaving it.

P

prim(WeightedGraph<V, E>, V, Comparator<E>) - Static method in class com.phasmidsoftware.gryphon.java.MinimumSpanningTree
Runs Prim's algorithm with a custom edge attribute type, ordered by the supplied Comparator.
prim(WeightedGraph<V, Double>, V) - Static method in class com.phasmidsoftware.gryphon.java.MinimumSpanningTree
Runs Prim's algorithm on a graph whose edges carry Double weights.
put(V) - Method in class com.phasmidsoftware.gryphon.java.Connectivity
Adds key as a new singleton component.

R

reverse() - Method in class com.phasmidsoftware.gryphon.java.Edge
Returns an edge with the endpoints swapped.
reverse() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns a new directed graph with all edge directions reversed.
reverse() - Method in class com.phasmidsoftware.gryphon.java.WeightedEdge
Returns a WeightedEdge with the endpoints swapped, preserving the attribute.

S

ShortestPaths - Class in com.phasmidsoftware.gryphon.java
Java façade for shortest-path algorithms on weighted directed graphs.
size() - Method in class com.phasmidsoftware.gryphon.java.Connectivity
Returns the number of disjoint components (not the number of vertices).
size() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns the number of edges — M in Sedgewick's notation.
sort(Graph<V>) - Static method in class com.phasmidsoftware.gryphon.java.TopologicalSort
Computes a topological ordering of the vertices in a directed graph.
StronglyConnectedComponents - Class in com.phasmidsoftware.gryphon.java
Java façade for strongly-connected-components analysis on directed graphs, using Kosaraju's two-pass algorithm.

T

to() - Method in class com.phasmidsoftware.gryphon.java.Edge
Returns the target vertex of this edge.
TopologicalSort - Class in com.phasmidsoftware.gryphon.java
Java façade for topological sorting of directed acyclic graphs (DAGs).
toString() - Method in class com.phasmidsoftware.gryphon.java.Connectivity
Returns a human-readable summary of this Connectivity.
toString() - Method in class com.phasmidsoftware.gryphon.java.Edge
 
toString() - Method in class com.phasmidsoftware.gryphon.java.Graph
 
toString() - Method in class com.phasmidsoftware.gryphon.java.WeightedEdge
 
toString() - Method in class com.phasmidsoftware.gryphon.java.WeightedGraph
 

U

undirected() - Static method in class com.phasmidsoftware.gryphon.java.Graph
Creates an empty undirected graph.
undirectedFromResource(String) - Static method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Reads an undirected weighted graph with Integer vertices and Double edge weights from a classpath resource.
undirectedFromResource(String, Function<String, V>, Function<String, E>) - Static method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Reads an undirected weighted graph from a classpath resource using custom vertex and edge parsers.
undirectedWeighted() - Static method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Creates an empty undirected weighted graph.

V

vertices() - Method in class com.phasmidsoftware.gryphon.java.Graph
Returns all vertices in this graph as an unmodifiable set.

W

WeightedEdge<V,E> - Class in com.phasmidsoftware.gryphon.java
Represents a weighted edge between two vertices, carrying an attribute of type E.
WeightedEdge(V, V, E) - Constructor for class com.phasmidsoftware.gryphon.java.WeightedEdge
Constructs a weighted edge from from to to with the given attribute.
weightedEdges() - Method in class com.phasmidsoftware.gryphon.java.WeightedGraph
Returns the typed weighted edge list — each edge stored once, as originally added, with full type information preserved.
WeightedGraph<V,E> - Class in com.phasmidsoftware.gryphon.java
A mutable, lazily-materialised façade over Gryphon's purely functional graph types, with a typed edge attribute E.
A B C D E F G H I K M N O P R S T U V W 
All Classes and Interfaces|All Packages