campus placement AMCAT Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search

An undirected graph with n vertices and e edges are represented by adjacency matrix. The time required to determine the degree of any vertex is

1
O(e)
2
O(n)
3
O(n2)
4
O(e+n)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters