[jira] [Created] (SINGA-63) Graph sort not terminate

["Sheng Wang (JIRA)" <ji...@apache.org>]

Sheng Wang created SINGA-63:
-------------------------------

             Summary: Graph sort not terminate
                 Key: SINGA-63
                 URL: https://issues.apache.org/jira/browse/SINGA-63
             Project: Singa
          Issue Type: Bug
            Reporter: Sheng Wang


There is a bug in Graph.sort that may lead to no termination of the program.
It only occurs when the graph contains bi-connected nodes.
An example is as follows:

TEST(GraphTest, Test1) {
  Graph g;
  g.AddNode("a");
  g.AddNode("b");
  g.AddNode("c");
  g.AddNode("d1");
  g.AddNode("d2");
  g.AddNode("e");
  g.AddNode("f");
  g.AddEdge("d1", "d2");
  g.AddEdge("d2", "d1");
  g.AddEdge("a", "b");
  g.AddEdge("b", "c");
  g.AddEdge("c", "d1");
  g.AddEdge("e", "d2");
  g.AddEdge("d1", "f");
  g.AddEdge("d2", "f");
  g.Sort();
}



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)