Function TestGraph

Infovis/BoostGraphAlgorithms/Testing/Cxx/TestBoostAdapter.cxx:158–234

template <typename Graph>
void TestGraph(Graph g, vtkIdType numVertices, vtkIdType numEdges, int repeat, int& errors)
{
  typedef typename graph_traits<Graph>::edge_descriptor Edge;
  typedef typename graph_traits<Graph>::vertex_descriptor Vertex;

  VTK_CREATE(vtkTimerLog, timer);

  std::vector<Vertex> graphVerts;
  std::vector<Edge> graphEdges;
  typename graph_traits<Graph>::vertex_iterator vi, viEnd;

  // Create a graph
  timer->StartTimer();
  for (int i = 0; i < numVertices; ++i)
  {
    add_vertex(g);
  }
  timer->StopTimer();
  std::cerr << "vertex insertion: " << timer->GetElapsedTime() / numVertices << " sec."
            << std::endl;

  if (static_cast<int>(num_vertices(g)) != numVertices)
  {
    std::cerr << "ERROR: Number of vertices (" << num_vertices(g) << ") not as expected ("
              << numVertices << ")." << std::endl;
    errors++;
  }

  for (boost::tie(vi, viEnd) = vertices(g); vi != viEnd; ++vi)
  {
    graphVerts.push_back(*vi);
  }

  timer->StartTimer();
  for (int i = 0; i < numEdges; ++i)
  {
    int u = static_cast<int>(vtkMath::Random(0, numVertices));
    int v = static_cast<int>(vtkMath::Random(0, numVertices));
    add_edge(graphVerts[u], graphVerts[v], g);
  }
  timer->StopTimer();
  std::cerr << "edge insertion: " << timer->GetElapsedTime() / numEdges << " sec." << std::endl;

  if (static_cast<int>(num_edges(g)) != numEdges)
  {
    std::cerr << "ERROR: Number of edges (" << num_edges(g) << ") not as expected (" << numEdges
              << ")." << std::endl;
    errors++;
  }

  typename graph_traits<Graph>::edge_iterator ei, eiEnd;
  for (boost::tie(ei, eiEnd) = edges(g); ei != eiEnd; ++ei)
  {
    graphEdges.push_back(*ei);
  }

  TestTraversal(g, repeat, errors);