private static int Hunt()
{
for (int i = 0; i < g.numVert(); ++i)
{
if (!visited[i])
{
List <int> neighbors = g.Neighbors(i / g.cols, i % g.cols);
foreach (int neighbor in neighbors)
{
if (visited[neighbor])
{
g.addEdge(i, neighbor, default(T));
g.addEdge(neighbor, i, default(T));
visited[i] = true;
return(i);
}
}
}
}
return(-1);
}