npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

js-dijkstra

v0.1.1

Published

A simple JS implementation for Dijkstra's algorithm

Downloads

2

Readme

Dijkstra JS Implementation

A simple JS implementation for Dijkstra's algorithm

Node.js Package

Generated by OpenAI ChatGPT Mar 14 Version

See Wikipedia

Installation

npm i js-dijkstra

Usage

// Adding edge
dijkstra.addEdge('D', 'B', 5).addEdge('D', 'C', 6);
// Is equals to adding vertex
dijkstra.addVertex('D', [{'B': 5}, {'C': 6}]);
import { Dijkstra } from "../src/dijkstra";


const dijkstra = new Dijkstra();
// or
const dijkstra = Dijkstra.instance();

// Add vertices and edges
dijkstra.addVertex('A', [{'B' : 3}, {'C' : 2}]);
dijkstra.addVertex('B', [{'A' : 3}, {'C' : 1}, {'D' : 5}]);
dijkstra.addVertex('C', [{'A' : 2}, {'B' : 1}, {'D' : 6}]);
dijkstra.addEdge('D', 'B', 5).addEdge('D', 'C', 6);

let paths = dijkstra.findShortestPath('A', 'D'); // [A, C, D]

Method addVertex vs addEdge

addVertex: This method is used to add a vertex to the graph. A vertex represents a point or node in the graph. In the context of the Dijkstra algorithm, a vertex can be thought of as a location or node in a network. The addVertex method takes two parameters: the name of the vertex and an array of neighboring vertices (edges) with their corresponding edge weights. It adds the vertex and its associated edges to the graph.

addEdge: This method is used to add an edge between two vertices in the graph. An edge represents a connection or link between two vertices. In the context of the Dijkstra algorithm, an edge represents a cable route or path between two locations in a network. The addEdge method takes three parameters: the source vertex, the destination vertex, and the weight or cost of the edge. It establishes the connection between the source and destination vertices with the specified weight.

To summarize, addVertex is used to add a vertex with its neighboring edges to the graph, while addEdge is used to establish a connection (edge) between two vertices with a specified weight. Together, these methods allow you to build the graph representation required for the Dijkstra algorithm to find the shortest path between vertices in the network.

Dev Build

npm run build

Dev Test

npm test