Compact Data Structures by Gonzalo Navarro

Author:Gonzalo Navarro
Language: eng
Format: epub
Publisher: Cambridge University Press
Published: 2016-08-09T04:00:00+00:00

the former in time and the latter in constant time, without using further space.

Example 9.1 Figure 9.1 shows a directed graph, its classical representation (arrays N and V) and its new representation (sequence N and bitvector B). The outdegree of node 2 is . Its first neighbor is and its second neighbor is (see the solid gray arrows). Its indegree is . To find its first reverse neighbor we compute , then the neighbor is . For the second, we compute , and then . The process is shown with grayed blocks in N and gray dashed arrows to B.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.