2
96%
master: 96%

Ran 23 Jul 2017 12:17AM UTC

Files 13

Run time 0s

Badge

Embed ▾

Committed 23 Jul 2017 12:11AM UTC coverage: 94.824% (-0.2%) from 95.048%

Job # MIX_ENV=test

Build Type

push

travis-ci

Committed by

bitwalker

Commit Message

Implement clique detection

- Uses a variation of Bron-Kerbosch algorithm for detecting all maximal
cliques in a graph.
- Performance on large graphs is painful - need to explore ways to
parallelize or otherwise improve worst-case performance on such graphs.
Large graphs in this context are hundreds of thousands of vertices and
edges or more.

/cc @yonkeltron for the request!

Run Details

513 of 541 relevant lines covered (94.82%)

218574.18 hits per line

bitwalker / libgraph / 53 / 2
96%
master: 96%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 53.2 (MIX_ENV=test)

bitwalker / libgraph / 53 / 2 96% master: 96%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 53.2 (MIX_ENV=test)

bitwalker / libgraph / 53 / 2
96%
master: 96%

README BADGES
x