Commit 8795f46

committed

Add reason behind project

1 parent f51fb7f commit 8795f46Copy full SHA for 8795f46

File tree

-5

lines changed

-5

lines changed

Lines changed: 3 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,12 +9,10 @@`
`9`	`9`	`1. Using Adjacency Matrix and Traversal (aka Eager Naive implementation)`
`10`	`10`	`2. Using Adjacency Lists and a Binary Heap`
`11`	`11`	`3. Using Adjacency Lists and a [Fibonacci Heap](https://brilliant.org/wiki/fibonacci-heap/)`
	`12`	`+- [Here](./Material/Time%20Complexities.jpg) are the time complexities of priority queue operations as well as time complexities of the different implementations.`
	`13`	`+- This project was done for the Design and Analysis of Algorithms course during my 2nd year at Dayananda Sagar University.`
`12`	`14`	`- For much more detail, refer to the [project report](./Material/Project%20Report.pdf).`
`13`	`15`
`14`		`-# Time Complexities`
`15`		`-`
`16`		`-![Time complexities](./Material/Time%20Complexities.jpg)`
`17`		`-`
`18`	`16`	`# Demo Screenshot`
`19`	`17`
`20`	`18`	`![Demo Screenshot](./Material/Output%20Screenshot%202.JPG)`
`@@ -38,7 +36,7 @@ Since the Fibonacci heap implementation has a better time complexity than the ot`
`38`	`36`	`# Installation`
`39`	`37`
`40`	`38`	`## Installing Dependencies`
`41`		`-- Needs Python3 (Python 3.7 was used for development.)`
	`39`	`+- Needs Python 3. (Python 3.7 was used for development.)`
`42`	`40`	`- Needs matplotlib and networkx, both of which can be installed using pip.`
`43`	`41`
`44`	`42`	`## Installing the Project`

Comments

(0)