-
Notifications
You must be signed in to change notification settings - Fork 182
Conversation
Codecov Report
@@ Coverage Diff @@
## master #949 +/- ##
==========================================
+ Coverage 99.85% 99.85% +<.01%
==========================================
Files 80 83 +3
Lines 2691 2707 +16
==========================================
+ Hits 2687 2703 +16
Misses 4 4 |
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.
I would rather these be
vertex_cover(g::AbstractGraph, alg::RandomCover)
vertex_cover(g::AbstractGraph, alg::DegreeCover)
vertex_cover(g::AbstractGraph, alg::ParallelCover)
or
vertex_cover_random(g::AbstractGraph)
vertex_cover_degree(g::AbstractGraph)
vertex_cover_parallel(g::AbstractGraph)
so that the methods sort together in tab complete.
@sbromberger which bikeshed color do you prefer? I am in favor of more alg types. We could also make it kwargs.
Blue. I think that consistency dictates we use either a passed struct to designate the algorithm (the way we do with |
313f86c
to
0aa787a
Compare
@sbromberger can you take a look at this? |
This looks good to me, but I'd like @jpfairbanks to take a look as well. |
Can we have some naming convention that helps recognizing heuristics from exact algorithms? |
d5450df
to
aa6562f
Compare
@somil55 |
@SohamTamba Try benchmarking it using |
Efficiency is being discussed in #960 |
@SohamTamba this needs a conflict resolution. Also, what's the status? Are we ready for review? (cc @somil55 ) |
@sbromberger It's ready but can we merge #960 first? Changes will have to be made to this PR based on how #960 ends up. |
…r#984) * Fix kruskal_mst for working with abstract graphs * Remove abstract edge type in kruskal * Fix edgetype
We will probably want to move this into SimpleGraphs at some point, but until then, I think this is good.
* attempt 32-bit compatibility * don't allow downsampling to Int32: introduces accuracy bugs * add 0.7 and nightly tests * allow integers in betweenness centrality * attempt to fix parallel 32-bit * work around splitrange issue * Revert "work around splitrange issue" This reverts commit 58cbcf8. * splitrange overload
* Add simple_cycles_limited_length. * Revisions after review comments. Merging because it looks like codecov is hung up.
Fix zenodo error
* OneTo * fixes reverse (sbromberger#994) We will probably want to move this into SimpleGraphs at some point, but until then, I think this is good. * Lots more doctests (sbromberger#995) * SimpleGraph(SimpleGraph) plus tests. (sbromberger#998) * added documentation for SimpleGraph and SimpleDiGraph constructors (sbromberger#1001) * fixes edgeiter equality (sbromberger#1002) * 32-bit compatibility (sbromberger#999) * attempt 32-bit compatibility * don't allow downsampling to Int32: introduces accuracy bugs * add 0.7 and nightly tests * allow integers in betweenness centrality * attempt to fix parallel 32-bit * work around splitrange issue * Revert "work around splitrange issue" This reverts commit 58cbcf8. * splitrange overload * MultiThreaded Centrality Measures Implementations (sbromberger#987) * misc doc fixes (sbromberger#1003) * Fix sbromberger#999 (sbromberger#1004) * Parallel BFS Generate Reduce
08d8fdb
to
3a54050
Compare
@somil55 can you take a look? |
b0c864a
to
12e1db6
Compare
@somil55 @jpfairbanks @SohamTamba - can we make a decision on this PR please? What needs to happen here? Thank you. |
@sbromberger I think its ready. I changed the interface to use structs as requested. |
Congrats, @SohamTamba - and thanks for a great GSOC!!! |
@sbromberger It was a great experience working with you'll |
congrats @SohamTamba :) |
* Fix kruskal_mst function for working with abstract graphs (#984) * Fix kruskal_mst for working with abstract graphs * Remove abstract edge type in kruskal * Fix edgetype * fixes reverse (#994) We will probably want to move this into SimpleGraphs at some point, but until then, I think this is good. * Lots more doctests (#995) * SimpleGraph(SimpleGraph) plus tests. (#998) * added documentation for SimpleGraph and SimpleDiGraph constructors (#1001) * fixes edgeiter equality (#1002) * 32-bit compatibility (#999) * attempt 32-bit compatibility * don't allow downsampling to Int32: introduces accuracy bugs * add 0.7 and nightly tests * allow integers in betweenness centrality * attempt to fix parallel 32-bit * work around splitrange issue * Revert "work around splitrange issue" This reverts commit 58cbcf8. * splitrange overload * MultiThreaded Centrality Measures Implementations (#987) * misc doc fixes (#1003) * Fix #999 (#1004) * Karger Min Cut (#988) * Fix misspelling. (#1005) * Fixed some bugs in simplecycles_hawick_james (#1007) * Add function to find short cycles (#1006) * Add simple_cycles_limited_length. * Revisions after review comments. Merging because it looks like codecov is hung up. * Update .zenodo.json Fix zenodo error * Parallel BFS with static and dynamic load balancing (#943) * OneTo * fixes reverse (#994) We will probably want to move this into SimpleGraphs at some point, but until then, I think this is good. * Lots more doctests (#995) * SimpleGraph(SimpleGraph) plus tests. (#998) * added documentation for SimpleGraph and SimpleDiGraph constructors (#1001) * fixes edgeiter equality (#1002) * 32-bit compatibility (#999) * attempt 32-bit compatibility * don't allow downsampling to Int32: introduces accuracy bugs * add 0.7 and nightly tests * allow integers in betweenness centrality * attempt to fix parallel 32-bit * work around splitrange issue * Revert "work around splitrange issue" This reverts commit 58cbcf8. * splitrange overload * MultiThreaded Centrality Measures Implementations (#987) * misc doc fixes (#1003) * Fix #999 (#1004) * Parallel BFS Generate Reduce * VertexCover
* inflate * Vertex Cover (#949) * Fix kruskal_mst function for working with abstract graphs (#984) * Fix kruskal_mst for working with abstract graphs * Remove abstract edge type in kruskal * Fix edgetype * fixes reverse (#994) We will probably want to move this into SimpleGraphs at some point, but until then, I think this is good. * Lots more doctests (#995) * SimpleGraph(SimpleGraph) plus tests. (#998) * added documentation for SimpleGraph and SimpleDiGraph constructors (#1001) * fixes edgeiter equality (#1002) * 32-bit compatibility (#999) * attempt 32-bit compatibility * don't allow downsampling to Int32: introduces accuracy bugs * add 0.7 and nightly tests * allow integers in betweenness centrality * attempt to fix parallel 32-bit * work around splitrange issue * Revert "work around splitrange issue" This reverts commit 58cbcf8. * splitrange overload * MultiThreaded Centrality Measures Implementations (#987) * misc doc fixes (#1003) * Fix #999 (#1004) * Karger Min Cut (#988) * Fix misspelling. (#1005) * Fixed some bugs in simplecycles_hawick_james (#1007) * Add function to find short cycles (#1006) * Add simple_cycles_limited_length. * Revisions after review comments. Merging because it looks like codecov is hung up. * Update .zenodo.json Fix zenodo error * Parallel BFS with static and dynamic load balancing (#943) * OneTo * fixes reverse (#994) We will probably want to move this into SimpleGraphs at some point, but until then, I think this is good. * Lots more doctests (#995) * SimpleGraph(SimpleGraph) plus tests. (#998) * added documentation for SimpleGraph and SimpleDiGraph constructors (#1001) * fixes edgeiter equality (#1002) * 32-bit compatibility (#999) * attempt 32-bit compatibility * don't allow downsampling to Int32: introduces accuracy bugs * add 0.7 and nightly tests * allow integers in betweenness centrality * attempt to fix parallel 32-bit * work around splitrange issue * Revert "work around splitrange issue" This reverts commit 58cbcf8. * splitrange overload * MultiThreaded Centrality Measures Implementations (#987) * misc doc fixes (#1003) * Fix #999 (#1004) * Parallel BFS Generate Reduce * VertexCover * More examples... (#1014) * More examples... * Update core.jl shortcut to Digraph creation * Update bipartition.jl * More doctests (#1016) * Xrefs/examples again * More examples! (#1018) * Centrality examples (#1019) * Biconnectivity examples (#1021) * Examples for some operators (#1022) * Fixes https://github.com/JuliaGraphs/MetaGraphs.jl/issues/55 (#1023) * Fixes https://github.com/JuliaGraphs/MetaGraphs.jl/issues/55 (#1023)
cc @somil55