typed-graph/graph.rkt

80 lines
2.5 KiB
Racket
Raw Normal View History

2020-12-27 22:56:59 +01:00
;;; Copyright 2021 Sergiu Ivanov <sivanov@colimite.fr>
;;;
;;; Licensed under the Apache License, Version 2.0 (the "License");
;;; you may not use this file except in compliance with the License.
;;; You may obtain a copy of the License at
;;;
;;; http://www.apache.org/licenses/LICENSE-2.0
;;;
;;; Unless required by applicable law or agreed to in writing, software
;;; distributed under the License is distributed on an "AS IS" BASIS,
;;; WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
;;; See the License for the specific language governing permissions and
;;; limitations under the License.
#lang typed/racket
;;; This file implements Alex Knauth's solution presented here:
;;;
;;; https://stackoverflow.com/questions/65386334/racket-generic-graph-library-in-typed-racket
(module graph-wrapper racket
(require (prefix-in g: graph))
(provide graph? has-vertex? has-edge?
directed-graph
graphviz)
;; Wrap the opaque graph structure coming from the generic
;; graph library.
(struct graph (g))
2021-01-01 21:52:26 +01:00
(define gg graph-g)
2021-01-01 21:31:14 +01:00
(define (has-vertex? g v)
2021-01-01 21:52:26 +01:00
(g:has-vertex? (gg g) v))
(define (has-edge? g u v)
2021-01-01 21:52:26 +01:00
(g:has-edge? (gg g) u v))
;; 2 Graph constructors
;; 2.2 Weighted graphs
(define (directed-graph es [ws #f])
(graph (g:directed-graph es ws)))
;; 10 Graphviz
(define (graphviz g #:output [output #f] #:colors [colors #f])
2021-01-01 21:52:26 +01:00
(g:graphviz (gg g) #:output output #:colors colors)))
(require/typed/provide 'graph-wrapper
[#:opaque Graph graph?]
2021-01-01 21:31:14 +01:00
[has-vertex? (-> Graph Any Boolean)]
[has-edge? (-> Graph Any Any Boolean)]
;; 2 Graph constructors
;; 2.2 Weighted graphs
[directed-graph (->* ((Listof (List Any Any))) ((Listof Any)) Graph)]
;; 10 Graphviz
[graphviz (->* (Graph)
(#:output Output-Port
#:colors (HashTable Any Natural))
String)])
(module+ test
;; The goal of the tests is to check that all of the provided
;; functions can be invoked without errors. The tests do not check
;; whether the results make sense.
(require typed/rackunit)
(test-case "1 Generic Graph Interface"
(define g (directed-graph '((a b) (b c))))
2021-01-01 21:56:50 +01:00
(check-false (has-edge? g 'a 'c))
(check-true (has-vertex? g 'a)))
(test-case "10 Graphviz"
(define g (directed-graph '((a b) (b c))))
2021-01-01 21:56:50 +01:00
(check-equal? (graphviz g)
"digraph G {\n\tnode0 [label=\"c\"];\n\tnode1 [label=\"b\"];\n\tnode2 [label=\"a\"];\n\tsubgraph U {\n\t\tedge [dir=none];\n\t}\n\tsubgraph D {\n\t\tnode1 -> node0;\n\t\tnode2 -> node1;\n\t}\n}\n")))