Skip to content

Lightweight graph implementation in go for the Computer Networks lecture SS2017 at the University of Trier

Notifications You must be signed in to change notification settings

michaelwolz/litegraph

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 

Repository files navigation

litegraph

Lightweight graph implementation in go for the Computer Networks lecture SS2017 at the University of Trier

Generate a random graph

You can generate a random graph with v vertices and e edges and save it to a JSON-File with:

Usage: rgg v e

e must be at least amount of v - 1!

Calculate shortest paths

To calculate the shortest paths run:

Usage: shortestPath [pathToJsonFile]

About

Lightweight graph implementation in go for the Computer Networks lecture SS2017 at the University of Trier

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages