99 個 Elm 問題/問題 86
節點度數和圖著色 / 86.a) 計算圖中節點的度數。
86.b) List all nodes of a graph sorted by degree. / 86.c) Use Welch-Powell's algorithm to paint the nodes of a graph in such a way that adjacent nodes have different colors.
# # # 這是一個存根 # # #
Example in Elm:
import Html exposing (text)
import List
f : Int -> Int
-- your implementation goes here
main = text (toString (f 0))
結果
4