Complexity of Simple Graph Insertion

InsertEdge(edge, graph)

listinsert(edge.x, graph) O(|V|)

listinsert(edge.y, graph) O(|V|)

listinsert(edge.y.name, edge.x.edgelist) O(|V|)

return graph

Complexity: O(V) on each call

How many calls? At most V2

So, O(V3) to build a graph

Previous slide

Next slide

Back to first slide

View graphic version