Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

non deterministic behaviour in RPST generation #9

Open
GoogleCodeExporter opened this issue Aug 20, 2015 · 3 comments
Open

non deterministic behaviour in RPST generation #9

GoogleCodeExporter opened this issue Aug 20, 2015 · 3 comments

Comments

@GoogleCodeExporter
Copy link

What steps will reproduce the problem?

Create a RPST for the graph given:

MultiDirectedGraph multiGraph = new MultiDirectedGraph();

Vertex start= new Vertex("START", "START");
Vertex xor1 = new Vertex("XOR_1", "XOR_1");
Vertex xor2 = new Vertex("XOR_2", "XOR_2");
Vertex xor3 = new Vertex("XOR_3", "XOR_3");
Vertex xor4 = new Vertex("XOR_4", "XOR_4");
Vertex xor5 = new Vertex("XOR_5", "XOR_5");
Vertex xor6 = new Vertex("XOR_6", "XOR_6");
Vertex f12 = new Vertex("F12", "F12");
Vertex f56 = new Vertex("F56", "F56");
Vertex f34 = new Vertex("F34","F34");
Vertex end = new Vertex("END", "END");


start.setId("1");
xor1.setId("2");
xor2.setId("3");
xor3.setId("4");
xor4.setId("5");
xor5.setId("6");
xor6.setId("7");
f12.setId("8");
f34.setId("9");
f56.setId("10");
end.setId("11");

multiGraph.addVertex(start);
multiGraph.addVertex(xor1);
multiGraph.addVertex(xor2);
multiGraph.addVertex(xor3);
multiGraph.addVertex(xor4);
multiGraph.addVertex(xor5);
multiGraph.addVertex(xor6);
multiGraph.addVertex(f12);
multiGraph.addVertex(f34);
multiGraph.addVertex(f56);
multiGraph.addVertex(end);


multiGraph.addEdge(start,xor1);
multiGraph.addEdge(xor1,xor2);
multiGraph.addEdge(xor1,f12);
multiGraph.addEdge(f12,xor2);
multiGraph.addEdge(xor2,xor1);
multiGraph.addEdge(xor2,xor3);
multiGraph.addEdge(xor2,xor5);
multiGraph.addEdge(xor3,xor4);
multiGraph.addEdge(xor3,f34);
multiGraph.addEdge(f34,xor4);
multiGraph.addEdge(xor4,xor5);
multiGraph.addEdge(xor4,xor1);
multiGraph.addEdge(xor5,f56);
multiGraph.addEdge(f56,xor6);
multiGraph.addEdge(xor6,xor1);
multiGraph.addEdge(xor6,xor3);
multiGraph.addEdge(xor6,xor5);

RPST rpst = new RPST(multiGraph);

The decompostion of the graph is not deterministic. Multiple executions show 
that there exists a variation in the amount of identified bonds and polygons.

Original issue reported on code.google.com by [email protected] on 8 Jul 2015 at 12:20

@GoogleCodeExporter
Copy link
Author

[deleted comment]

@GoogleCodeExporter
Copy link
Author

I Forgot to add the edge:

multiGraph.addEdge(xor6,end);

and I forgot to remove the edge:

multiGraph.addEdge(xor1,xor2);

still nondeterministic behaviour

Original comment by [email protected] on 8 Jul 2015 at 12:36

@GoogleCodeExporter
Copy link
Author

Variance in the number of bonds observed.

Original comment by [email protected] on 9 Jul 2015 at 2:33

  • Changed state: Accepted

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant