General Naming Graph with a Single Root Node

Basic purpose of this article is to present General Naming Graph with a Single Root Node. Here discuss on the general organization of the UNIX file system implementation on a logical disk of contiguous disk blocks and the concept of a symbolic link explained in a naming graph. Here also focus on the comparison between recursive and iterative name resolution with respect to communication costs.