生成Grid_Network 边都为双向，边的权值固定为10

#include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>

 using namespace std;
 using std::vector;

   struct ArcBox
   {
    int headvex,tailvex;
    ArcBox *hlink,*tlink;
    float weight;
   };
 
   
 template <class TElemType>
 class Graph
 {
 public:

      vector<ArcBox*> back;//全局变量，希望它不要总被初始化，能递增的存储p
      void CreateOlgraph();
      void PrintOlgraph();
      void DFSOlgraph(int v,bool *visited,bool *finished); //表示顺向深度优先搜索
      void Graph<TElemType>::Backtraverse();
      void DFSOlgraph(int u,int v);
      void findcircle();
       
      
     
 private:

 /*  struct ArcBox
   {
    int headvex,tailvex;
    ArcBox *hlink,*tlink;
    float weight;
   };*/
  

   template <class TElemType>
   struct Vertex
   {
    TElemType data;
    ArcBox *firstin,*firstout;
   };
 
   struct Olgraph
   {
    int vexnum,arcnum;
    Vertex<TElemType> *vex;
   };
   Olgraph olgraph;               //有向图的十字链表存储结构
 
 
 };
 
 template <class TElemType>
 void Graph<TElemType>::CreateOlgraph()  // 创建十字链表
{
ArcBox *p,*q;;
//输入k
int a,b,k,i;
cout << "请输入k的值" << endl;
cin >> k;

a = k*k;//顶点数
b = 2*k*(k-1);//边数
olgraph.vexnum = a;//将输入的顶点数赋给图的顶点数
olgraph.arcnum = b;//将输入的边数赋给图的边数
olgraph.vex = (Vertex<TElemType> *)malloc(olgraph.vexnum * sizeof(Vertex<TElemType>));
  
  for(i = 0;i < olgraph.vexnum;i++)
  {
    olgraph.vex[i].data = i+1;//给每个顶点赋值
    olgraph.vex[i].firstin = olgraph.vex[i].firstout = NULL;
  
  } 
  
  for(i = 0; i < olgraph.vexnum; i++)
  {
      if((olgraph.vex[i].data)% k != 0 )
      {
          p = (ArcBox *)malloc(sizeof(ArcBox));
          q = (ArcBox *)malloc(sizeof(ArcBox));

          p ->tailvex = i;
          p ->tlink = olgraph.vex[i].firstout;olgraph.vex[i].firstout = p;
          p->headvex = i+1;
          p->hlink = olgraph.vex[i+1].firstin;olgraph.vex[i+1].firstin = p;
        
          q ->tailvex = i+1;
          q ->tlink = olgraph.vex[i+1].firstout;olgraph.vex[i+1].firstout = q;
          q ->headvex = i;
          q ->hlink = olgraph.vex[i].firstin;olgraph.vex[i].firstin = q;

          p->weight = 10;
          q->weight = 10;

      }
  }

    for(i = 0; i < olgraph.vexnum - k; i++)
      {
           p = (ArcBox *)malloc(sizeof(ArcBox));
          q = (ArcBox *)malloc(sizeof(ArcBox));

          p ->tailvex = i;
          p ->tlink = olgraph.vex[i].firstout;olgraph.vex[i].firstout = p;
          p->headvex = i+k;
          p->hlink = olgraph.vex[i+k].firstin;olgraph.vex[i+k].firstin = p;

          q ->tailvex = i+k;
          q ->tlink = olgraph.vex[i+k].firstout;olgraph.vex[i+k].firstout = q;
          q ->headvex = i;
          q ->hlink = olgraph.vex[i].firstin;olgraph.vex[i].firstin = q;

          p->weight = 10;
          q->weight = 10;

        }




}

//end create


 template <class TElemType>
 void Graph<TElemType>::PrintOlgraph()  // 输出十字链表
 {
   int k;
   ArcBox *p;
  cout << "    The Vertex Outdegree = >  " << endl;
   for(k = 0; k <olgraph.vexnum; k ++)
   {  
      p = olgraph.vex[k].firstout;
      cout << "    Vertex" << k+1 << ": ";
      while(p != NULL)
      {
         
      cout << "<"<<(p->tailvex)+1 << "," << (p->headvex)+1<< ">" << " ";
      p = p-> tlink;
       
     }
       cout << endl;
     
   }
 
     cout << endl;  cout << endl;  cout << endl;
 
    cout << "    The Vertex Indegree = >  " << endl;
   for(k = 0; k <olgraph.vexnum; k ++)
   {  
      p = olgraph.vex[k].firstin;
      cout << "    Vertex" << k+1 << ": ";
      while(p != NULL)
      {
         
      cout << "<"<<(p->tailvex)+1 << "," << (p->headvex)+1<< ">" << " ";
      p = p-> hlink;
       
      }
       cout << endl;
     
   }
 
 }

  
 
 int main()
 { 
  double duration;
  clock_t t_start, t_end;

  Graph<int> gph;
   
  gph.CreateOlgraph();
  gph.PrintOlgraph();  

 
  t_start=clock();

  //gph.findcircle();

  t_end = clock();

  duration = (double)(t_end - t_start)/(double)CLOCKS_PER_SEC;

  cout<< "Cost time: "<<duration <<"s"<<endl;
  //gph.findvector();
  
  return 0;

 }