0 votes 0 votes Time taken in adding/removing an edge to/from adjacent list ? Algorithms algorithms graph-algorithms + – vaishali jhalani asked Nov 5, 2016 vaishali jhalani 444 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments vaishali jhalani commented Nov 5, 2016 reply Follow Share Is somewhere time is related to degree of a particular vertex ? 0 votes 0 votes Prashant. commented Nov 5, 2016 reply Follow Share yes saurabh if u add in starting then yes take constant time. 0 votes 0 votes santhoshdevulapally commented Nov 6, 2016 reply Follow Share we can insert new node at start node or last node. if we insert at first node only one pointer variable is changed so time complexity is o(1),but at last we can traverse the linked list so time complexity is o(n). in case of deletion we exactly dont know where the required node present so time complexity is o(n) 0 votes 0 votes Please log in or register to add a comment.