Dijkstra's algorithm

[momotaro]

am having a final tomorrow am not yet done with dijkstra!!!
plz help this is my code waht is wrong with it!

void Dijkstra(char *root, char *destination, GraphNode *head)
{
    GraphNode *Root, *dest, *GraphNodeWalker, *vertmin;
    ListNode *ListNodeWalker;
    int flag;
 
 
    /*set the root */
 
    Root = FindVertex(head,root);
 
    distance[Root->num] = 0;
    visited1[Root->num] = 1;
    /* set adjacent to the root */
 
    for(ListNodeWalker = Root->HeadAdjacencyList; ListNodeWalker; ListNodeWalker = ListNodeWalker->NextListNode)
    {
        if(strcmp(root,ListNodeWalker->IP) != 0)
        {
            distance[(FindVertex(head, ListNodeWalker->IP))->num] = ListNodeWalker->weight; //problem is here
            path[(FindVertex(head, ListNodeWalker->IP))->num] = Root;
        }
    }
    /* find the destination vertex and beggan the loop */
 
    dest = FindVertex(head, destination);
 
    while( visited1[dest->num] == 0)  /* until the destination vertex is found */
    {
        flag=0;
        for(GraphNodeWalker = head; GraphNodeWalker; GraphNodeWalker = GraphNodeWalker->NextGraphNode)
        {
            if(visited1[GraphNodeWalker->num]==0 && flag==0)
            {
                vertmin=GraphNodeWalker;
                flag=1;
            }
 
            if(flag==1 && distance[GraphNodeWalker->num] < distance[vertmin->num] && visited1[GraphNodeWalker->num] == 0)
            {
                vertmin = GraphNodeWalker;
            }
        }
 
        visited1[FindVertex(head,vertmin->IP)->num] = 1;
 
        for(ListNodeWalker = vertmin->HeadAdjacencyList; ListNodeWalker; ListNodeWalker = ListNodeWalker->NextListNode)
        {
            if(distance[FindVertex(head, ListNodeWalker->IP)->num]>distance[FindVertex(head,vertmin->IP)->num] + ListNodeWalker->weight)
            {
                distance[FindVertex(head, ListNodeWalker->IP)->num] = distance[FindVertex(head,vertmin->IP)->num] + ListNodeWalker->weight;
                path[FindVertex(head, ListNodeWalker->IP)->num] = FindVertex(head,vertmin->IP);
            }
        }
    }
}