GraphLib is a internal research project of RFAI team developped by the help of PhD students, students of PolytechTours and internships in order to gather different Graph Matching Algorithms.

As different students have been involved in this project, different programming langages (java, C#, python) have been used during the developments.

It is noticable that one of the algorithm of GED included in Graphlib (exact DFS-GED) has been selected to be included in the well known NetworkX open source library written in Python.

The Java version is the more complete and has been developped during the PhD of Zeina Abu-Aisheh.

Java version

  • PART I: The source codes of  DFS, PDF, BP, BeamSearch are included in the ZIP file below (see README). 
  • The methods called DFS was published in [1] and  PDFS was published in [2] (see publications page). Please cite them if you use this code
  • This code corresponds to the code uses during the ICPR 2016 contest on graph distance (https://gdc2016.greyc.fr/).
  • ZIP file of the source codes (Part I) (see README)
  • Documentation

  • PART II: The source code of TreeDF is included in the ZIP file below (see README)
  • The methods called OneTreeDF was published in [3] and [4] (see publications page). Please cite them if you use this code. 
  • ZIP file of the source codes (Part II) (see README)


C# version


RFAI team
Computer Science Laboratory of Tours (LIFAT).
Université François Rabelais de Tours.
64 av. Jean Portalis 37200 Tours city, France.
Email: lifat at univ-tours dot fr