Graded discussion (GDB) will be launched on 22nd January, 2018 and it will remain open for two days. You can post your comments on the below mentioned topic till 23rd January, 2018.
Consider a very large undirected graph of Email Networks. The nodes (or vertices) represent email addresses, and an edge represents the fact that there was at least one email in at least one direction between the two addresses.
Which technique will you use for representation of the above mentioned Graph in a computer program for its manipulation?
Justify your answer with very well defined and sound reasoning.
A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 4-5 lines. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. For any queries please email at CS502@vu.edu.pk
Best of Luck!
Adjacency list .. yhi use ho ga es lie k
Insha Allah At 9PM
jo me post kia ha pehly wohi ha yeh ..
I think K Adjacency list will be used. As it includes both the techniques of representing a graph with vertices and edges satisfying the condition of a social network.
This is not the solution
I would prefer Adjacency lists. Please let me know if I am wrong
I would use 2 flat tables.
Address (AddressID*, Email)
Connection (Address1*, Address2*)
Address1 will be the ID number that is numerically lower of the pair.
1. Could have a large number of nodes.
2. Generally very large and sparce.
3. Requires relatively efficient search algorithm given a node.
4. In general, contains cycles.
Since cycles are present, we can safely eliminate trees. Lists are not useful since the number of branches is not constant. Consider matrix (each column/row is a node, intersection determines edges) but matrices are not space efficient.
Hash tables should provide an efficient storage, as well as rapid searches.
I think List technique is better because of space and time
koi argument hay app k pas