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 (int i = 0 i < row * row i++)
{
this.distance[i] = d[i]
//使用gray code的解法
#include <iostream>
#include <cmath>
using Namespace std
#define ZERO 0
#define ONE 1
#define ODD 1
#define EVEN 0
#define RIGHT 1
#define LEFT 0
#define MAX 10
