A Versatile Data Structure Schema and Algorithms Based on Edge-Symmetry

This paper shows a abstract description and its data structure of edge-symmetry for graph algorithms which can be applied in entity data structure of the three-dimensional objects. It formed a graph traverse algorithm and its construction using edges as key over the edge-symmetry. It is very easy and convenient to travel and access forward and backward to the adjutant entity and is important to access to the topological relationship among entity in three dimensional objects. We show their traveling primitive functions which effectively support the disposable graph way of the edge-symmetry based on the edge-symmetry. Also It is useful for programming with the algorithm proposed in different entity modeling. The time and space complexity of different topological primitives is proved O(n) on the schema.