C / C++ / MFC

<br />
void CMySplitterWnd::ChangeView(int row, int col, CRuntimeClass* pViewClass)<br />
{<br />
	ASSERT(pViewClass->IsDerivedFrom(RUNTIME_CLASS(CView)));<br />
<br />
	CView* pView = STATIC_DOWNCAST(CView, GetPane(row, col));<br />
	CFrameWnd* pFrame = pView->GetParentFrame();<br />
	ASSERT(pFrame);<br />
<br />
	// set up create context to preserve doc/frame etc.<br />
	CCreateContext cc;<br />
	memset(&cc, 0, sizeof(cc));<br />
	cc.m_pNewViewClass = pViewClass;<br />
	cc.m_pCurrentDoc = pView->GetDocument();<br />
	cc.m_pNewDocTemplate = cc.m_pCurrentDoc ?<br />
		cc.m_pCurrentDoc->GetDocTemplate() : NULL;<br />
	cc.m_pCurrentFrame = pFrame;<br />
<br />
	DeleteView(row, col);					 // delete old view<br />
	TRACE("Rows=%d,Columns=%d",GetRowCount,GetColumnCount);<br />
	VERIFY(CreateView(row, col,			 // create new one<br />
		pViewClass,<br />
		CSize(0,0),								 // will fix in RecalcLayout<br />
		&cc));<br />
<br />
	RecalcLayout();							 // recompute layout <br />
<br />
	// initialize the view<br />
	CWnd* pWnd = GetPane(row, col);<br />
	if (pWnd)<br />
		pWnd->SendMessage(WM_INITIALUPDATE);<br />
}<br />
<br />

#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;
}