Tutorials for using the Digraph3 Python software collection

The documentation contains a set of tutorials introducing the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs. The tutorial about split, interval and permutation graphs is inspired by Martin Ch. Golumbic’s book on Algorithmic Graph Theory and Perfect Graphs. A recent contribution studies the challenging fair intergroup and intragroup pairing problems. Finally, we provide a tutorial on tree graphs and spanning forests.