-
Notifications
You must be signed in to change notification settings - Fork 117
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Caching Adjacency Matrix for faster edge lookup #344
Conversation
Codecov Report
@@ Coverage Diff @@
## master #344 +/- ##
==========================================
+ Coverage 97.31% 97.41% +0.09%
==========================================
Files 55 55
Lines 8455 8539 +84
==========================================
+ Hits 8228 8318 +90
+ Misses 227 221 -6
Flags with carried forward coverage won't be shown. Click here to find out more.
|
@@ -105,6 +105,39 @@ TEST(GraphTest, GetNodeSet_2) { | |||
}) != nodeSet.end()); | |||
} | |||
|
|||
TEST(GraphTest, FindEdge_Test) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please add spacing in logical places between lines in this test. It's hard to read
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Done. Please review.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks great so far!
Only one nit from me to maybe rename getCacheAdjMatrix()
to cacheAdjMatrix()
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
All my comments have been addressed. Thanks!
Looks good to me as well |
This PR is for Issue #340 .