com.alexprut.algo.datastructures

Class Graph

java.lang.Object

com.alexprut.algo.datastructures.Graph

public class Graph
extends java.lang.Object

Conventions: the nodes are labeled from 0 to n (exclusive)

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	Graph.Edge
static class	Graph.Node

Constructor Summary

Constructors

Constructor and Description
Graph(int n)
Graph(int n, boolean isDirected)

Method Summary

Modifier and Type	Method and Description
void	addEdge(java.util.ArrayList<Graph.Edge> edges)
void	addEdge(Graph.Edge edge)
void	addEdge(int x, int y, int w)
java.util.ArrayList<java.util.ArrayList<Pair<java.lang.Integer,java.lang.Integer>>>	getAdjacencyList()
int[][]	getAdjacencyMatrix()
java.util.ArrayList<Graph.Edge>	getEdges()
java.util.ArrayList<Graph.Edge>	mst() Calculates the minimum spanning tree

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Graph

public Graph(int n)

Graph

public Graph(int n,
             boolean isDirected)

Method Detail

getAdjacencyMatrix

public int[][] getAdjacencyMatrix()

getAdjacencyList

public java.util.ArrayList<java.util.ArrayList<Pair<java.lang.Integer,java.lang.Integer>>> getAdjacencyList()

getEdges

public java.util.ArrayList<Graph.Edge> getEdges()

mst

public java.util.ArrayList<Graph.Edge> mst()

Calculates the minimum spanning tree

addEdge

public void addEdge(java.util.ArrayList<Graph.Edge> edges)

addEdge

public void addEdge(Graph.Edge edge)

addEdge

public void addEdge(int x,
                    int y,
                    int w)