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