code: private void initNShortPath(Graph inGraph, int nValueKind)
      {
          graph = inGraph;
          N = nValueKind;
  
          // 获取顶点的数目
          vertexCount = inGraph.vertexes.length;
  
          fromArray = new CQueue[vertexCount - 1][];  // 不包含起点
          weightArray = new double[vertexCount - 1][];
  
          //每个节点的最小堆
          for (int i = 0; i < vertexCount - 1; i++)
          {
              fromArray[i] = new CQueue[nValueKind];
              weightArray[i] = new double[nValueKind];
  
              for (int j = 0; j < nValueKind; j++)
                  fromArray[i][j] = new CQueue();
          }
      }
docs: 初始化，主要分配内存
  @param inGraph 输入图
  @param nValueKind 希望的N值