Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
}  }  adjList[from].push_back(temp);     return true;   }   V is the number of total vertices in the graph, E is the average number of edges per vertex.     O(logV + E)     O(E+V)     O(ElogV)     O(logV)     O(1)     O(V)

}  }  adjList[from].push_back(temp);     return true;   }   V is the number of total vertices in the graph, E is the average number of edges per vertex.     O(logV + E)     O(E+V)     O(ElogV)     O(logV)     O(1)     O(V)

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

 struct Neighbors {
   VertexT vertex;
   WeightT weight;
  };
  map<VertexT, vector<Neighbors>> adjList;

 

What is the worst case time complexity for this version of addEdge?

 

  bool addEdge(VertexT from, VertexT to, WeightT weight) {
    if ((adjList.count(from) == 0) && (adjList.count(to) == 0)) {
      return false;
    }

    Neighbors temp;
 temp.vertex = to;
 temp.weight = weight;

 for (auto &e: adjList.at(from)) {
     if (e.vertex == to) {
            e.weight = weight;
            return true;
     }
 }
 adjList[from].push_back(temp);

    return true;
  }

 

V is the number of total vertices in the graph, E is the average number of edges per vertex.

   

O(logV + E)
   

O(E+V)
   

O(ElogV)
   

O(logV)
   

O(1)
   

O(V)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Polynomial time
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS