This repository contains the OCD service of WebOCD. In the repository, java based codes of overlapping community detection algorithms (OCDA) can be found.
Apache License 2.0
14
stars
10
forks
source link
Notify Users of Custom Calculation of Covers for Unconnected Graphs #99
Currently for unconnected graphs we just the algorithm on every connected component and then merge results. This is fine but the users should at least know that is is whats happening.
Currently for unconnected graphs we just the algorithm on every connected component and then merge results. This is fine but the users should at least know that is is whats happening.