/// <summary>
/// 构造函数.
/// </summary>
/// <param name="ID"></param>
public PassedPath(Node node)
{
this.CurNode = node;
this.Weight = double.MaxValue;
this.PassedNodeList = new List<Node>();
this.BeProcessed = false;
}
/// <summary>
/// 通过指定节点的边的权值初始化路径表
/// </summary>
/// <param name="originNode"></param>
private void InitializeWeight(Node originNode)
{
if ((originNode.EdgeList == null) || (originNode.EdgeList.Count == 0))
{
return;
}
foreach (Edge edge in originNode.EdgeList)
{
PassedPath pPath = this[edge.EndNodeID];
if (pPath == null)
{
continue;
}
pPath.PassedNodeList.Add(originNode);
pPath.Weight = edge.Weight;
}
}
/// <summary>
/// 从PlanCourse表中取出目标节点的PassedPath，这个PassedPath即是规划结果
/// </summary>
/// <returns></returns>
private RoutePlanResult GetResult(PlanCourse planCourse, string destID)
{
PassedPath pPath = planCourse[destID];
if (pPath.Weight == int.MaxValue)
{
RoutePlanResult result1 = new RoutePlanResult(null, int.MaxValue);
return result1;
}
Node[] passedNodeIDs = new Node[pPath.PassedNodeList.Count];
for (int i = 0; i < passedNodeIDs.Length; i++)
{
passedNodeIDs[i] = pPath.PassedNodeList[i];
}
RoutePlanResult result = new RoutePlanResult(passedNodeIDs, pPath.Weight);
return result;
}
public RoutePlanResult(Node[] passedNodes, double value)
{
m_resultNodes = passedNodes;
m_value = value;
}
/// <summary>
/// 初始化拓扑图
/// </summary>
public void Init()
{
// 下面的为测试代码：
/*
+----30---> E-----20-----+
| ^ |
| | |
| 10 |
| | v
A---+----10---> B D
| | ^
| 5 |
| | |
| v |
+----20---> C-----30-----+
*/
//***************** A Node *******************
Node aNode = new Node("A");
m_nodeList.Add(aNode);
//A -> B
Edge aEdge1 = new Edge();
aEdge1.StartNodeID = aNode.ID;
aEdge1.EndNodeID = "B";
aEdge1.Weight = 10;
aNode.EdgeList.Add(aEdge1);
//A -> C
Edge aEdge2 = new Edge();
aEdge2.StartNodeID = aNode.ID;
aEdge2.EndNodeID = "C";
aEdge2.Weight = 20;
aNode.EdgeList.Add(aEdge2);
//A -> E
Edge aEdge3 = new Edge();
aEdge3.StartNodeID = aNode.ID;
aEdge3.EndNodeID = "E";
aEdge3.Weight = 30;
aNode.EdgeList.Add(aEdge3);
//***************** B Node *******************
Node bNode = new Node("B");
m_nodeList.Add(bNode);
//B -> C
Edge bEdge1 = new Edge();
bEdge1.StartNodeID = bNode.ID;
bEdge1.EndNodeID = "C";
bEdge1.Weight = 5;
bNode.EdgeList.Add(bEdge1);
//B -> E
Edge bEdge2 = new Edge();
bEdge2.StartNodeID = bNode.ID;
bEdge2.EndNodeID = "E";
bEdge2.Weight = 10;
bNode.EdgeList.Add(bEdge2);
//***************** C Node *******************
Node cNode = new Node("C");
m_nodeList.Add(cNode);
//C -> D
Edge cEdge1 = new Edge();
cEdge1.StartNodeID = cNode.ID;
cEdge1.EndNodeID = "D";
cEdge1.Weight = 30;
cNode.EdgeList.Add(cEdge1);
//***************** D Node *******************
Node dNode = new Node("D");
m_nodeList.Add(dNode);
//***************** E Node *******************
Node eNode = new Node("E");
m_nodeList.Add(eNode);
//E -> D
Edge eEdge1 = new Edge();
eEdge1.StartNodeID = eNode.ID;
eEdge1.EndNodeID = "D";
eEdge1.Weight = 20;
eNode.EdgeList.Add(eEdge1);
}
