Making some major refactors to the graph aggregation/discovery component, to reflect globally-backed nature of graphs. This makes recursion largely unnecessary, except when discovery takes place...in which case the recursion is reduced to a simple loop that continues until there are no new changes from discovery. Removing the flag for whether or not to store the graph...again, we're in a globally-backed driver scenario here with the use of neo4j.