Closed kevinkle closed 5 years ago
Merging #62 into master will increase coverage by
2.1%
. The diff coverage is91.8%
.
@@ Coverage Diff @@
## master #62 +/- ##
=========================================
+ Coverage 70.35% 72.45% +2.1%
=========================================
Files 15 15
Lines 560 610 +50
=========================================
+ Hits 394 442 +48
- Misses 166 168 +2
Impacted Files | Coverage Δ | |
---|---|---|
prairiedog/errors.py | 46.15% <0%> (ø) |
:arrow_up: |
prairiedog/graph.py | 78.57% <100%> (ø) |
:arrow_up: |
prairiedog/edge.py | 100% <100%> (ø) |
:arrow_up: |
prairiedog/node.py | 88.88% <81.81%> (+1.38%) |
:arrow_up: |
prairiedog/lemon_graph.py | 89.44% <95%> (+2.44%) |
:arrow_up: |
Continue to review full report at Codecov.
Legend - Click here to learn more
Δ = absolute <relative> (impact)
,ø = not affected
,? = missing data
Powered by Codecov. Last update c53810c...d7621a7. Read the comment docs.
Add the initial code for querying path
Debug providing Edge.eq broke hashable?
Add a test against LGGraph.path() that will fail
Add a test against LGGraph.path() that will fail
Ignore node in LGGraph.path() query, and unravel
Convert to a Edge before calling LGGraph._find_path()
Do a cast to int if Edge.incr is not int
Fix Edge.incr cast if None, and pass txn into LGGraph._find_path()
See what chain were getting
Return the Nodes for a path as a tuple
Allow tests to pass if working
<2 not <=2
<2 not <=2
Fix: paths is a nested tuple
Fix linting errors
Add additional tests for LGGraph.path()
Add additional tests for LGGraph.path()
Add code to rejoin Node values, and tests against it
Add code to rejoin Node values, and tests against it