How are graphs maintained in the memory of a computer?
Answers
Answered by
0
There are two standard ways of maintaining a graph G in the memory of a computer. One way, called the sequential representation ofG is by means of its adjacency matrixA. The other way, called the linked representation or adjacency structure of G, uses linked lists of neighbors. Matrices are usually used when the graph G is dense, and linked lists are usually used when G is sparse. (A graph G with m vertices and n edges is said to be dense when m = O(n2) and sparse when m = O(n) or even O(n log n).)
Regardless of the way one maintains a graph G in memory, the graph G is normally input into the computer by its formal definition, that is, as a collection of vertices and a collection of pairs of vertices (edges).
Email Based Homework Assignment Help in Representing Graphs in Computer Memory
Transtutors is the best place to get answers to all your doubts regarding representing graphs in computer memory, dense graph and adjacency structure of graph with examples. You can submit your school, college or university level homework or assignment to us and we will make sure that you get the answers you need which are timely and also cost effective. Our tutors are available round the clock to help you out in any way with discrete mathematics.
Live Online Tutor Help for Representing Graphs in Computer Memory
Transtutors has a vast panel of experienced discrete mathematics tutors who specialize in representing graphs in computer memory and can explain the different concepts to you effectively. You can also interact directly with our discrete mathematics tutors for a one to one session and get answers to all your problems in your school, college or university level discrete mathematics. Our tutors will make sure that you achieve the highest grades for your discrete mathematics assignments. We will make sure that you get the best help possible for exams such as the AP, AS, A level, GCSE, IGCSE, IB, Round Square etc.
Regardless of the way one maintains a graph G in memory, the graph G is normally input into the computer by its formal definition, that is, as a collection of vertices and a collection of pairs of vertices (edges).
Email Based Homework Assignment Help in Representing Graphs in Computer Memory
Transtutors is the best place to get answers to all your doubts regarding representing graphs in computer memory, dense graph and adjacency structure of graph with examples. You can submit your school, college or university level homework or assignment to us and we will make sure that you get the answers you need which are timely and also cost effective. Our tutors are available round the clock to help you out in any way with discrete mathematics.
Live Online Tutor Help for Representing Graphs in Computer Memory
Transtutors has a vast panel of experienced discrete mathematics tutors who specialize in representing graphs in computer memory and can explain the different concepts to you effectively. You can also interact directly with our discrete mathematics tutors for a one to one session and get answers to all your problems in your school, college or university level discrete mathematics. Our tutors will make sure that you achieve the highest grades for your discrete mathematics assignments. We will make sure that you get the best help possible for exams such as the AP, AS, A level, GCSE, IGCSE, IB, Round Square etc.
Similar questions