You can read the official instruction from here
This is a student project that helps learn about algorithms:
- minimum cost maximum flow (Ford-Fulkerson, Suurballe)
- path search in directed graphs (BFS, Dijkstra, Bellman-Ford)
- efficient data representation (priority queues, graphs, arrays, queues, linked lists)
- ways to receive data
- ways to output data
- manipulation of strings
- manipulation of structures
The program takes only one argument, which is a file name.
go run ./cmd example.txt
There are some ready examples can be found in the "maps" folder
Thank @almayor. Read his explanation for lem-in. Also I recommend you read Suurballe's algorithm, briefly explained by pictures.