Abstract
Graphs are a fundamental part of computer science and various scientific fields. They are used in numerous applications, from social networks to electronic design automation. Efficient graph representation is important for modern algorithms, especially in economical contexts, where resource-efficient implementations play a significant role by reducing the resource consumption. This is essential in environments where computing resources are a high priority. There are many representations of graphs as data structure. One of these types is adjacency list: it is collection of linked lists which shows the connection of source and destination vertices. Adjacency lists are more memory-efficient than adjacency matrices because they only allocate memory for vertices with at least one edge in the graph. However, traditional implementations of adjacency lists do not fully use the features provided by modern CPUs, such as the cache line. Our design of Adjacency List is cache friendly and is keeping the main structure of traditional implementation. The main idea is derived from C#’s dictionary implementation for hash tables, which uses one array combining all data that should be in linked lists. Our results show that cache friendly implementation of Adjacency list outperforms it in lookup and insertion operations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
