Uses of Class
algs41.Graph

Packages that use Graph

Package	Description
algs41

Uses of Graph in algs41

Fields in algs41 declared as Graph

Modifier and Type	Field	Description
private final Graph	SymbolGraph.G

Methods in algs41 that return Graph

Modifier and Type	Method	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.complete(int V)
static Graph	GraphGenerator.connected(int V, int E)
static Graph	GraphGenerator.connected(int V, int E, int c)
static Graph	GraphGenerator.copy(Graph G)
static Graph	GraphGenerator.cycle(int V)	Returns a cycle graph on V vertices.
static Graph	GraphGenerator.eulerianCycle(int V, int E)	Returns an Eulerian cycle graph on V vertices.
static Graph	GraphGenerator.eulerianPath(int V, int E)	Returns an Eulerian path graph on V vertices.
static Graph	GraphGenerator.fromIn(In in)	Create a graph from input stream.
Graph	SymbolGraph.G()
static Graph	GraphGenerator.path(int V)	Returns a path graph on V vertices.
static Graph	GraphGenerator.random(int V, int E)
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, int E)
static Graph	GraphGenerator.simpleConnected(int V, int E)
static Graph	GraphGenerator.spanningTree(int V)
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.

Methods in algs41 with parameters of type Graph

Modifier and Type	Method	Description
static int	XGraphClient.avgDegree(Graph G)
private void	BreadthFirstPaths.bfs(Graph G, int s)
private void	BreadthFirstPaths.bfs(Graph G, Iterable<Integer> sources)
private boolean	EulerianCycle.certifySolution(Graph G)
private boolean	EulerianPath.certifySolution(Graph G)
private boolean	Bipartite.check(Graph G)
private boolean	BreadthFirstPaths.check(Graph G, int s)
static Graph	GraphGenerator.copy(Graph G)
static int	XGraphClient.degree(Graph G, int v)
private void	Bipartite.dfs(Graph G, int v)
private void	CC.dfs(Graph G, int v)
private void	DepthFirstPaths.dfs(Graph G, int v)
private void	DepthFirstSearch.dfs(Graph G, int v)
private void	XBiconnected.dfs(Graph G, int u, int v)
private void	DepthFirstPaths.dfsLoop(Graph G, int s)
private void	DepthFirstSearch.dfsLoop1(Graph G, int v)
private void	DepthFirstSearch.dfsLoop2(Graph G, int v)
private void	DepthFirstPaths.dfsLoopReversed(Graph G, int s)
private boolean	Cycle.hasCycleFrom(Graph G, int u, int v)
private boolean	Cycle.hasCycleFromSimple(Graph G, int u, int v)
private boolean	Cycle.hasParallelEdges(Graph G)
private boolean	Cycle.hasSelfLoop(Graph G)
static int	XGraphClient.maxDegree(Graph G)
private static int	EulerianCycle.nonIsolatedVertex(Graph G)
private static int	EulerianPath.nonIsolatedVertex(Graph G)
static int	XGraphClient.numberOfSelfLoops(Graph G)
static void	GraphGenerator.print(Graph G, String filename)
private static boolean	EulerianCycle.satisfiesNecessaryAndSufficientConditions(Graph G)	The code below is solely for testing correctness of the data type.
private static boolean	EulerianPath.satisfiesNecessaryAndSufficientConditions(Graph G)	The code below is solely for testing correctness of the data type.
static void	XGraphClient.show(Graph G)
private boolean	Cycle.TEXTBOOKhasCycleFrom(Graph G, int u, int v)
private static void	EulerianCycle.unitTest(Graph G, String description)
private static void	EulerianPath.unitTest(Graph G, String description)

Constructors in algs41 with parameters of type Graph

Modifier	Constructor	Description
	Bipartite(Graph G)
	BreadthFirstPaths(Graph G, int s)
	BreadthFirstPaths(Graph G, Iterable<Integer> sources)
	CC(Graph G)
	Cycle(Graph G)
	DepthFirstPaths(Graph G, int s)
	DepthFirstSearch(Graph G, int s)
	EulerianCycle(Graph G)	Computes an Eulerian cycle in the specified graph, if one exists.
	EulerianPath(Graph G)	Computes an Eulerian path in the specified graph, if one exists.
	MyGraphProperties(Graph G)
	XBiconnected(Graph G)