graph_csr 0.2.2

A crate that provides utility functions for manipulating graphs in a CSR format, used as the baseline for constructing powerful graph algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54

# graph_csr

This crate has the objective of serving as the baseline for powerful graph algorithms built in Rust.
It leverages memory-maps by using the [easy_mmap](https://crates.io/crates/easy_mmap) crate, and thus can easily manipulate graphs that exceed the available system memory.

## Usage

At this point, `graph_csr` supports reading directly from binary and txt files. However, such files require to be sorted by source, due to the nature of the CSR graph.
Let us exemplify with a simple example file `graph.txt`:
```
0 1
0 2
1 5
1 2
4 7
```

This graph contains 8 nodes (0 - 7) and 5 edges.

```
use graph_csr;

fn main() {
    let filename = "./graph.txt";
    let output_folder = "./output";
    let file = std::fs::File::open(filename).unwrap();

    let graph = graph_csr::Graph::<u32>::from_txt_adjacency_list(file, output_folder).unwrap();

    for (node, edges) in graph.iter().enumerate() {
        println!("{:?} -> {:?}", node, edges);
    }
}
```

And we can see the following output:
```
0 -> [1, 2]
1 -> [5, 2]
2 -> []
3 -> []
4 -> [7]
5 -> []
6 -> []
7 -> []
```

You can now inspect the folder `output`:
```
> ls output
edge.csr  vertex.csr
```

The graph is now saved for future use, and there is no need of parsing it again (as it can be time consuming).