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

joowani / binarytree / 156
100%

Build:
DEFAULT BRANCH: master
Ran 24 Jan 2021 09:11PM UTC
Jobs 3
Files 4
Run time 20min
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

pending completion
156

Pull #30

travis-ci

Benjamin Abel
Implement svg output in notebooks

This implementation use a simple algorithm in which the layout used is
based on a perfect tree of same height in which all leaves would be
regularly spaced.

This approach is ok for little trees to about 4 levels but for larger trees
with holes a better approach would be to implement the Reingold &
Tilford’s algorithm.
Pull Request #30:

519 of 519 relevant lines covered (100.0%)

3.0 hits per line

Jobs
ID Job ID Ran Files Coverage
3 156.3 24 Jan 2021 09:11PM UTC 0
100.0
Travis Job 156.3
4 156.4 24 Jan 2021 09:11PM UTC 0
100.0
Travis Job 156.4
5 156.5 24 Jan 2021 09:32PM UTC 0
100.0
Travis Job 156.5
Source Files on build 156
  • Tree
  • List 4
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Repo
  • Travis Build #156
  • Pull Request #30
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