A singly linked list can be considered a directed graph where each node has an outdegree of 1, just like a functional graph.
Currently, the only difference I can think of between the two is that a functional graph can be disconnected. I was wondering if there were any other differences between the two?