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
The model below can be used to reproduce a NullReferenceException that happens with the following sequence of actions:
solve pm 1 Graph.conforms
domain Graph { Node ::= new (id: Integer). Edge ::= new (src: Integer, dst: Integer). edgeHasSrc ::= (src: Integer). edgeHasDst ::= (dst: Integer). path ::= (Integer, Integer). cycle ::= (Integer). badSrc ::= (src: Integer). badDst ::= (dst: Integer). edgeHasSrc(a) :- Edge(a, b), Node(a). edgeHasDst(b) :- Edge(a, b), Node(b). badSrc(a) :- Edge(a, b), no edgeHasSrc(a). badDst(b) :- Edge(a, b), no edgeHasDst(b). path(a, b) :- Edge(a, b). path(a, c) :- path(a, b), path(b, c). cycle(a) :- path(a, a). conforms no badSrc(_). conforms no badDst(_). enoughNodes :- count({ n | n is Node(_)}) > 4. conforms enoughNodes. enoughEdges :- count({ e | e is Edge(_, _)}) = 3. conforms enoughEdges. enoughCycles :- count({ c | c is cycle(_)}) = 4. conforms enoughCycles. } partial model pm of Graph [solver_RecursionBound = 5] { Node(t). Node(u). Node(v). Node(w). Node(x). Edge(l, m). Edge(n, o). Edge(p, q). Edge(r, s). Edge(a, b). Edge(c, d). }
Stack trace below.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
The model below can be used to reproduce a NullReferenceException that happens with the following sequence of actions:
solve pm 1 Graph.conforms
Stack trace below.
The text was updated successfully, but these errors were encountered: