The following list summarizes the main algorithms available with GDT, regardless the specific class they are method of. The aim of this list is to provide the developer with a quick reference to what she can achieve with GDT, without requiring her to get confident with the hierarchy of classes actually encapsulating each algorithm at the proper level of abstraction.


Supported graph types


Basic library features


Algorithms on generic multigraphs


Algorithms on directed graphs


Algorithms on planar graphs


Algorithms on tree graphs


Algorithms on SPQR-tree graphs


Last update: July 31, 2002
Website design by INTEGRA Sistemi, www.IntegraSistemi.it