SYNOPSIS
This is a Functional Trie implementation. imerative-trie is the imperative version.
USAGE
const Vertex = // to start with the graph is just a single vertexvar vertex = // now lets add an edge to the vertex named "bob" that points to another vertex with the value "alice"vertex = vertex // if paths have more than one name in them they can arraysvertex = vertex// now the graph looks like:// [vertex]---friend--->[alice]---brother-->[bob] // path names and vertex values can be anythingvertex = vertex // edges are stored in a Mapvertexedges // Map{} // you can also iterate a pathvertices = ...vertex // delete an edgevertex = vertex// now the vertex is emptyvertexisEmpty // true