Ran
|
Jobs
1
|
Files
280
|
Run time
23s
|
Badge
README BADGES
|
travis-ci
5978 of 7907 relevant lines covered (75.6%)
0.76 hits per line
Lines | Coverage | ∆ | File |
---|---|---|---|
2 |
90.38 |
-3.85% | algorithms/sort/top_sort.py |
ID | Job ID | Ran | Files | Coverage | |
---|---|---|---|---|---|
3 | 929.3 (TOX_ENV=py37,coverage) | 280 |
75.6 |
Travis Job 929.3 |
Coverage | ∆ | File | Lines | Relevant | Covered | Missed | Hits/Line |
---|---|---|---|---|---|---|---|
0.0 | algorithms/graph/minimum_spanning_tree.py | 130 | 47 | 0 | 47 | 0.0 | |
0.0 | ...thms/graph/path_between_two_vertices_in_digraph.py | 51 | 38 | 0 | 38 | 0.0 | |
0.0 | algorithms/graph/dijkstra.py | 36 | 22 | 0 | 22 | 0.0 | |
0.0 | algorithms/graph/find_path.py | 53 | 41 | 0 | 41 | 0.0 | |
0.0 | algorithms/graph/find_all_cliques.py | 35 | 22 | 0 | 22 | 0.0 | |
0.0 | algorithms/graph/markov_chain.py | 26 | 17 | 0 | 17 | 0.0 | |
0.0 | algorithms/graph/cycle_detection.py | 52 | 24 | 0 | 24 | 0.0 | |
0.0 | algorithms/graph/clone_graph.py | 97 | 52 | 0 | 52 | 0.0 | |
0.0 | ...gorithms/graph/check_digraph_strongly_connected.py | 53 | 43 | 0 | 43 | 0.0 | |
0.0 | algorithms/graph/satisfiability.py | 126 | 68 | 0 | 68 | 0.0 |