We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Creating a graph with nesting of more than two levels causes an infinite loop.
Create nested graph structure like so.
$graph = new Digraph('G'); $graph->node('A')->edge(['A', 'B']); $sub1 = $graph ->subgraph('cluster_1') ->node('B') ->edge(['B', 'C']); $sub2 = $sub1->subgraph('cluster_2') ->node('C') ->edge(['C', 'D']); $sub3 = $sub2->subgraph('cluster_3') ->node('D');
The final call to Subgraph::createEdge() will create an infinite loop as it is unable to resolve the top level graph.
The text was updated successfully, but these errors were encountered:
alexandresalome#15 Fixing infinite loop caused by nested graphs, addi…
c29e075
…ng tests
Fixed in version 2
Sorry, something went wrong.
No branches or pull requests
Creating a graph with nesting of more than two levels causes an infinite loop.
Steps to reproduce
Create nested graph structure like so.
The final call to Subgraph::createEdge() will create an infinite loop as it is unable to resolve the top level graph.
The text was updated successfully, but these errors were encountered: