Basic Network Operations in Different Worlds Under SGT

Inheriting the analysis of networking in many areas provided in Chap. 2 , this chapter investigates and classifies existing works on main network and graph operations. After briefing the Spatial Grasp Technology and its Spatial Grasp Language (SGL) described in Chaps. 3 – 5 , it presents detailed SGL solutions for network creation, modification, path finding, spanning and shortest path trees, strong and weak components, graph pattern matching, also flows in networks. The latter includes well known Ford Fulkerson method with its solution in SGL which is much simpler and shorter than traditional implementations in Java and C. The networking solutions in SGL can operate on arbitrary large and complex networks, and in highly parallel and fully distributed mode.