클로저 재밌죠.. pipe 로 함수 합성하면 그렇게 이뻐보이더라고요 ㅋㅋ

사용자 적은 언어는 프래그래밍의 기본인
복사 붙여넣기가 힘듭니다.

{emo:onion-005.gif:100}

프로그래밍이 간단히 되는 건가ㅜ보네요

(ns dijkstra-example.core
(:require [clojure.set :as set]))

(defn dijkstra [graph start]
(let [vertices (keys graph)
;; Initialize distances map, start with 0 for `start` and infinity for others
distances (reduce (fn [dist v]
(assoc dist v (if (= v start) 0 Double/POSITIVE_INFINITY)))
{}
vertices)
;; Initialize the previous map for tracking the shortest path
previous {}
;; Set of unvisited nodes
unvisited (set vertices)]
(loop [distances distances
previous previous
unvisited unvisited]
(if (empty? unvisited)
{:distances distances :previous previous}
(let [;; Get the vertex with the smallest distance in the unvisited set
current (apply min-key distances (filter unvisited (keys distances)))
;; Get all neighbors of the current node
neighbors (graph current)]
;; Update distances for each neighbor
(let [distances (reduce (fn [dists [neighbor weight]]
(let [alt (+ (distances current) weight)]
(if (< alt (distances neighbor))
(assoc dists neighbor alt)
dists)))
distances
neighbors)
;; Update the previous node for each neighbor
previous (reduce (fn [prev [neighbor weight]]
(let [alt (+ (distances current) weight)]
(if (< alt (distances neighbor))
(assoc prev neighbor current)
prev)))
previous
neighbors)]
;; Mark the current node as visited
(recur distances previous (disj unvisited current))))))))

;; Example graph
(def graph
{:A [[:B 1] [:C 4]]
:B [[:C 2] [:D 6]]
:C [[:D 3]]
:D []})

;; Example usage
(def result (dijkstra graph :A))
(println "Distances:" (:distances result))
(println "Previous:" (:previous result))

재미있고 알흠다운 괄호월드.. 스킴은 마법사책 보셨나본데 그럼 엥간한건 다 아시는구먼요
클로저리안 slack서버에 #clojure-korea 채널 오셔서 모르시는거 물어보시면 좋아하실?겁니다 ㅎㅎ

생각보다 주위에 없는데 생각?보다 있습니다 ㅎㅎ