22
94%

Ran 29 Apr 2018 09:58AM UTC

Jobs 3

Files 34

Run time 1min

Badge

Embed ▾

pending completion

Build # 22

Build Type

push

travis-ci

Committed by

agroszer

Commit Message

Implementation of Kruskal's Minimimum Spanning Tree construction algorithm (#3)

* Add unionfind class for disjoint set datastructure
Implement kruskal's minimum spanning tree algorithm for sparse graph.

* Fix resulted MST as digrah representation
Add test code for splited minimum spanning tree construction algorithms

Run Details

52 of 52 new or added lines in 3 files covered. (100.0%)

1274 of 1356 relevant lines covered (93.95%)

2.81 hits per line

Jobs

ID	Job ID	Ran	Coverage
1	22.1	29 Apr 2018 09:58AM UTC	93.73	Travis Job 22.1
2	22.2	29 Apr 2018 09:59AM UTC	93.73	Travis Job 22.2
3	22.3	29 Apr 2018 09:59AM UTC	93.95	Travis Job 22.3

Source Files on build 22

Detailed source file information is not available for this build.

Shoobx / python-graph / 22
94%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 22

Shoobx / python-graph / 22 94%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 22

Shoobx / python-graph / 22
94%

README BADGES
x