1
96%
master: 96%

Ran 17 Apr 2021 11:32PM UTC

Files 17

Run time 1s

Badge

Embed ▾

Committed 17 Apr 2021 11:31PM UTC coverage: 95.918% (+0.6%) from 95.331%

Job # 20.1

Build Type

push

travis-ci

Committed by

dpaukov

Commit Message

Graph represented by 2D arrays: Demonstrates general BFS and DFS algorithms for graph presented by 2D arrays. Only positive values are considered edges in the grid (graph[i][j]). Zero or negative values represents walls (edge absences).

Run Details

752 of 784 relevant lines covered (95.92%)

0.96 hits per line

dpaukov / classic-algo / 20 / 1
96%
master: 96%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 20.1

dpaukov / classic-algo / 20 / 1 96% master: 96%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 20.1

dpaukov / classic-algo / 20 / 1
96%
master: 96%

README BADGES
x