Data structure for representing a graph: combination of linked list and hash table

Details Data structure for representing a graph: combination of linked list and hash table Data structure for representing a graph: combination of linked list and hash table

2009-08-21

arxiv.org/abs/0908.3089v1

Computer Science

Data Structures and Algorithms

7 pages

Scientific paper

In this article we discuss a data structure, which combines advantages of two different ways for representing graphs: adjacency matrix and collection of adjacency lists. This data structure can fast add and search edges (advantages of adjacency matrix), use linear amount of memory, let to obtain adjacency list for certain vertex (advantages of collection of adjacency lists). Basic knowledge of linked lists and hash tables is required to understand this article. The article contains examples of implementation on Java.

Affiliated with

Also associated with

No associations

Rating

Data structure for representing a graph: combination of linked list and hash table does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Data structure for representing a graph: combination of linked list and hash table, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data structure for representing a graph: combination of linked list and hash table will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-666535