Question
1. a. Using C program, randomly generate an undirected graph represented by adjacency matrix with n = 1000 vertices. b. Determine number of edges in
1.
a. Using C program, randomly generate an undirected graph represented by adjacency matrix with n = 1000 vertices. b. Determine number of edges in the graph. Determine degrees of all vertices. Show that Handshaking logic holds. Determine computational time in this step (except printing time) in ms. c. Repeat steps 1 and 2 for n = 2000, n = 3000, n = 4000, and n = 5000.
d. Using MATLAB, draw a graph showing computational time vs. n. From the graph, determine an approximate time complexity of your program as a function of n.
Please Explain Everything clearly so that i can understand (dont copy from other sources)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started