This repository has been archived by the owner on Oct 8, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 185
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
build seems to have died in a curious way, restarting |
Codecov Report
@@ Coverage Diff @@
## master #1005 +/- ##
=======================================
Coverage 99.84% 99.84%
=======================================
Files 76 76
Lines 2617 2617
=======================================
Hits 2613 2613
Misses 4 4 |
sbromberger
approved these changes
Sep 4, 2018
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.
Thank you for this!
SohamTamba
pushed a commit
to SohamTamba/LightGraphs.jl
that referenced
this pull request
Sep 9, 2018
sbromberger
pushed a commit
that referenced
this pull request
Sep 9, 2018
* 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
sbromberger
pushed a commit
that referenced
this pull request
Sep 17, 2018
* 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
sbromberger
pushed a commit
that referenced
this pull request
Sep 24, 2018
* 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
sbromberger
added a commit
that referenced
this pull request
Oct 3, 2018
* 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)
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
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.
Hawick & James algorithm was misspelled Hadwick & James.