vcut2

Source: tests/multifrontal/symbolic/vcut.cpp

// ========================================================================= //
// This file is part of MyraMath, copyright (c) 2014-2019 by Ryan A Chilton  //
// and distributed by MyraCore, LLC. See LICENSE.txt for license terms.      //
// ========================================================================= //

// Containers.
#include <myramath/sparse/Pattern.h>
#include <myramath/sparse/PatternRange.h>
#include <myramath/multifrontal/symbolic/detail/Graph.h>
#include <myramath/multifrontal/symbolic/detail/VertexCut.h>

// Algorithms.
#include <myramath/sparse/laplacian2.h>
#include <myramath/multifrontal/symbolic/detail/vcut.h>

// Reporting.
#include <tests/myratest.h>

using namespace myra;

// Tests vcut() for a Graph containing one Vertex.
ADD_TEST("vcut1","[symbolic]")
  {
  Graph graph;
  graph.push_vertex( Graph::Vertex(0,1) );
  graph.open_edges(0);
  graph.close_edges(0);
  graph.verify();

  VertexCut cut = vcut(graph);
  verify(cut,graph);
  REQUIRE(cut.group[0]==2);
  }

// Tests vcut() for a Graph containing two Vertex's.
ADD_TEST("vcut2","[symbolic]")
  {
  Graph graph;
  graph.push_vertex( Graph::Vertex(0,2) );
  graph.push_vertex( Graph::Vertex(1,1) );
  graph.open_edges(0);
  graph.push_edge( Graph::Edge(0,1) );
  graph.close_edges(0);
  graph.open_edges(1);
  graph.push_edge( Graph::Edge(1,0) );
  graph.close_edges(1);
  graph.verify();
  
  VertexCut cut = vcut(graph);
  verify(cut,graph);
  REQUIRE(cut.group[0]!=2);
  REQUIRE(cut.group[1]==2);  
  }

// Tests vcut() for a Graph containing three Vertex's.
ADD_TEST("vcut3","[symbolic]")
  {
  Graph graph;
  graph.push_vertex( Graph::Vertex(0,1) );
  graph.push_vertex( Graph::Vertex(1,1) );
  graph.push_vertex( Graph::Vertex(2,1) );  
  graph.open_edges(0);
  graph.push_edge( Graph::Edge(0,1) );
  graph.close_edges(0);
  graph.open_edges(1);
  graph.push_edge( Graph::Edge(1,0) );
  graph.push_edge( Graph::Edge(1,2) );  
  graph.close_edges(1);
  graph.open_edges(2);
  graph.push_edge( Graph::Edge(2,1) );
  graph.close_edges(2);
  graph.verify();
  
  VertexCut cut = vcut(graph);
  verify(cut,graph);
  REQUIRE(cut.group[0]!=2);
  REQUIRE(cut.group[1]==2);
  REQUIRE(cut.group[2]!=2);
  REQUIRE(cut.group[0]!=cut.group[2]);
  }

// Tests vcut() for a structured Graph with known minimum separator size.
ADD_TEST("vcut_structured","[symbolic][.]")
  {
  Pattern P = stencil2(40,10);
  Graph graph = make_Graph(P);
  graph.verify();
  VertexCut cut = vcut(graph);
  verify(cut,graph);
  myra::out() << "cut.weight[0|2|1] = " << cut.weight[0] << "|" << cut.weight[2] << "|" << cut.weight[1] << std::endl;
  REQUIRE(cut.weight[2] < cut.weight[0]);
  REQUIRE(cut.weight[2] < cut.weight[1]);
  }

Results: [PASS]

Go back to Summary of /test programs.