Description: Paris s metro card, implemented in C, without search algorithm, but can be implemented pretty easily. (Dijkstra)
To Search:
File list (Check if you may need any files):
Metro\abr.c
.....\abr.h
.....\abr.o
.....\abr_type.h
.....\aqrtopo.c
.....\aqrtopo.h
.....\aqrtopo.h~
.....\aqrtopo.o
.....\A_LIRE.txt
.....\connexion.c
.....\connexion.h
.....\connexion.o
.....\Connexions_IDF.csv
.....\Connexions_IDF_fr.csv
.....\coord.h
.....\dijkstra.c
.....\dijkstra.c~
.....\dijkstra.h
.....\dijkstra.o
.....\ligne.c
.....\ligne.h
.....\ligne.o
.....\Lignes_IDF.csv
.....\Lignes_IDF_fr.csv
.....\liste.c
.....\liste.c~
.....\liste.h
.....\liste.o
.....\Makefile
.....\metro_callback_v0.c
.....\metro_callback_v0.h
.....\metro_callback_v0.o
.....\metro_callback_v1.c
.....\metro_callback_v1.h
.....\metro_callback_v2.c
.....\metro_callback_v2.h
.....\metro_callback_v3.c
.....\metro_callback_v3.h
.....\metro_callback_v4.c
.....\metro_callback_v4.h
.....\metro_v0.c
.....\metro_v0.o
.....\metro_v1.c
.....\metro_v2.c
.....\metro_v3.c
.....\metro_v4.c
.....\S8.pdf
.....\station.c
.....\station.h
.....\station.o
.....\Stations_IDF.csv
.....\Stations_IDF_fr.csv
.....\test_aqr
.....\test_aqr.c
.....\test_aqr.exe
.....\test_aqr.o
.....\test_connexion
.....\test_connexion.c
.....\test_connexion.exe
.....\test_connexion.o
.....\test_dijkstra
.....\test_dijkstra.c
.....\test_dijkstra.c~
.....\test_dijkstra.exe
.....\test_dijkstra.o
.....\test_ligne
.....\test_ligne.c
.....\test_ligne.exe
.....\test_ligne.o
.....\test_sta
.....\test_sta.c
.....\test_sta.exe
.....\test_sta.o
.....\truc.c
.....\truc.h
.....\truc.o
Metro