Maximum-common-subgraph | npm.io

An algorithm to construct the maximum common subgraph between two graphs (networks) and find their similarity (correlation).

maximum common induced subgraph maximum common subgraph maximum-common-subgraph maximum_common_subgraph graph network similarity correlation

1.0.0 • Published 6 years ago