Uses of Class
info.debatty.java.graphs.Graph

Packages that use Graph

Package	Description
info.debatty.java.graphs
info.debatty.java.graphs.build

Uses of Graph in info.debatty.java.graphs

Methods in info.debatty.java.graphs that return types with arguments of type Graph

Modifier and Type	Method and Description
ArrayList<Graph<T>>	Graph.connectedComponents() Split the graph in connected components (usually you will first prune the graph to remove "weak" edges).
ArrayList<Graph<T>>	Graph.stronglyConnectedComponents() Computes the strongly connected sub-graphs (where every node is reachable from every other node) using Tarjan's algorithm, which has computation cost O(n).

Methods in info.debatty.java.graphs with parameters of type Graph

Modifier and Type	Method and Description
int	Graph.compare(Graph<T> other) Count the number of edges/neighbors that are the same (based on similarity) in both graphs.

Constructors in info.debatty.java.graphs with parameters of type Graph

Constructor and Description
Dijkstra(Graph graph, T source) Compute the shortest path from source node to every other node in the graph.
Graph(Graph<T> origin) Copy constructor.

Uses of Graph in info.debatty.java.graphs.build

Methods in info.debatty.java.graphs.build that return Graph

Modifier and Type	Method and Description
Graph<T>	GraphBuilder.computeGraph(List<T> nodes) Compute the graph.
protected Graph<T>	PartitioningGraphBuilder.computeGraph(List<T> nodes, int k, SimilarityInterface<T> similarity)
protected Graph<T>	Brute.computeGraph(List<T> nodes, int k, SimilarityInterface<T> similarity)
protected Graph<T>	ThreadedBrute.computeGraph(List<T> nodes, int k, SimilarityInterface<T> similarity)
protected abstract Graph<T>	GraphBuilder.computeGraph(List<T> nodes, int k, SimilarityInterface<T> similarity)
protected Graph<T>	ThreadedNNDescent.nndescent(List<T> nodes, SimilarityInterface<T> similarity)
protected Graph<T>	NNDescent.nndescent(List<T> nodes, SimilarityInterface<T> similarity)