Uses of Class
edu.princeton.cs.algorithms.Graph

Uses of Graph in edu.princeton.cs.algorithms

Methods in edu.princeton.cs.algorithms that return Graph

Modifier and Type	Method and Description
static Graph	GraphGenerator.binaryTree(int V) Returns a complete binary tree graph on V vertices.
static Graph	GraphGenerator.bipartite(int V1, int V2, double p) Returns a random simple bipartite graph on V1 and V2 vertices, containing each possible edge with probability p.
static Graph	GraphGenerator.bipartite(int V1, int V2, int E) Returns a random simple bipartite graph on V1 and V2 vertices with E edges.
static Graph	GraphGenerator.complete(int V) Returns the complete graph on V vertices.
static Graph	GraphGenerator.completeBipartite(int V1, int V2) Returns a complete bipartite graph on V1 and V2 vertices.
static Graph	GraphGenerator.cycle(int V) Returns a cycle graph on V vertices.
Graph	SymbolGraph.G() Returns the graph assoicated with the symbol graph.
static Graph	GraphGenerator.path(int V) Returns a path graph on V vertices.
static Graph	GraphGenerator.regular(int V, int k) Returns a uniformly random k-regular graph on V vertices (not necessarily simple).
static Graph	GraphGenerator.simple(int V, double p) Returns a random simple graph on V vertices, with an edge between any two vertices with probability p.
static Graph	GraphGenerator.simple(int V, int E) Returns a random simple graph containing V vertices and E edges.
static Graph	GraphGenerator.star(int V) Returns a star graph on V vertices.
static Graph	GraphGenerator.tree(int V) Returns a uniformly random tree on V vertices.
static Graph	GraphGenerator.wheel(int V) Returns a wheel graph on V vertices.

Constructors in edu.princeton.cs.algorithms with parameters of type Graph

Constructor and Description
Bipartite(Graph G) Determines whether an undirected graph is bipartite and finds either a bipartition or an odd-length cycle.
BreadthFirstPaths(Graph G, int s) Computes the shortest path between the source vertex s and every other vertex in the graph G.
BreadthFirstPaths(Graph G, Iterable<Integer> sources) Computes the shortest path between any one of the source vertices in sources and every other vertex in graph G.
CC(Graph G) Computes the connected components of the undirected graph G.
Cycle(Graph G) Determines whether the undirected graph G has a cycle and, if so, finds such a cycle.
DepthFirstPaths(Graph G, int s) Computes a path between s and every other vertex in graph G.
DepthFirstSearch(Graph G, int s) Computes the vertices in graph G that are connected to the source vertex s.
Graph(Graph G) Initializes a new graph that is a deep copy of G.