@UselessMachine
Programming
Nothing here yet.
Nothing here yet.
Jan 15, 2023 · 1 min read · For this problem, we have to follow the same Dijkstra's Algorithm for the shortest path but this time we also need to memorize the path from where we are coming. So we need a Parent array also along with a Distance array and Min heap. Data Structures...
Join discussionJan 15, 2023 · 1 min read · This algorithm is used to get the shortest path from the source node to all other nodes. Data structures Required: Min Heap(Priority Queue, Set, etc), Arrays. Algorithm: Initialize the distance array with infinity so that later we can update them w...
Join discussionJan 15, 2023 · 1 min read · The algorithm states : Traverse the linked list with two pointers. Move one pointer(slow) to one node forward and the second pointer(fast) to two nodes forward. If these two pointers meet at the same node then there is a loop otherwise the linked ...
Join discussion