bool Graph::strange (int u, int v) { if (Adj [u].size () != Adj[v].size ()) return false; int mySize (int) Adj[u].size (); for (int i = 0; i < mySize; i++) { if (Adj [u] [i] ! Adj[v] [i]) return false; }//for i return true;

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Assume that a given directed graph is represented as an Adjacency Lists and implemented as
vector<vector<int> > Adj. Briefly describe what the following code does and analyze it's time
complexity.
1 bool Graph::strange (int u, int v){
2
if (Adj [u].size () != Adj [v].size ())
return false;
int mySize = (int) Adj[u].size ();
for (int i = 0; i < mySize; i++) {
if (Adj [u] [i] != Adj[v] [i])
return false;
9.
10
}//for i
12
return true;
13 }
Mt5 678 301 23
H1L1
Transcribed Image Text:Assume that a given directed graph is represented as an Adjacency Lists and implemented as vector<vector<int> > Adj. Briefly describe what the following code does and analyze it's time complexity. 1 bool Graph::strange (int u, int v){ 2 if (Adj [u].size () != Adj [v].size ()) return false; int mySize = (int) Adj[u].size (); for (int i = 0; i < mySize; i++) { if (Adj [u] [i] != Adj[v] [i]) return false; 9. 10 }//for i 12 return true; 13 } Mt5 678 301 23 H1L1
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY