"Abodit Graph supports an in memory graph with strongly-typed nodes and edges. The graph is stored in an efficient start-node, end-node indexed structure allowing rapid graph traversals in either direction. In addition to the usual forward or backward navigation from a node by edge type it supports depth-first, breadth-first and random-first traversals to compute all ancestors or predecessors of a node. It also has limited shortest-path-finding methods, an approximate topological sort for ranking items in an inconsistent directed graph (e.g. user's preferences for A over B). "