堆如何知道要排序的内容？(How does Heap know what to sort by?)

 如果这个问题听起来含糊不清，我道歉。 我目前使用Javascript来创建一个A *寻路算法。 我有一个对象列表，每个对象都有一个属性f ，我希望使用minheap数据结构对列表进行排序。 
 
 我不明白的是如何修改基于排序的内容。 我提到的对象有多个属性，比如h和g 。 有没有我不知道的符号？ 我使用npm下载了堆包 。 
 
 到目前为止我所拥有的是： 
 
var Heap = require('heap');
var heap = new Heap();
.
.
.
heap.push(start) // start is an object, specifically a Cell inside a grid

if(!heap.empty){
  // where I am having trouble
}
 
 我试图替代的代码（出于性能原因）是： 
 
var winner = 0;
for (var i = 0; i < openSet.length; i++) {
    if (openSet[i].f < openSet[winner].f) {
        winner = i;
    }
}
 
 我将不胜感激任何指导。 谢谢。 

My apologies if this question sounds vague. I am currently using Javascript to create an A* pathfinding algorithm. I have a list of Objects that each have an attribute f and I would like to use the minheap data structure to sort through a list. 
 
What I don't understand is how to modify what to base the sorting on. The Objects I mentioned have multiple attributes, like h and g for instance. Is there a notation that I am not aware of? I downloaded the heap package using npm.
 
So far what I have is:
 
var Heap = require('heap');
var heap = new Heap();
.
.
.
heap.push(start) // start is an object, specifically a Cell inside a grid

if(!heap.empty){
  // where I am having trouble
}
 
And the code I am trying to substitute (for performance reasons) is:
 
var winner = 0;
for (var i = 0; i < openSet.length; i++) {
    if (openSet[i].f < openSet[winner].f) {
        winner = i;
    }
}
 
I would appreciate any guidance. Thank you.

原文：https://stackoverflow.com/questions/47404800