MaiDeveloper

Dijkstra's Shortest Path Algorithm

Dijkstra's Shortest Path Algorithm

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants.
Autocomplete / Suggestion / Typeahead Search using Trie Data Structure and Algorithm

Autocomplete / Suggestion / Typeahead Search using Trie Data Structure and Algorithm

Autocomplete or suggestion or typeahead offers a number of possible values while typing. I am going to solve this problem using trie data structure and algorithm.