struct edge
{
        int start; //contains the indexs to the vertices
        int end;
        int cost;
};

typedef edge EDGE;
struct vertex
{
	vector<EDGE> edgeList;
	int cost;

	int operator==(const vertex &rhs) const
	{
		if( this->cost != rhs.cost) return 0;
   		
		return 1;
	}

	int operator<(const vertex &rhs) const
	{
		if( this->cost < rhs.cost)
			return 1;
		return 0;
	}
	

	vertex& operator=(const vertex &rhs) const
        {

	}


};

typedef vertex VERTEX;

displayVertex(vertList[0]);
        pq.push(vertList[0]);

vert = pq.top();
        displayVertex(vert);

//a program
#include <iostream>
#include <stdio.h>
#include <ctime>
#include <vector>
#include <queue>
#include "stdlib.h"
using namespace std;


struct edge
{
        int start; //contains the indexs to the vertices in vertList
        int end;
	int cost;
};

typedef edge EDGE;

struct vertex
{
	vector<EDGE> edgeList;
	int cost;

	int operator==(const vertex &rhs) const
	{
		if( this->cost != rhs.cost) return 0;
   		
		return 1;
	}

	int operator<(const vertex &rhs) const
	{
		if( this->cost < rhs.cost)
			return 1;
		return 0;
	}
	

	vertex& operator=(const vertex &rhs) const
        {

	}


};

typedef vertex VERTEX;

#define 	NO_LENGTH 	-1


//function definitions
void    initialize(int vertices, int edges);
void 	displayEdge(EDGE *edge);
void 	displayVertices(VERTEX *vertList, int vertices);
void 	displayAll(VERTEX *vertList, int vertices);
void 	dijkstras(VERTEX *vertList, int vertices, int edges);
void 	displayVertex(VERTEX vertex);

int main(int argc, char *argv[])
{
	int vertices;
	int edges;

	cin >> vertices;
        cin >> edges;



	initialize(vertices, edges);

}

void initialize(int vertices, int edges)
{
	//make an array of vertices.
	VERTEX *vertList = new VERTEX[vertices];		
	int i = -1;

	printf("Initialize: About to load in the files.\n\r");



	//load the edges into the array of vertices.
        while(++i <= edges-1)
        {

		EDGE newEdge;



		cin >> newEdge.start;
		cin >> newEdge.end;
		cin >> newEdge.cost;


		if(vertList[newEdge.start].edgeList.size() == 0)
		{
			VERTEX *newVertex = new VERTEX;

			vertList[newEdge.start] = *newVertex;

		}
		if(vertList[newEdge.end].edgeList.size() == 0)
                {
                        VERTEX *newVertex = new VERTEX;

                        vertList[newEdge.end] = *newVertex;


                }

		
		//add the 2 edges
		vertList[newEdge.start].edgeList.push_back(newEdge);

		vertList[newEdge.end].edgeList.push_back(newEdge);
        }


        printf("Initialize: File loaded!\n\r");

	displayAll(vertList, vertices);


	dijkstras(vertList, vertices, edges);

}


void dijkstras(VERTEX *vertList, int vertices, int edges)
{
	priority_queue<VERTEX> pq;
	VERTEX vert;
	int i;


	//init the list
	vertList[0].cost = 0;
	for(i=1;i < vertices;i++)
		vertList[i].cost = NO_LENGTH;

	//display to see if they are all right
	displayAll(vertList, vertices);

	//test vertex
	displayVertex(vertList[0]);
	pq.push(vertList[0]);
	vert = pq.top();
	displayVertex(vert);

/*	//put the whole vertLst into the que.
	for(i=0;i<vertices;i++)
	{
		pq.push(vertList[i]);
	}
		

	//display the que
	for(i=0;i<vertices;i++)
        {
		VERTEX vert;

		vert = pq.top();
		displayVertex(vert);
		pq.pop();
        }
*/


}

void displayEdge(EDGE *edge)
{

	if(edge)
	{
		printf("Start: %d. End: %d. Cost: %d\n\r", edge->start, edge->end, edge->cost);
	}
	else
		printf("NULL EDGE!\n\r");
}


void displayVertex(VERTEX vertex)
{
	printf("Vert has %d edges, with a cost of: %d.\n\r",
        vertex.edgeList.size(), vertex.cost);
}

void displayVertices(VERTEX *vertList, int vertices)
{
	int i;

	for(i = 0;i<vertices;i++)
        {
                if(vertList[i].edgeList.size() != 0)
                {
                        printf("Vert %d has %d edges, with a cost of: %d.\n\r", i, 
			vertList[i].edgeList.size(), vertList[i].cost);
                }
        }


}

void displayAll(VERTEX *vertList, int vertices)
{
	int i;

	for(i = 0;i<vertices;i++)
        {
                if(vertList[i].edgeList.size() != 0)
                {
                        int j;
                        printf("Vert %d cost: %d,  has these edges:\n\r", i, 
			vertList[i].cost);
                        for(j = 0; j < vertList[i].edgeList.size(); j++)
                        {
                                printf("Edge %d: Start: %d. End: %d. Cost: %d\n\r",
                                j,
                                vertList[i].edgeList[j].start,
                                vertList[i].edgeList[j].end,
                                vertList[i].edgeList[j].cost);
                        }
                        printf("-------------\n\r");
                }

        }


}

vert = pq.top();