Huy Do

Posted on

# Graph, Disjoint Set

#### Graph

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics, specifically the field of graph theory

A graph data structure consists of a finite (and possibly mutable) set of vertices or nodes or points, together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges, arcs, or lines for an undirected graph and as arrows, directed edges, directed arcs, or directed lines for a directed graph. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.

``````export default class Graph {
/**
* @param {boolean} isDirected
*/
constructor(isDirected = false) {
this.vertices = {};
this.edges = {};
this.isDirected = isDirected;
}

/**
* @param {GraphVertex} newVertex
* @returns {Graph}
*/
this.vertices[newVertex.getKey()] = newVertex;

return this;
}

/**
* @param {string} vertexKey
* @returns GraphVertex
*/
getVertexByKey(vertexKey) {
return this.vertices[vertexKey];
}

/**
* @param {GraphVertex} vertex
* @returns {GraphVertex[]}
*/
getNeighbors(vertex) {
return vertex.getNeighbors();
}

/**
* @return {GraphVertex[]}
*/
getAllVertices() {
return Object.values(this.vertices);
}

/**
* @return {GraphEdge[]}
*/
getAllEdges() {
return Object.values(this.edges);
}

/**
* @param {GraphEdge} edge
* @returns {Graph}
*/
// Try to find and end start vertices.
let startVertex = this.getVertexByKey(edge.startVertex.getKey());
let endVertex = this.getVertexByKey(edge.endVertex.getKey());

// Insert start vertex if it wasn't inserted.
if (!startVertex) {
startVertex = this.getVertexByKey(edge.startVertex.getKey());
}

// Insert end vertex if it wasn't inserted.
if (!endVertex) {
endVertex = this.getVertexByKey(edge.endVertex.getKey());
}

if (this.edges[edge.getKey()]) {
} else {
this.edges[edge.getKey()] = edge;
}

// Add edge to the vertices.
if (this.isDirected) {
// If graph IS directed then add the edge only to start vertex.
} else {
// If graph ISN'T directed then add the edge to both vertices.
}

return this;
}

/**
* @param {GraphEdge} edge
*/
deleteEdge(edge) {
// Delete edge from the list of edges.
if (this.edges[edge.getKey()]) {
delete this.edges[edge.getKey()];
} else {
}

// Try to find and end start vertices and delete edge from them.
const startVertex = this.getVertexByKey(edge.startVertex.getKey());
const endVertex = this.getVertexByKey(edge.endVertex.getKey());

startVertex.deleteEdge(edge);
endVertex.deleteEdge(edge);
}

/**
* @param {GraphVertex} startVertex
* @param {GraphVertex} endVertex
* @return {(GraphEdge|null)}
*/
findEdge(startVertex, endVertex) {
const vertex = this.getVertexByKey(startVertex.getKey());

if (!vertex) {
return null;
}

return vertex.findEdge(endVertex);
}

/**
* @return {number}
*/
getWeight() {
return this.getAllEdges().reduce((weight, graphEdge) => {
return weight + graphEdge.weight;
}, 0);
}

/**
* Reverse all the edges in directed graph.
* @return {Graph}
*/
reverse() {
/** @param {GraphEdge} edge */
this.getAllEdges().forEach((edge) => {
// Delete straight edge from graph and from vertices.
this.deleteEdge(edge);

// Reverse the edge.
edge.reverse();

// Add reversed edge back to the graph and its vertices.
});

return this;
}

/**
* @return {object}
*/
getVerticesIndices() {
const verticesIndices = {};
this.getAllVertices().forEach((vertex, index) => {
verticesIndices[vertex.getKey()] = index;
});

return verticesIndices;
}

/**
* @return {*[][]}
*/
const vertices = this.getAllVertices();
const verticesIndices = this.getVerticesIndices();

// Init matrix with infinities meaning that there is no ways of
// getting from one vertex to another yet.
const adjacencyMatrix = Array(vertices.length).fill(null).map(() => {
return Array(vertices.length).fill(Infinity);
});

// Fill the columns.
vertices.forEach((vertex, vertexIndex) => {
vertex.getNeighbors().forEach((neighbor) => {
const neighborIndex = verticesIndices[neighbor.getKey()];
});
});

}

/**
* @return {string}
*/
toString() {
return Object.keys(this.vertices).toString();
}
}
``````

#### Disjoint Set

Disjoint-set data structure (also called a union–find data structure or merge–find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph.

``````import DisjointSetItem from './DisjointSetItem';

export default class DisjointSet {
/**
* @param {function(value: *)} [keyCallback]
*/
constructor(keyCallback) {
this.keyCallback = keyCallback;
this.items = {};
}

/**
* @param {*} itemValue
* @return {DisjointSet}
*/
makeSet(itemValue) {
const disjointSetItem = new DisjointSetItem(itemValue, this.keyCallback);

if (!this.items[disjointSetItem.getKey()]) {
// Add new item only in case if it not presented yet.
this.items[disjointSetItem.getKey()] = disjointSetItem;
}

return this;
}

/**
* Find set representation node.
*
* @param {*} itemValue
* @return {(string|null)}
*/
find(itemValue) {
const templateDisjointItem = new DisjointSetItem(itemValue, this.keyCallback);

// Try to find item itself;
const requiredDisjointItem = this.items[templateDisjointItem.getKey()];

if (!requiredDisjointItem) {
return null;
}

return requiredDisjointItem.getRoot().getKey();
}

/**
* Union by rank.
*
* @param {*} valueA
* @param {*} valueB
* @return {DisjointSet}
*/
union(valueA, valueB) {
const rootKeyA = this.find(valueA);
const rootKeyB = this.find(valueB);

if (rootKeyA === null || rootKeyB === null) {
throw new Error('One or two values are not in sets');
}

if (rootKeyA === rootKeyB) {
// In case if both elements are already in the same set then just return its key.
return this;
}

const rootA = this.items[rootKeyA];
const rootB = this.items[rootKeyB];

if (rootA.getRank() < rootB.getRank()) {
// If rootB's tree is bigger then make rootB to be a new root.

return this;
}

// If rootA's tree is bigger then make rootA to be a new root.

return this;
}

/**
* @param {*} valueA
* @param {*} valueB
* @return {boolean}
*/
inSameSet(valueA, valueB) {
const rootKeyA = this.find(valueA);
const rootKeyB = this.find(valueB);

if (rootKeyA === null || rootKeyB === null) {
throw new Error('One or two values are not in sets');
}

return rootKeyA === rootKeyB;
}
}
``````