/// <summary>
/// 复制一幅图。复制图的节点，但不复制节点中的值。
/// </summary>
/// <param name="graph"></param>
/// <returns></returns>
static public GraphPoint <T>[] DepthCopy(GraphPoint <T>[] graph)
{
GraphPoint <T>[] result = new GraphPoint <T> [graph.Length];
Dictionary <GraphPoint <T>, int> indexCahe = new Dictionary <GraphPoint <T>, int>();
for (int i = 0; i < graph.Length; i++)
{
result[i] = new GraphPoint <T>(graph[i].value, new List <GraphPath <T> >());
indexCahe.Add(graph[i], i);
}
for (int i = 0; i < graph.Length; i++)
{
foreach (GraphPath <T> path in graph[i].neighbors)
{
Link(result[indexCahe[path.neighbor]], result[i], path.weight);
}
}
return(result);
}
/// <summary>
///
/// </summary>
/// <param name="neighbor">与当前节点通过该路径相连的节点</param>
/// <param name="weight">路径上的权值</param>
public GraphPath(GraphPoint <T> neighbor, float weight)
{
this.neighbor = neighbor;
this.weight = weight;
}
/// <summary>
/// 连接两个有权无向图节的节点
/// </summary>
/// <param name="p1">节点1</param>
/// <param name="p2">节点2</param>
/// <param name="weight">路径上的权重值</param>
public static void Link(GraphPoint <T> p1, GraphPoint <T> p2, float weight)
{
p1.neighbors.Add(new GraphPath <T>(p2, weight));
p2.neighbors.Add(new GraphPath <T>(p1, weight));
}