Not sure about what's wrong with your code is but the answer to the
problem is Warshall's algorithm for graph closure.
Just to brief, say we are given the adjacency matrix A[1] where A[1][i]
[j] = 1 if there's an edge from i to j.
Let A[k][i][j] be the the number of paths from i to j passing
Here's the code.
void Closure(int **a, int v) //a is the given adjacency matrix and v
is the number of vertices
{
int **t1 = new int*[v];
int **t2 = new int*[v];
for(int i = 0; i v; ++i)
{
t1[i] = new int[v];
t2[i] = new int[v];
Consider a rectangle of M N .Inside that there are many small
overlapping rectangles.Now i have to minimize overlapping area such
that the % increase in size (M N) - 0 .
means readjust smaller rectangles such that they do't overlap.
Please suggest some algorithm !
Dear Colleagues:
I would appreciate if you would share the announcement below with those
who might be interested.
Best regards,
Ashu M. G. Solo
Publicity Chair, WORLDCOMP'07
Principal/RD Engineer, Maverick Technologies America Inc.
--
Can it be a solution?
At first let us think all the edges are undirected. That is if a adjacent to
b then both a-b and b-a are present. then we discard a-b if a is the
current vertex with maximum outdegree and b is its adjacent with minimum
outdegree and b-a is present
we continue it again and
