Skip to content

Link State and Distance Vector Routing Protocol implementation in Java

Notifications You must be signed in to change notification settings

mahalwal/RoutingProtocols

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

Computer Networks Routing Protocols

Link State and Distance Vector Routing Protocol implementation in Java

  1. Link State Routing Protocol
    Implemented using Dijkstra's Algorithm

  2. Distance Vector Routing Protocol
    Implementd using Bellman-Ford Algorithm

Input:
<no. of vertices> <no. of edges = m>
<edge 1>
<edge 2>
..
..

Sample Input:
3 3
1 2 4
1 3 1
2 3 2

About

Link State and Distance Vector Routing Protocol implementation in Java

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages