Basic Network Operations under Spatial Grasp Model
Abstract:
The paper analyzes the rapidly growing popularity and importance of the use of graph and network models and tools in many areas, like transport, goods distribution, communications, sociology, economy, defense, security, psychology, and many others. It briefs the developed and patented Spatial Grasp Model and Technology (SGT) which allows for fully distributed and parallel operations on large networked structures, including general technology issues, basic Spatial Grasp Language (SGL), and the networked language implementation. Also investigates and classifies different works on network and graph operations and presents detailed solutions for the most basic network creation, modification, path finding, spanning and shortest path trees, strong and weak components, finding graph structures with spatial pattern matching, also flows in networks. The latter includes the well-known Ford Fulkerson method with an effective solution in SGL, which is much simpler and shorter than traditional implementations in Java and C. The investigated networks can be physical, virtual or combined, having both addresses and physical coordinates. The shown simple and compact solutions in SGL can operate on arbitrary large and complex networks in a highly parallel and fully distributed mode. They were obtained in a direct spatial thinking, spatial pattern recognition and pattern matching mode cultivated by the Spatial Grasp model and its psychology, rather than under traditional logic-based and algorithmic philosophy and culture. This may challenge existing opinions that parallel and distributed algorithms are usually more complex than traditional sequential ones, just proving the opposite, and especially for the network-related applications.
