LasseRegin / gSpan

Implementation of the depth-first gSpan algorithm for frequent graph mining in graphs data set. Finds possible frequent and canonical extensions of a given graph from a given set of graphs.
17Updated 6 years ago

Related projects

Alternatives and complementary repositories for gSpan