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

[Heap] #46

Merged
merged 2 commits into from
Mar 31, 2018
Merged

[Heap] #46

merged 2 commits into from
Mar 31, 2018

Conversation

loiane
Copy link
Owner

@loiane loiane commented Mar 31, 2018

No description provided.

@codecov
Copy link

codecov bot commented Mar 31, 2018

Codecov Report

Merging #46 into master will increase coverage by 7.16%.
The diff coverage is 0%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master      #46      +/-   ##
==========================================
+ Coverage   58.64%   65.81%   +7.16%     
==========================================
  Files         121      140      +19     
  Lines        2162     3651    +1489     
  Branches      281      354      +73     
==========================================
+ Hits         1268     2403    +1135     
- Misses        887     1237     +350     
- Partials        7       11       +4
Impacted Files Coverage Δ
src/js/algorithms/graph/depth-first-search.js 12% <0%> (-6.19%) ⬇️
src/js/data-structures/heap.js 0% <0%> (-28.58%) ⬇️
src/js/data-structures/graph.js 0% <0%> (ø)
src/ts/data-structures/heap.ts 75.92% <0%> (+2.34%) ⬆️
src/js/data-structures/avl-tree.js 1.69% <0%> (-21.39%) ⬇️
src/ts/algorithms/graph/dijkstra.ts 15.38% <0%> (-9.62%) ⬇️
src/js/algorithms/sorting/shell-sort.js 92.85% <0%> (-7.15%) ⬇️
src/ts/algorithms/graph/prim.ts 16.66% <0%> (-6.42%) ⬇️
... and 76 more

Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update bb112a0...5ee6666. Read the comment docs.

@loiane loiane merged commit cee5c1e into master Mar 31, 2018
@@ -43,12 +43,15 @@ export class MinHeap {
const left = this.getLeftIndex(index);
const right = this.getRightIndex(index);
const size = this.size();
if (left < size && this.compareFn(this.heap[element], this.heap[left]) > Compare.BIGGER_THAN) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@loiane, I got the third edition book but it seems it was still with this issue.

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.

2 participants