Test centrality with generic graph #272
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR changes the centrality algorithms so that they test with GenericGraph instead of SimpleGraph.
Some tests did fail, because we passed the output of
vertices(g)
todegree
- but previously that function would not only accept anAbstractVector
and not a generic collection of vertices, so I changedindegree
,outdegree
anddegree
, so that they can take an arbitrary collection of vertices. Maybe in the future, we could also just demand, thatvertices(g)
returns anAbstractVector
.Furthermore there was an issue with
betweenness_centrality
where we tried to index intovertices(g)
- this also would have been a non-issue, ifvertices(g)
was anAbstractVector
.Lastly, I had to change the input in the
sample
method, that could also not deal with the output ofvertices(g)
.