codecov[bot]
commented
11 months ago Codecov Report
Attention: 4 lines in your changes are missing coverage. Please review.
Comparison is base (
447910a) 32.06% compared to head (c14106f) 28.72%. Report is 5 commits behind head on developer.
| Files | Patch % | Lines |
|---|---|---|
| src/Graphoscope/Measures/LongestPath.fs | 94.36% | 2 Missing and 2 partials :warning: |
Additional details and impacted files
```diff @@ Coverage Diff @@ ## developer #79 +/- ## ============================================= - Coverage 32.06% 28.72% -3.35% ============================================= Files 37 38 +1 Lines 2426 2942 +516 Branches 345 365 +20 ============================================= + Hits 778 845 +67 - Misses 1579 2026 +447 - Partials 69 71 +2 ```:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
This pull request adds a new feature to Graphoscope – the Longest Path Algorithm as mentioned in #58. Additionally, it includes tests to ensure the correctness of the algorithm and checks for graph cyclicity.
Changes Made
Added Longest Path Algorithm:
Implemented an inverse Dijkstra's algorithm for finding the longest paths from a specified node in a DAG.
Introduced a new function, compute, in the Measures.LongestPath module to calculate the longest path in a directed acyclic graph (DAG).
Added a function testing if a directed graph is acyclic
Graph Cyclicity Tests:
Added tests in the Tests.Measures.LongestPathTests module to verify the correctness of the algorithm.
Included tests to ensure that the algorithm correctly identifies whether the input graph is a directed acyclic graph (DAG) or not.