Skip to content

Instantly share code, notes, and snippets.

@kazu-yamamoto
kazu-yamamoto / gist:5218431
Last active July 22, 2022 13:44
Purely functional Dijkstra algorithm using priority search queue to find shortest paths
-- % cabal install PSQueue
-- % ghci Dijkstra.hs
-- > dijkstra sample A
-- [(A,0,A),(D,4,A),(E,7,D),(C,8,E),(B,9,E)]
module Dijkstra where
import Control.Applicative hiding (empty)
import Data.List (unfoldr)
import Data.Maybe (fromJust)
@sanxiyn
sanxiyn / lisp.c
Created August 14, 2010 04:16
Lisp
#include <assert.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
enum type {
NIL,