Produces adjancency lists for the entities in the complete graph reachable from the entity passed in. This routine figures out the graph to process by walking it, using a hashtable (recursed) to take note which nodes are already processed. When it finds an entity A and an entity B having a relation in the graph (have 'an edge'), and A is depending on B, we add B to the adjacency list of A, though we don't add A to the adjacency list of B.

public void ProduceAdjacencyLists<TEntity>(
	TEntity entityToExamine,
	Dictionary<Guid, Dictionary<Guid, TEntity>> adjacencyLists,
	Dictionary<Guid, TEntity> recursed
)
where TEntity : class, IEntityCore

Public Sub ProduceAdjacencyLists(Of TEntity As {Class, IEntityCore}) ( 
	entityToExamine As TEntity,
	adjacencyLists As Dictionary(Of Guid, Dictionary(Of Guid, TEntity)),
	recursed As Dictionary(Of Guid, TEntity)
)