#include <iostream>
#include "graph.h"
using namespace std;
const int VERTICE_COUNT = 3;
int main()
{
Graph<int> G(VERTICE_COUNT);
for(int i = 0; i < VERTICE_COUNT; i++)
{
G.addVertice( ::make_shared<int>(i) );
}
for(int i = 1; i < VERTICE_COUNT; i++)
{
G.connect(0, i, i);
}
::cout << G;
return 0;
}
if(x > y)
return std::make_pair(y, x);
else
return std::make_pair(x, y);
return x > y ? std::make_pair(y, x) : std::make_pair(x, y);
return std::make_pair(x > y ? y : x, x > y ? x : y);