53
96%

Ran 23 Jul 2017 12:16AM UTC

Jobs 3

Files 13

Run time 25s

Badge

Embed ▾

pending completion

Build # 53

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

16 of 16 new or added lines in 1 file covered. (100.0%)

513 of 541 relevant lines covered (94.82%)

653341.9 hits per line

New Missed Lines in Diff

Lines	Coverage	∆	File
2	92.53	-0.28%	lib/graph.ex

Jobs

ID	Job ID	Ran	Files	Coverage
1	53.1 (MIX_ENV=test)	23 Jul 2017 12:16AM UTC	13	94.82	Travis Job 53.1
2	53.2 (MIX_ENV=test)	23 Jul 2017 12:17AM UTC	13	94.82	Travis Job 53.2
3	53.3 (MIX_ENV=test)	23 Jul 2017 12:16AM UTC	13	94.82	Travis Job 53.3

Source Files on build 53

Coverage	∆	File	Lines	Relevant	Covered	Missed	Hits/Line

bitwalker / libgraph / 53
96%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

New Missed Lines in Diff

Jobs

Source Files on build 53

bitwalker / libgraph / 53 96%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

New Missed Lines in Diff

Jobs

Source Files on build 53

bitwalker / libgraph / 53
96%

README BADGES
x