para-graph
| Crates.io | para-graph |
| lib.rs | para-graph |
| version | 0.1.2 |
| source | src |
| created_at | 2024-04-07 20:13:45.438403 |
| updated_at | 2024-07-05 21:00:12.965255 |
| description | "Para-Graph" delivers swift, parallel graph algorithms in Rust, optimized for CPU and GPU. Ideal for HPC workflows. |
| homepage | |
| repository | https://github.com/EMachad0/Para-Graph |
| max_upload_size | |
| id | 1199490 |
| size | 5,850,255 |
Eliton Machado da Silva (EMachad0)
documentation
README
Para-Graph
Graph Algorithms, High Performance Computing, GPU, CPU, Rust, C++, OpenAcc
Overview
:construction: Under Construction :construction:
"Para-Graph" is a library for high-performance, parallel graph algorithms, optimized for both CPU and GPU. The library is implemented in Rust and C++ and uses OpenACC for GPU acceleration.
Currently, the library is on the early stages of development and only a few algorithms are implemented. Expect bugs, incomplete features and breaking changes. Use at your own risk.
Algorithms
| Algorithm | CPU | GPU |
|---|---|---|
| Busca Binária | :construction: | |
| Merge Sort | :construction: | |
| Topological Sort | :construction: | |
| Radix Sort | :construction: | :construction: |
| K-means | :construction: | :construction: |
| DBSCAN | :construction: | :construction: |
| Hierarchical Clustering | :construction: | |
| Markov Clustering | :construction: | :construction: |
| PageRank | :construction: | :construction: |
| Dijkstra | :construction: | |
| Floyd-Warshall | :white_check_mark: | :white_check_mark: |
| A* | :construction: | |
| Kruskal | :construction: | |
| Prim | :construction: | |
| Edmonds-Karp | :construction: | |
| Min-Cost Max-Flow | :construction: | |
| Dinic | :construction: | |
| Gaussian Elimination | :construction: | :construction: |
| Hungarian | :construction: | |
| ADMM | :construction: | :construction: |
Docs
:construction: Under Construction :construction:
Credits
Credit where credit is due
Project developed by Eliton Machado da Silva under the supervision of Prof. Dr. Guilherme P. Koslovski at the Universidade Estadual de Santa Catarina (UDESC) in the context of final project of the Bachelor's degree in Computer Science.
License
Released under the MIT license.