networks: Add build-interaction-graph/form.

This commit is contained in:
Sergiu Ivanov 2020-11-19 00:14:54 +01:00
parent 8e100c2e8b
commit 0345cd3648

View file

@ -34,6 +34,7 @@
[interaction? (-> network? domain-mapping/c variable? variable? boolean?)]
[get-interaction-sign (-> network? domain-mapping/c variable? variable? (or/c #f -1 0 1))]
[build-interaction-graph (-> network? domain-mapping/c graph?)]
[build-interaction-graph/form (-> network-form? domain-mapping/c graph?)]
[build-signed-interaction-graph (-> network? domain-mapping/c graph?)]
[build-all-states (-> domain-mapping/c (listof state?))]
[make-same-domains (-> (listof variable?) generic-set? domain-mapping/c)]
@ -517,24 +518,29 @@
#:when (interaction? network doms x y))
(list x y))))
;;; Like build-interaction-graph, but accepts a network form and
;;; converts it a to a network.
(define (build-interaction-graph/form form doms)
(build-interaction-graph (network-form->network form) doms))
(module+ test
(test-case "build-interaction-graph"
(define n-bool (network-form->network
(define n-bool
(hash 'x '(not y)
'y 'x
'z '(and y z)
't '(or (and (not x) y)
(and x (not y))))))
(and x (not y)))))
(define bool-doms (make-boolean-domains '(x y z t)))
(check-equal? (graphviz (build-interaction-graph n-bool bool-doms))
(check-equal? (graphviz (build-interaction-graph/form n-bool bool-doms))
"digraph G {\n\tnode0 [label=\"y\"];\n\tnode1 [label=\"z\"];\n\tnode2 [label=\"x\"];\n\tnode3 [label=\"t\"];\n\tsubgraph U {\n\t\tedge [dir=none];\n\t\tnode0 -> node2;\n\t\tnode1 -> node1;\n\t}\n\tsubgraph D {\n\t\tnode0 -> node3;\n\t\tnode0 -> node1;\n\t\tnode2 -> node3;\n\t}\n}\n")
(define n-multi (network-form->network
(define n-multi
(hash 'x '(min (+ y 1) 2)
'y '(max (- y 1) 0)
'z '(- 2 y)
't '(abs (- y 1)))))
't '(abs (- y 1))))
(define 123-doms (make-same-domains '(x y z t) '(0 1 2)))
(check-equal? (graphviz (build-interaction-graph n-multi 123-doms))
(check-equal? (graphviz (build-interaction-graph/form n-multi 123-doms))
"digraph G {\n\tnode0 [label=\"y\"];\n\tnode1 [label=\"z\"];\n\tnode2 [label=\"x\"];\n\tnode3 [label=\"t\"];\n\tsubgraph U {\n\t\tedge [dir=none];\n\t\tnode0 -> node0;\n\t}\n\tsubgraph D {\n\t\tnode0 -> node2;\n\t\tnode0 -> node3;\n\t\tnode0 -> node1;\n\t}\n}\n")))
;;; Given a network, builds its signed interaction graph. The graph