While previous work (scriptingraph) focus on graph traversal strategies and fundamental algorithms to execute and run a sequence of processes, recent work leads towards constructing and testing graph data structure for geospatial services.

In a process based graph, the main key concerns are topological sort and to sequence nodes by its dependancies. An extension to standard DAG was implemented to handle loops. The potential extensions to this is the ability to dispatch parallel processes at various levels based on the topology of the graph.

Recent work with geospatial services has been in many ways simpler as graphs has been used in the industry for a long period of time as with the resources and references available.