Archived

This repository has been archived on 2024-09-15. You can view files and clone it. You cannot open issues or pull requests or push a commit.

Go to file

Nigel Barink 852837d392 Small note added in README

2021-03-28 20:29:53 +01:00

.gitignore

Initial Commit

2021-03-28 20:25:57 +01:00

City.go

Initial Commit

2021-03-28 20:25:57 +01:00

directedGraph.go

Initial Commit

2021-03-28 20:25:57 +01:00

edge.go

Initial Commit

2021-03-28 20:25:57 +01:00

main.go

Initial Commit

2021-03-28 20:25:57 +01:00

Makefile

Initial Commit

2021-03-28 20:25:57 +01:00

node.go

Initial Commit

2021-03-28 20:25:57 +01:00

Person.go

Initial Commit

2021-03-28 20:25:57 +01:00

README.md

Small note added in README

2021-03-28 20:29:53 +01:00

README.md

Pathfinding

Which algorithms ?

Dijkstra & A*

What type of graph I am using ?

Directed graph

Why use Golang?

I have wanted to play around with golang for a while but didn't have a good project for it. My hopes are to play with the ___ side by running the algorithm in ___

I Will soon setup the correct Golang structure with modules etc ... don't worry