本文整理汇总了C#中System.Collections.Generic.PriorityQueue.SetPriority方法的典型用法代码示例。如果您正苦于以下问题：C# PriorityQueue.SetPriority方法的具体用法？C# PriorityQueue.SetPriority怎么用？C# PriorityQueue.SetPriority使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类System.Collections.Generic.PriorityQueue的用法示例。
在下文中一共展示了PriorityQueue.SetPriority方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: findRouteD
// Finds the next node to hop to in the route to vertDestination and returns it's handler
// if all neighbour nodes are overloaded, than return the source node
private List<Vertex> findRouteD( int hndlSource, int hndlDestination )
{
int numNodes = this.xDim * this.yDim;
PriorityQueue<int, int> minRouteQ = new PriorityQueue<int, int>( numNodes );
List<Vertex> pathList = new List<Vertex>( numNodes - 1 );
// marking all vertices with infinite distance
foreach ( Vertex vrt in this.vertexList.TheList )
{
minRouteQ.AddToBottom( int.MaxValue, vrt.Handler );
}
// assigning the source vertex 0 distance value
minRouteQ.SetPriority( hndlSource, 0 );
int currentHandler = 0;
int minDistance;
// going through all vertices
while ( minRouteQ.Count() != 0 )
{
// checking what's on top of the priority queue
minDistance = minRouteQ.PeekTop().Priority;
currentHandler = minRouteQ.PeekTop().Data;
// removing the current element from the queue
minRouteQ.Dequeue();
// all remaining vertices are inaccesible from source
if ( minDistance == int.MaxValue )
{
break;
}
List<int> currentNeightBours = this.incidencyMatrix.GetConnectedVertices( currentHandler );
int distFromCurrent;
foreach ( int vHandler in currentNeightBours )
{
distFromCurrent = this.incidencyMatrix.GetDistance( currentHandler, vHandler ) + minDistance;
if ( minRouteQ.GetPriority(vHandler) > distFromCurrent )
{
minRouteQ.SetPriority( vHandler, distFromCurrent );
pathList.Add( this.vertexList.Find(vHandler) );
}
}
}
//minRouteQ
return pathList;
}