Exemplo n.º 1
0
//outputs the set of feasible solutions
void MaximumCPlanarSubgraph::writeFeasible(const String &filename, 
	Master &master, 
	ABA_MASTER::STATUS &status)
{
	const ClusterGraph& CG = *(master.getClusterGraph());
	const Graph& G = CG.getGraph();
	node v;
	//first compute the nodepairs that are potential candidates to connect 
	//chunks in a cluster
	//potential connection edges
	NodeArray< NodeArray<bool> > potConn(G);
	forall_nodes(v, G)
	{
		potConn[v].init(G, false);
	}