Skip to content
This repository was archived by the owner on Mar 11, 2026. It is now read-only.

README.md

Latest commit

 

History

History
24 lines (16 loc) · 476 Bytes

README.md

File metadata and controls

24 lines (16 loc) · 476 Bytes
Raw

RAT2P

Description

Project for finding the shortest path between two Paris metro stations using the Bellman-Ford algorithm.

Installation

First, check if Node is installed, if not, visit Node official Website

  • Navigate to the parent directory.
  • Run the followings wommands
npm i
node ./server.js

Then, go to http://localhost:3000

Author