yxtj / gspan Goto Github PK
View Code? Open in Web Editor NEWThis project forked from 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.
License: MIT License