scolobb
/
dds
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

utils: Refactor update-graph. 

Make update-graph follow a little bit more the guidelines here:
https://docs.racket-lang.org/style/Choosing_the_Right_Construct.html
This commit is contained in:
Sergiu Ivanov 2020-03-20 21:42:10 +01:00
parent 519f3759ea
commit 435ee34acb
1 changed files with 14 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
utils.rkt
View File

@ -277,16 +277,20 @@
;;; functions. If gr is an weighted graph, the result is a weighted
;;; graph. If gr is an unweighted graph, the result is an unweighted
;;; graph.
(define (update-graph gr #:v-func [v-func identity] #:e-func [e-func identity])
(let ([edges (for/list ([e (in-edges gr)])
(match-let ([(list u v) e])
(if (unweighted-graph? gr)
(list (v-func u) (v-func v))
(list (e-func (edge-weight gr u v))
(v-func u) (v-func v)))))])
(if (unweighted-graph? gr)
(unweighted-graph/directed edges)
(weighted-graph/directed edges))))
(define (update-graph gr
#:v-func [v-func identity]
#:e-func [e-func identity])
(define edges
(for/list ([e (in-edges gr)])
(match-let ([(list u v) e])
(cond
[(unweighted-graph? gr) (list (v-func u) (v-func v))]
[else (list (e-func (edge-weight gr u v))
(v-func u) (v-func v))]))))
(cond
[(unweighted-graph? gr) (unweighted-graph/directed edges)]
[else
(weighted-graph/directed edges)]))
;;; ===============