The Gateway to Computer Science Excellence
0 votes

please give answer or name a book from where i can access

Describe two different data structures to represent a graph. For each such representa-
tion, specify a simple property about the graph that can be more efficiently checked
in that representation than in the other representation. Indicate the worst case time
required for verifying both of your properties in either representation.

in Written Exam by (15 points)
edited by | 40 views
Adjacency List and Adjacency Matrix? Or Array or Linked List?

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,616 answers
102,353 users