gca/Path/index.js

Use classic algorithms for Graphs.

const Edge = require("../Edges/Edge");
/**
 * Implementation of path. Path is used for saving nodes of the minimum path from BFS Graph and edges.
 *
 * @class Path
 */
class Path {
  constructor() {
    this.nodes = [];
    this.edges = [];
  }
  /**
   * Adds new edge to path.
   * @param {Edge} edge The edge.
   * @memberof Path
   */
  addEdge(edge) {
    this.edges.push(edge);
  }
  /**
   * Adds new node to the path.
   * @param {number} ID ID of node.
   * @memberof Path
   */
  addNode(ID) {
    this.nodes.push(ID);
  }
  /**
   * Reverse the order of path.
   * @memberof Path
   */
  reverseNodes() {
    let newNodes = this.nodes.reverse();

    this.nodes = newNodes;
  }
  /**
   * Gets the number of edged in the path.
   * @returns {number} The number of edged.
   * @memberof Path
   */
  size() {
    return this.edges.length;
  }
  /**
   * Prints the edges of the path.
   *
   * @returns {string}
   * @memberof Path
   */
  toString() {
    let print = ``;

    for (let i = 0; i < this.edges.length; i++) {
      print = `${print}${this.edges[i]}`;

      if (i != this.edges.length - 1) {
        print = `${print}\n`;
      }
    }
    
    return print;
  }
}

module.exports = Path;