Naim

#2485 API definition for Leiden C++ Implementation

**Describe the solution you'd like and any additional context** To avoid badly connected communities, we would like to implement Leiden method. To way it is done - 1. Find partition...

cugraph examples

4

This PR adds example on how to use libcugraph to run different algorithms.

C API for MNMG ECG

8

C API for MNMG ECG Closes #3571 Closes #3572 Closes #3573 Closes #3575

Update collect_comm to handle value of tuple type

4

Update collect_comm to handle value of tuple type

Update decompress_to_edgelist to handle edge types

6

Update decompress_to_edgelist to handle edge types

Lookup edge source and destination using edge id

1

Lookup edge source and destination using edge id

MNMG Approximation Algorithm for the Weighted Matching Problem

5

MNMG [Approximation Algorithm for the Weighted Matching Problem](https://web.archive.org/web/20081031230449id_/http://www.ii.uib.no/~fredrikm/fredrik/papers/CP75.pdf)

Compute shortest paths using Bellman-Ford algorithm.

1

Compute shortest paths using Bellman-Ford algorithm.

Use MNMG version of ECG in python layer instead, and remove legacy ECG and Louvain

5

This PR - removes legacy ECG and Louvain code - updates python code to use MNMG ECG instead of legacy version