Skip to content

Latest commit

 

History

History
9 lines (4 loc) · 471 Bytes

README.md

File metadata and controls

9 lines (4 loc) · 471 Bytes

Dérivation d'un algorithme de parcours en largeur d'un graphe

Corresponding webpage: http://peportier.me/teaching_2018_2019/ia/bfs/

The source is in a literate programming format. To extract the source from the markdown file bfs.cpp.md do ./mdlp bfs.cpp.md and it will generate the source file bfs.cpp.

You can then compile the source with ./mk1 bfs or ./mk2 bfs. mk1 adds the debugging parameter to g++ while mk2 adds the optimisation parameter.