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

Shoobx / python-graph
94%

Build:
DEFAULT BRANCH: master
Repo Added 24 Jan 2018 11:57AM UTC
Files 34
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 master
branch: SELECT
CHANGE BRANCH
x
  • No branch selected
  • master

pending completion
28

push

travis-ci

web-flow
Add another badge

CodeClimate provides a maintainability badge

1272 of 1354 relevant lines covered (93.94%)

2.82 hits per line

Relevant lines Covered
Build:
Build:
1354 RELEVANT LINES 1272 COVERED LINES
2.82 HITS PER LINE
Source Files on master
Detailed source file information is not available for this build.

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
28 master Add another badge CodeClimate provides a maintainability badge push 30 Jun 2018 05:23PM UTC web-flow travis-ci pending completion  
27 master swtich README to rst, add badges push 03 May 2018 01:13PM UTC agroszer travis-ci pending completion  
26 master updated changelog push 03 May 2018 01:05PM UTC agroszer travis-ci pending completion  
25 master Merge pull request #1 from dkorduban/dijkstra_e_log_v Make shortest_path run in O(E log V) instead of O(E^2) push 02 May 2018 01:08PM UTC web-flow travis-ci pending completion  
24 master Merge branch 'master' into dijkstra_e_log_v Pull #1 02 May 2018 12:44PM UTC web-flow travis-ci pending completion  
23 master Merge pull request #2 from dkorduban/add_edge_constant_time Make graph.add_edge run in O(1) instead of O(degree(V)) push 02 May 2018 12:42PM UTC web-flow travis-ci pending completion  
22 master Implementation of Kruskal's Minimimum Spanning Tree construction algorithm (#3) * Add unionfind class for disjoint set datastructure Implement kruskal's minimum spanning tree algorithm for sparse graph. * Fix resulted MST as digrah representa... push 29 Apr 2018 09:58AM UTC agroszer travis-ci pending completion  
21 master Fix resulted MST as digrah representation Add test code for splited minimum spanning tree construction algorithms Pull #3 28 Apr 2018 10:22AM UTC web-flow travis-ci pending completion  
20 master Add unionfind class for disjoint set datastructure Implement kruskal's minimum spanning tree algorithm for sparse graph. Pull #3 18 Apr 2018 06:26AM UTC web-flow travis-ci pending completion  
19 master Make graph.add_edge run in O(1) instead of O(degree(V)) Pull #2 10 Apr 2018 08:31PM UTC web-flow travis-ci pending completion  
See All Builds (17)
  • 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

© 2026 Coveralls, Inc