import Graph from 'algorithmsjs/src/graph/Graph.js'

public class | source

Graph

Graph: represents a undirected graph data structure. Usage: let graph = new Graph(); graph.addVertex('A'); graph.addVertex('B'); graph.addEdge('A','B');

Constructor Summary

Public Constructor
public	constructor

Method Summary

Public Methods
public	addEdge(Vertex: startVertex, Vertex: endVertex): Graph
public	addVertex(value: value): Graph
public	addVerticies(array: values): Graph
public	getAdjacencyList(): Object
public	getAdjacencyMatrix(): Array
public	getEdgeByValues(start: startValue, end: endValue): Edge
public	getEdges(): Array
public	getEdgesByVertex(vertex: *): Array
public	getVertexByValue(value: value): Vertex
public	getVertexValues(): Array
public	getVertices(): Array
public	hasEdge(start: startVertex, end: endVertex): Boolean
public	hasVertexWithValue(value: value): Boolean

Public Constructors

public constructor source

Public Methods

public addEdge(Vertex: startVertex, Vertex: endVertex): Graph source

Params:

Name	Type	Attribute	Description
Vertex	startVertex		(or value of Vertex) in graph to start
Vertex	endVertex		(or value of Vertex) in graph to end

Return:

Graph

current instance of graph.

Throw:

DuplicateEdgeError

when adding edge whose value exists in graph.

public addVertex(value: value): Graph source

Params:

Name	Type	Attribute	Description
value	value		to set on the vertex

Return:

Graph

current instance of graph.

Throw:

DuplicateVertexError

when adding vertex whose value exists in graph.

public addVerticies(array: values): Graph source

Params:

Name	Type	Attribute	Description
array	values		of values to add to the graph

Return:

Graph

current instance of graph.

public getAdjacencyList(): Object source

Return:

Object

each Object key represents a vertex in graph; value at each key is an array of vertex values found in edge destinations.

public getAdjacencyMatrix(): Array source

Return:

Array

array of arrays; each entry represents adjacency for row; each entry in each sub-array represents adjacency for column; if A[i][j] = 1, there is an edge from i to j.