Have you come across any interesting examples of dense graphs (e.g., a high edge to vertex ratio : most vertices are connected each other)?
Our implementation is mainly tailored towards sparse graph therefore, we recommend using dense matrix libraries instead. In fact, our implementation incurs additional overhead when processing and storing low degree vertices and their properties. We did at some point support Hungrarian wich is for dense graphs but it was pushed to a more suitable package (raft)
This topic was automatically closed 14 days after the last reply. New replies are no longer allowed.