GitHub - sinasoltani123/Refined-D-ary-minheap-for-Dijkstra-s-algorithm-in-a-weighted-directed-graph: Refined D-ary minheap in which the children of each node are stored in a built in binary heap so that finding the minimum a node's children is faster. The binary min heap uses the array of D-ary minheap and its within it and does not use separate array. .Implemented for Dijkstra's algorithm for shortest paths in a weighted directed graph.

sinasoltani123 / Refined-D-ary-minheap-for-Dijkstra-s-algorithm-in-a-weighted-directed-graph Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Refined D-ary minheap in which the children of each node are stored in a built in binary heap so that finding the minimum a node's children is faster. The binary min heap uses the array of D-ary minheap and its within it and does not use separate array. .Implemented for Dijkstra's algorithm for shortest paths in a weighted directed graph.