Skip to content

A java implementation of the Dijkstra Algorithm: an algorithm used to find the minimum path between any two vertices in a graph. This is a part of my research for my graduation final project: developing a shortest path inteligence in a traffic simulator.

thainararogerio/dijkstra-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

dijkstra-algorithm

A Java implementation of the Dijkstra Algorithm: an algorithm used to find the minimum path between any two vertices in a graph.

It is part of my research for my graduation final project, which consists of adding a Shortest Path Intelligence to a Traffic Simulator.

About

A java implementation of the Dijkstra Algorithm: an algorithm used to find the minimum path between any two vertices in a graph. This is a part of my research for my graduation final project: developing a shortest path inteligence in a traffic simulator.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages