Dijkstra算法求最短路径(C#版) using System
using System.Collections
using System.Text
namespace Greedy
{
class Marx
{
private int[] distance
private int row
private ArrayList ways = new ArrayList()
public Marx(int n,params int[] d)
{
this.row = n
distance = new int[row * row]
for ( ...
/dl/239495.html
标签：
System
using
Collections
namespace
上传时间：
2013-12-29
上传用户：liglechongchong
