Skip to content
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

Get Neighbors implementation for Undirected and Directed Graphs with Tests #164

Open
wants to merge 4 commits into
base: master
Choose a base branch
from

Conversation

rohanbadlani
Copy link

Throughout the usage of SNAP platform, there are many graph algorithms for which the user might need neighborhood data and hence adding that functionality as easy to use methods.

[Build] The build is passing.

[Testing] Tested the functionality and provides results as expected but will be writing rigorous tests.

I am not sure on where to add the documentation for this, but I have used comments in the codebase to make things quite clear and will be happy to help provide/edit documentation for this.

SUNet Id: rbadlani.

@rohanbadlani rohanbadlani changed the title Get Neighbors implementation for Undirected Graph Get Neighbors implementation for Undirected and Directed Graphs with Tests Dec 17, 2018
@rohanbadlani
Copy link
Author

Adding in the implementation for directed graphs as well.

@rohanbadlani
Copy link
Author

Added Tests in the tests/tests-TUNGraph.cpp and tests/tests-TNGraph.cpp that follow the same convention as all the other tests. These test basic functionality using a small test graph.

SUNet Id: rbadlani

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant