Graphes
Objectives
The student must master the principal concepts and results of Graph Theory and is able to apply them to real life problems and situations. He can implement and test classical algorithms of graph theory, such as Euler's circuit, Disjkstra's shortest path, Welsh-Powell's coloring, etc.
Description
Chapter 1 : Definitions and basic concepts
Chapter 2 : Graph connexity
Chapter 3 : Euler and Hamilton graphs
Chapter 4 : Exploring graphs
Chapter 5 : Graph coloring and Planar graphs
Each chapter is studied in class and related exercices are proposed.
5 labs are dedicated to the project.
Bibliography
* Gondran, Michel, and Michel Minoux. Graphs and algorithms. Wiley, 1984
Pre-requisites
Programming skills in ocaml
Session 1 ou session unique - Contrôle des connaissances
Modalité | Nature | Coefficient | Remarques |
---|---|---|---|
CC (contrôle continu) | Oral/Ecrit | 70% | Examen Graphes |
CC (contrôle continu) | Bureau d'Etudes | 30% | BE-Graphes |
Session 2 - Contrôle des connaissances
Modalité | Nature | Coefficient | Remarques |
---|---|---|---|
CC (contrôle continu) | Oral/Ecrit | 70% | Examen Graphes |
CC (contrôle continu) | Bureau d'Etudes | 30% | BE-Graphes |
Contact(s)
MORIN GÉRALDINEPlaces
- Toulouse