C / C++ / MFC

#ifndef EDGE_H
#define EDGE_H

class Edge
{
public:
	int v, w, weight;
	Edge(int firstVertex, int secondVertex, int edgeWeight)
	{
		v = firstVertex;
		w = secondVertex;
		weight = edgeWeight;
	}
};

#endif

#ifndef GRAPH_H
#define GRAPH_H

#include <vector>
#include <list>
#include <map>
#include "Edge.h"

using namespace std;

class Graph
{
public:
	int numVertices;
	int numEdges;

	vector<map<int, int> > adjList;

	Graph(int n);

	int getNumVertices() const;

	int getNumEdges() const;

	int getWeight(Edge e) const;

	void add(Edge e);

	void remove(Edge e);

	map<int, int>::iterator findEdge(int v, int w);
};

#endif

#include "Graph.h"

Graph::Graph(int n)
{
	map<int, int>element;
	adjList.assign(n, element);
	numVertices = n;
}

int Graph::getNumVertices() const
{
	return numVertices;
}

int Graph::getNumEdges() const
{
	return numEdges;
}

int Graph::getWeight(Edge e) const
{
	return e.weight;
}

void Graph::add(Edge e)
{
	int v = e.v,
		w = e.w,
		weight = e.weight;
	adjList[v].insert(make_pair(w, weight));
	adjList[w].insert(make_pair(v, weight));
	numEdges++;
}

void Graph::remove(Edge e)
{
	int v = e.v,
		w = e.w,
		weight = e.weight;
	adjList[e.v].erase(w);
	adjList[e.w].erase(v);
	numEdges--;
}

map<int, int>::iterator Graph::findEdge(int v, int w)
{
	map<int, int> m = adjList[v];
	map<int, int>::iterator iter = m.find(w);

	return iter;
}

#include "stdafx.h"
#include "windows.h"

INT WINAPI WinMain(HINSTANCE hInst, HINSTANCE, LPSTR, INT)
{
    WNDCLASSEX wc = {sizeof(WNDCLASSEX), CS_CLASSDC, MsgProc, 0L, 0L
                     GetModuleHandle(NULL), NULL, NULL, NULL, NULL,
                     TEXT("TEST"), NULL};
    RegisterClassEx(&wc);

    HWND hWnd = CreateWindow(TEXT("TEST"), TEXT("TEST"),
                WS_OVERLAPPEDWINDOW, 100, 100, 512, 512,
                GetDesktopWindow(), NULL, wc.hInstance, NULL);
}