1
1
# Graphina
2
2
3
- > [ !NOTE]
4
- > This is a work in progress, so breaking changes may happen.
5
-
6
3
[ ![ Tests] ( https://img.shields.io/github/actions/workflow/status/habedi/graphina/tests.yml?label=tests&style=popout-square&logo=github )] ( https://github.com/habedi/graphina/actions/workflows/tests.yml )
7
4
[ ![ Code Coverage] ( https://img.shields.io/codecov/c/github/habedi/graphina?style=popout-square&logo=codecov )] ( https://codecov.io/gh/habedi/graphina )
8
5
[ ![ CodeFactor] ( https://img.shields.io/codefactor/grade/github/habedi/graphina?style=popout-square&logo=codefactor )] ( https://www.codefactor.io/repository/github/habedi/graphina )
@@ -17,9 +14,12 @@ Graphina is a high-level graph data science library for Rust.
17
14
It provides the common data structures and algorithms used for analyzing the graphs of real-world networks like social,
18
15
transportation, and biological networks.
19
16
20
- Compared to [ Petgraph] ( https://github.com/petgraph/petgraph ) and [ Rustworkx] ( https://www.rustworkx.org/ ) , Graphina
21
- aims to provide a more high-level API and a more comprehensive set of ready-to-use algorithms for graph analysis
22
- and mining.
17
+ Compared to other Rust graph libraries like [ petgraph] ( https://github.com/petgraph/petgraph )
18
+ and [ rustworkx] ( https://www.rustworkx.org/ ) , Graphina aims to provide a more high-level API and a more comprehensive
19
+ set of ready-to-use algorithms for graph analysis and mining.
20
+
21
+ > [ !NOTE]
22
+ > Graphina is still in the early stages of development, and breaking changes may happen.
23
23
24
24
## Features
25
25
@@ -28,20 +28,20 @@ and mining.
28
28
- [x] Weighted and unweighted graphs
29
29
30
30
* ** IO** :
31
- - [x] Edge list (CSV)
32
- - [ ] Adjacency list (TXT)
31
+ - [x] Edge list
32
+ - [x ] Adjacency list
33
33
- [ ] GraphML
34
34
- [ ] GML
35
35
- [ ] JSON
36
36
37
37
* ** Generators** :
38
- - [x] Erdős–Rényi Graph (Random)
38
+ - [x] Erdős–Rényi Graph
39
39
- [x] Complete Graph
40
40
- [x] Bipartite Graph
41
41
- [x] Star Graph
42
42
- [x] Cycle Graph
43
- - [x] Watts–Strogatz Graph (Small-World)
44
- - [x] Barabási–Albert Graph (Scale-Free)
43
+ - [x] Watts–Strogatz Graph
44
+ - [x] Barabási–Albert Graph
45
45
46
46
* ** Algorithms** :
47
47
- [ ] Graph traversal
0 commit comments