• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

bearmug / algorithms-stanford-scala
98%
master: 100%

Build:
Build:
LAST BUILD BRANCH: 22-median-maintenance-problem
DEFAULT BRANCH: master
Repo Added 30 Jan 2017 06:22PM UTC
Files 8
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

LAST BUILD ON BRANCH 18-dijkstra-shortest-paths-calculation
branch: 18-dijkstra-shortest-paths-calculation
CHANGE BRANCH
x
Reset
  • 18-dijkstra-shortest-paths-calculation
  • 11-dual-pivot-quicksort
  • 22-median-maintenance-problem
  • master

pending completion
127

push

travis-ci

bearmug
#18 dummy test submission

119 of 121 relevant lines covered (98.35%)

2.91 hits per line

Relevant lines Covered
Build:
Build:
121 RELEVANT LINES 119 COVERED LINES
2.91 HITS PER LINE
Source Files on 18-dijkstra-shortest-paths-calculation
  • List 0
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
127 18-dijkstra-shortest-paths-calculation #18 dummy test submission push 04 Mar 2017 11:50PM UTC bearmug travis-ci pending completion  
See All Builds (94)
  • Repo on GitHub
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2025 Coveralls, Inc