99 Elm Problems/Problem 86
Jump to navigation Jump to search
Node degree and graph coloration / 86.a) Calculate the degree of a node in a graph.
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.
# # # THIS IS A STUB # # #
Example in Elm:
import Html exposing (text) import List f : Int -> Int -- your implementation goes here main = text (toString (f 0))