Manage attributes as a graph

Algorithms for traversing the graph

Functions in theory implementing an arborescence algorithm but in practice
broken for the forseeable future

Kosaraju algorithm implementation

Utility functions for handling keywords. 

Functions are memoized in situations where they handle at most one or two
keywords directly (at a time, that is), as opposed to operating on
collections.

Multipath protocol

Declaring for use of shorthand keywords

Global spec declarations

Utility functions for graph management