3 ms·

There's even a purely functional graph library, allowing cycles: http://web.engr.oregonstate.edu/~erwig/fgl/haskell/old/fgl0103.pdf http://web.engr.oregonstate

• pdexter 10y ago
  It's not a 'cyclic data structure' though. It allows cycles in that every node has an ID and you can freely point to nodes to create cycles. For a cyclic graph with true cycles see https://www.cs.utexas.edu/~wcook/Drafts/2012/graphs.pdf https://www.cs.utexas.edu/~wcook/Drafts/2012/graphs.pdf