0 votes 0 votes Which of following gives approximate run time of OSPF routing protocol? ADITYA CHAURASIYA 5 asked Sep 27, 2017 ADITYA CHAURASIYA 5 306 views answer comment Share Follow See 1 comment See all 1 1 comment reply saxena0612 commented Sep 27, 2017 reply Follow Share Is it C? Reason : OSPF is one of the protocol based on Dijkstra or Link state routing algo. So using fibonacci heap Complextiy will be : E+VlogV? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes C) N+MlogM Neeraj Chandrakar answered Oct 15, 2017 Neeraj Chandrakar comment Share Follow See all 0 reply Please log in or register to add a comment.