There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
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.