Shoobx / python-graph
94%

DEFAULT BRANCH: master
Repo Added
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

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
1354 RELEVANT LINES 1272 COVERED LINES
2.82 HITS PER LINE
Source Files on master
Coverage ∆ File Lines Relevant Covered Missed Hits/Line

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
28 master Add another badge CodeClimate provides a maintainability badge push web-flow travis-ci pending completion  
27 master swtich README to rst, add badges push agroszer travis-ci pending completion  
26 master updated changelog push 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 web-flow travis-ci pending completion  
24 master Merge branch 'master' into dijkstra_e_log_v Pull #1 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 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 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 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 web-flow travis-ci pending completion  
19 master Make graph.add_edge run in O(1) instead of O(degree(V)) Pull #2 web-flow travis-ci pending completion  
See All Builds (17)