Skip to content

A Java project implemented Dijkstra's Algorithm and Prim's Algorithm on a graph, which represents two cities, to get Leyla and Mecnun together and let them honeymoon

Notifications You must be signed in to change notification settings

Simurgan/A-Love-Story-Java-Project

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A-Love-Story-Java-Project

A Java project implemented Dijkstra's Algorithm and Prim's Algorithm on a graph, which represents two cities, to get Leyla and Mecnun together and let them honeymoon

CmpE250 Data Structures and Algorithms course project homework 2021 fall semester Bogazici University Computer Engineering Department. This project focuses on shortest path problem and finding a minimum spanning tree problem. You can check the homework description and test cases for details.

About

A Java project implemented Dijkstra's Algorithm and Prim's Algorithm on a graph, which represents two cities, to get Leyla and Mecnun together and let them honeymoon

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages