https://github.com/dgleich/libbvg

A C implementation of a Boldi-Vigna graph decompressor
https://github.com/dgleich/libbvg

Last synced: about 2 months ago
JSON representation

A C implementation of a Boldi-Vigna graph decompressor

• Host: GitHub
• URL: https://github.com/dgleich/libbvg
• Owner: dgleich
• License: gpl-2.0
• Created: 2011-01-22T20:53:25.000Z (over 13 years ago)
• Default Branch: master
• Last Pushed: 2016-07-05T20:36:12.000Z (about 8 years ago)
• Last Synced: 2024-07-26T12:55:48.898Z (about 2 months ago)
• Language: C
• Homepage:
• Size: 1.36 MB
• Stars: 18
• Watchers: 4
• Forks: 6
• Open Issues: 15
• Metadata Files:
  • Readme: README.md
  • License: license.txt

Awesome Lists containing this project

README

        
libbvg

======

This library implements a decoder for a Boldi-Vigna 

graph structure, a highly compressed means of storing

web-graphs.  The library is written in pure C.

It includes a Matlab wrapper, and a means to implement

multi-threaded graph algorithms.

[![Build Status](https://travis-ci.org/dgleich/libbvg.svg?branch=master)](https://travis-ci.org/dgleich/libbvg)

Features

--------

* In-memory and on-disk graph storage

* Sequential iteration over graph edges

* Parallel iteration over graph edges

Coming soon: random access to graph edges.

Synopsis

--------

    bvgraph g = {0};

    bvgraph_load(&g, "wb-cs.stanford", 14, 0);

    printf("nodes = %i\n", g.n);

    printf("edges = %i\n", g.m);

    bvgraph_iterator git;

    bvgraph_nonzero_iterator(&g, &git);

    for (; bvgraph_iterator_valid(&git); bvgraph_iterator_next(&git)) {

        int *links; unsigned int d;

        bvgraph_iterator_outedges(&git, &links, &d);

        printf("node %i has degree %d\n", git.curr);

        for (int i; i