Commit 4e76277

authored

Update README.md

1 parent 0b6c875 commit 4e76277Copy full SHA for 4e76277

File tree

-5

lines changed

-5

lines changed

Lines changed: 7 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`## Introduction`
`4`	`4`
`5`		`-This repo covers basic graph algorithms for directed and undirected graphs with/without weights on edges.`
	`5`	`+This repo covers basic graph algorithms for directed and undirected graphs with/without weights on edges. Graph description is read from a file with ascii format.`
`6`	`6`
`7`	`7`	`Base graph data structure is targeted for sparse graphs efficiency. For example, it maintains adjancy list and pointrs.`
`8`	`8`
`@@ -14,7 +14,7 @@ Base graph data structure is targeted for sparse graphs efficiency. For exam`
`14`	`14`	`* Kruskal's Mimimal Spanning Tree`
`15`	`15`	`* Dijkstra's Single Source Shortest Path`
`16`	`16`
`17`		`-## Graph Format`
	`17`	`+## Graph File Format`
`18`	`18`
`19`	`19`	```
`20`	`20`	graph (un)directed`
`@@ -38,16 +38,18 @@ n5 n4 3`
`38`	`38`	`n5 n6 2`
`39`	`39`	```
`40`	`40`
`41`		`-## How to Compile`
	`41`	`+## Application`
	`42`	`+`
	`43`	`+### How to Compile`
`42`	`44`	```
`43`	`45`	`cd src`
`44`	`46`	`<c++-compiler> bgaMain.cpp -o bgaMain.exe`
`45`	`47`	```
`46`	`48`
`47`		`-## How to Run`
	`49`	`+### How to Run`
`48`	`50`	``` bgaMain.exe <graph-file>```
`49`	`51`
`50`		`-## Example run`
	`52`	`+### Example run`
`51`	`53`
`52`	`54`
`53`	`55`	`$ src/bgaMain.exe test/dgraph5.txt`

Comments

(0)