Home › Courses › GATE CSE › Algorithms › GraphsGATE CSE Graphs — practice questions Explore 1 free Graphs questions in GATE CSE Algorithms. Open each question or exercise to read its content, reference answers and available explanation.
Practise Graphs with Quill → Graphs questions and exercises with answers Showing questions 1–1 of 1.
Worked practice questions Order the steps of Dijkstra's algorithm Read exercise and reference answers Steps Initialise distances: source = 0, all others = ∞ Mark all nodes as unvisited Pick the unvisited node with smallest tentative distance Update distances of its neighbours through that node Mark current node as visited Repeat until all reachable nodes are visited Open this exercise →
How to practise Choose a Graphs question and try to work out your answer. Open the question to check the correct answer and read its worked solution. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account. 
alleryStart learning →