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

joowani / binarytree / 156 / 3
100%
master: 100%

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

24 Jan 2021 09:11PM UTC coverage: 100.0%. First build
156.3

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%)

1.0 hits per line

Source Files on job 156.3
  • Tree
  • List 0
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 146
  • Travis Job 156.3
  • 993fc627 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

© 2026 Coveralls, Inc