New Algorithms Parking Lot

[rlratzel]

Tasks

Preview Give feedback

1. Line graph implementation - Python [FEA] #1262
   feature request +1
   
2. [FEA] balanced triads | Heider #1393
   feature request +1
   
3. Add extract_paths python API for working with individual paths from consolidated path return values #2013
   improvement +1
   
4. [FEA]: Implementation a compose feature (similar to nx.compose) for merging multiple graphs #3102
   feature request +1
   
5. [FEA]: Implement G.to_directed for distributed graphs #3140
   feature request +1
   
6. [FEA] Label propagation graph primitive patterns #1225
   +0
7. [FEA] K-shortest paths #1470
   +0
   
8. [FEA] All paths between two vertex sets #1542
   improvement +1
   
9. [FEA] API to reverse edges for a Graph #2458
   feature request +1
   
10. Create a mechanism to take multi-graph and generate a simple graph #2596
    +0
11. [FEA] Generate and plot a network by cuGraph #2687
    feature request +1
12. [FEA] local bridges (similar to Nx) #1418
    nx-cugraph +1
    
13. [FEA]: Add Cosine Similarity to cuGraph #2993
    feature request +1
    

    
14. [FEA] Add support to handle multiple small graphs #2762
    feature request +1
    
15. Create Cost Matrix design and requirements doc #3399
    doc +1
    
16. Community detection by label propagation #3454
    +0
    
17. [FEA] local clustering coefficient #1701
    improvement +1
    
18. [FEA]: SCC better implementation #4424
    feature request +1
    
19. [FEA]: Implement spectral_ordering #4793
    feature request +1
20. [FEA]: Multiplex leiden clustering #4828
    feature request +1
21. [FEA]: Fix labels for a subset of nodes in Leiden clustering #4880
    feature request +1
22. [QST]: How to run multi GPU cugraph leiden for a large graph #4884
    question +1