20
96%

Ran 17 Apr 2021 11:32PM UTC

Jobs 1

Files 17

Run time 1s

Badge

Embed ▾

pending completion

Build # 20

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

Jobs

ID	Job ID	Ran	Files	Coverage
1	20.1	17 Apr 2021 11:32PM UTC	0	95.92	Travis Job 20.1

Source Files on build 20

Detailed source file information is not available for this build.

dpaukov / classic-algo / 20
96%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 20

dpaukov / classic-algo / 20 96%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 20

dpaukov / classic-algo / 20
96%

README BADGES
x