Breaking News: Grepper is joining You.com. Read the official announcement!

graph js

I don't know answered on July 26, 2022 Popularity 10/10 Helpfulness 2/10

answer graph js

related javascript graph

graph js

Comment

// JS graph data structure

function Graph() {
  this.nodes = [];
}

function Node(val) {
  this.val = val;
  this.edges = [];
}

// Add ass many nodes as you want at once
Graph.prototype.addNodes = function (...val) {
  for (i of val) {
    this.nodes.push(new Node(i));
  }
};

// Add edges to each node
Graph.prototype.addEdges = function (val, ...edges) {
  const node = this.nodes.find((i) => i.val === val);
  for (edgeVal of edges) {
    node.edges.push(this.nodes.find((i) => i.val === edgeVal));
  }
};

// BFS algorithm
Graph.prototype.bfs = function (root) {
  const queue = [root];
  const visited = [];

  while (queue.length > 0) {
    current = queue.pop();

    if (visited.includes(current)) continue;
    visited.push(current);

    let node = this.nodes.find((i) => i.val === current);
    console.log(node.val);

    for (i of node.edges) {
      if (!visited.includes(i.val)) queue.unshift(i.val);
    }
  }
};

// DFS algorithm
Graph.prototype.dfs = function (root, visited = []) {
  if (!visited.includes(root)) {
    visited.push(root);
    console.log(root);

    const node = this.nodes.find((i) => i.val === root);
    for (i of node.edges) this.dfs(i.val, visited);
  }
};

const graph = new Graph();

graph.addNodes(0, 1, 2, 3, 4);
graph.addEdges(0, 1, 2, 3);
graph.addEdges(1, 4);
graph.addEdges(4, 3, 1);

// 0 -> 1, 2, 3
// 1 -> 4
// 4 -> 3, 1

graph.dfs(0);

// DFS: 0, 1, 4, 3, 2
// BFS: 0, 1, 2, 3, 4

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: graph javascript

Link to this answer
Share Copy Link

Contributed on Jul 26 2022

I don't know

0 Answers Avg Quality 2/10

Closely Related Answers

javascript graph

Comment

class Graph {
  constructor(directed = true) {
    this.directed = directed;
    this.nodes = [];
    this.edges = new Map();
  }

  addNode(key, value = key) {
    this.nodes.push({ key, value });
  }

  addEdge(a, b, weight) {
    this.edges.set(JSON.stringify([a, b]), { a, b, weight });
    if (!this.directed)
      this.edges.set(JSON.stringify([b, a]), { a: b, b: a, weight });
  }

  removeNode(key) {
    this.nodes = this.nodes.filter(n => n.key !== key);
    [...this.edges.values()].forEach(({ a, b }) => {
      if (a === key || b === key) this.edges.delete(JSON.stringify([a, b]));
    });
  }

  removeEdge(a, b) {
    this.edges.delete(JSON.stringify([a, b]));
    if (!this.directed) this.edges.delete(JSON.stringify([b, a]));
  }

  findNode(key) {
    return this.nodes.find(x => x.key === key);
  }

  hasEdge(a, b) {
    return this.edges.has(JSON.stringify([a, b]));
  }

  setEdgeWeight(a, b, weight) {
    this.edges.set(JSON.stringify([a, b]), { a, b, weight });
    if (!this.directed)
      this.edges.set(JSON.stringify([b, a]), { a: b, b: a, weight });
  }

  getEdgeWeight(a, b) {
    return this.edges.get(JSON.stringify([a, b])).weight;
  }

  adjacent(key) {
    return [...this.edges.values()].reduce((acc, { a, b }) => {
      if (a === key) acc.push(b);
      return acc;
    }, []);
  }

  indegree(key) {
    return [...this.edges.values()].reduce((acc, { a, b }) => {
      if (b === key) acc++;
      return acc;
    }, 0);
  }

  outdegree(key) {
    return [...this.edges.values()].reduce((acc, { a, b }) => {
      if (a === key) acc++;
      return acc;
    }, 0);
  }
}

Popularity 8/10 Helpfulness 1/10 Language javascript

Source: www.30secondsofcode.org

Tags: graph javascript javasc

Link to this answer
Share Copy Link

Contributed on Jan 09 2024

Himanshu Jangid

0 Answers Avg Quality 2/10

graph js

Contents

More Related Answers

graph js

Closely Related Answers

javascript graph

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.