cliquematch Finding correspondence via maximum cliques in large graphs The cliquematch package aims to do two specific things: Find maximum cliques in large sparse undirected graphs, as quickly and efficiently as possible. cliquematch provides fast C++ implementations solving the maximum clique and clique enumeration problem. Many applications of the clique problem, such as fingerprint matching, image registration, or molecule alignment involve construction of a graph from two given datasets.
... iquematch provides flexible methods to construct large sparse undirected graphs in-memory for such applications. Source code at https://github.com/ahgamut/cliquematch View the documentation at https://cliquematch.readthedocs.io/