https://github.com/szymonpoltorak/grapher-c
Program used to generate graphs, check their coherence and find shortest path between the given points in them.
https://github.com/szymonpoltorak/grapher-c
bash breadth-first-search c dijkstra-shortest-path graphs-algorithms latex makefile
Last synced: about 2 months ago
JSON representation
Program used to generate graphs, check their coherence and find shortest path between the given points in them.
- Host: GitHub
- URL: https://github.com/szymonpoltorak/grapher-c
- Owner: szymonpoltorak
- License: mit
- Created: 2022-04-14T17:26:30.000Z (about 4 years ago)
- Default Branch: master
- Last Pushed: 2022-06-25T14:03:26.000Z (about 4 years ago)
- Last Synced: 2025-02-08T15:33:14.777Z (over 1 year ago)
- Topics: bash, breadth-first-search, c, dijkstra-shortest-path, graphs-algorithms, latex, makefile
- Language: TeX
- Homepage:
- Size: 2.25 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# grapher
Program designed during project classes of "Języki i Metody Programowania 2" on Warsaw University of Technology. Our goal was to create program which generates graphs in three different modes and one to read such graphs from file and find the shortest path between the points given by the user.
# Compilation
To compile the program you have to just use `make` command. Makefile has few options which you should know about. Makefile commands:
* `make clean` - command used to clean working files after ending our work,
* `make test` - command used to run testing script.
# More info
Detailed info about program is written in documentacy of project written in Polish language. To launch compilled file you need to give every needed launch argument. If you launch program without any argument it will show you the short usage written in English. Running command: \
`./grapher`