LasseRegin / gSpanView on GitHub
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.
21Apr 10, 2018Updated 8 years ago

Alternatives and similar repositories for gSpan

Users that are interested in gSpan are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.

Sorting:

Are these results useful?