ListNode *newNode = NULL;  //This is the new vertex

   ListNode *nodePtr = NULL;   //Traversing pointer

   ListNode *downPtr = NULL;

for( i = 0; i<num_Nodes; i++)

    //ifor 
     {

         V_Name[i]=i+1;
          
 newNode = new ListNode;

         newNode->name = V_Name[i];



         newNode->next = NULL;

         newNode->down = NULL;

// Building the Vertex List

         if(!head)

            head = newNode;

         else

         {

            nodePtr = head;

            while(nodePtr->next)

            nodePtr = nodePtr->next;

            nodePtr->next = newNode;

           }

}//endifor
           


        for( j=0; j<num_Edges; j++)

      //jfor   
      {
               
        
           // cout << "What is the name of edge "<< j+1 << "?: ";
            scanf("%I64d" ,&v1[j]);
            scanf("%I64d" ,&v2[j]);
            scanf("%I64d" ,&alt);
            //elements[v1[j]+v2[j]+v1[j]*v2[j]]=alt;
            elements[v1[j]][v2[j]]=0;
            elements[v2[j]][v1[j]]=0;
            
            elements[v1[j]][v2[j]]=alt;
              elements[v2[j]][v1[j]]=alt;
           // cin>>v1[j]>>v2[j]>>E_Name[v1[j]+v2[j]+(v1[j]*v2[j])];
          //  cout<<"\n e_name"<<E_Name[5];

        
        
        ListNode *nodePtr = NULL;
        ListNode *downPtr = NULL;
            nodePtr = head;
           
           while(nodePtr)  //continue through all vertices

           {

         if(nodePtr->name==v1[j])
         break;
          else
          nodePtr=nodePtr->next;
          }
          /////////
          //nodePtr->next=NULL;
          ///////////////

            ListNode *downNode = NULL;

            down_head =nodePtr->down;

            downNode = new ListNode;

            downNode->name = v2[j];
           // downNode->w=elements[j];

            downNode->down = NULL;
		downNode->next = NULL; //!!!!!!!!!
//Building the Adjacent Vertex List

            if(!down_head)

            {

               nodePtr->down = downNode;

               down_head = downNode;

            }

            else

            {

               downPtr = down_head;


               while(downPtr->down)

                     downPtr = downPtr->down;


              downPtr->down = downNode;

            }
            //////////////
            //downPtr->down=NULL;
            //////////////////
                 ///////// for undirected
                 nodePtr=head;
                    
          while(nodePtr)  //continue through all vertices

    {

         if(nodePtr->name==v2[j])
         break;
          else
          nodePtr=nodePtr->next;
          }

            ListNode *downNode1 = NULL;

            down_head =nodePtr->down;

            downNode1 = new ListNode;

            downNode1->name = v1[j];

            downNode1->down = NULL;
		downNode1->next = NULL; //!!!!!!!!!

//Building the Adjacent Vertex List

            if(!down_head)

            {

               nodePtr->down = downNode1;

               down_head = downNode1;

            }

            else

            {

               downPtr = down_head;


               while(downPtr->down)

                     downPtr = downPtr->down;


              downPtr->down = downNode1;

            }
            
            

         }