/Link-State-Routing-Simulator

This application used to find the shortest path between two selected routers and display the path and cost between them. Implemented Dijkstra’s algorithm to find the shortest path. It also performs the functions like display connection table of source router, delete a router, cost of shortest path. Also, if any router is shut down it cannot participate in the path to find the shortest path between the source and the destination. Application was developed using JAVA on UNIX platform.

Primary LanguageJava

This repository is not active