C#最短路径算法.doc

C#实现路径规划（最短路径）算法 该图算法描述的是这样的场景：图由节点和带有方向的边构成，每条边都有相应的权值，路径规划（最短路径）算法就是要找出从节点A到节点B的累积权值最小的路径。??? 首先，我们可以将“有向边”抽象为Edge类： ????public?class?Edge????{????????public?string?StartNodeID?;????????public?string?EndNodeID???;????????public?double?Weight??????;?//权值，代价????????????} ??? 节点则抽象成Node类，一个节点上挂着以此节点作为起点的“出边”表。 ??? public class Node??? {??????? private string iD ;??????? private ArrayList edgeList ;//Edge的集合－－出边表 ??????? public Node(string id )???? {??????????? this.iD = id ;??????????? this.edgeList = new ArrayList() ;??????? } ??????? property#region property??????? public string ID???? {??????????? get????????? {??????????????? return this.iD ;??????????? }??????? } ??????? public ArrayList EdgeList????? {??????????? get????????? {??????????????? return this.edgeList ;??????????? }??????? }??????? #endregion??? }? ??? 在计算的过程中，我们需要记录到达每一个节点权值最小的路径，这个抽象可以用PassedPath类来表示： ??? ///?summary????///?PassedPath?用于缓存计算过程中的到达某个节点的权值最小的路径????///?/summary????public?class?PassedPath????{????????private?string?????curNodeID?;????????private?bool?????beProcessed?;???//是否已被处理????????private?double?????weight?;????????//累积的权值????????private?ArrayList?passedIDList?;?//路径????????public?PassedPath(string?ID)????????{????????????this.curNodeID?=?ID?;????????????this.weight????=?double.MaxValue?;????????????this.passedIDList?=?new?ArrayList()?;????????????this.beProcessed?=?false?;????????}????????#region?property????????public?bool?BeProcessed????????{????????????get????????????{????????????????return?this.beProcessed?;????????????}????????????set????????????{????????????????this.beProcessed?=?value?;????????????}????????}????????public?string?CurNodeID????????{????????????get????????????{????????????????return?this.curNodeID?;????????????}????????}????????public?double?Weight?????????{????????????get????????????{????????????????return?this.weight?;????????????}????????????set????????????{????????????????this.w