Create Dijkstra_(nlogn).gsql

tigergraph / gsql-graph-algorithms

GSQL Graph Algorithms

https://docs.tigergraph.com/graph-ml/current/intro/

Apache License 2.0

192 stars 70 forks source link

Create Dijkstra_(nlogn).gsql #46

Closed Gaurav33v closed 3 years ago

Gaurav33v commented 3 years ago

Dijkstra Code added . Speed better than Bellman Ford Algorithm. The Bellman Ford Algorithm has a complexity of (n*n) but if there are no negative edges present then the dijkstra algorithm can be used with complexity of (nlogn). It will enhance the speed to a great extent.

xchang1986 commented 3 years ago

Dear Gaurav,

We truly appreciate your pull request and willingness to contribute to TigerGraph algorithm library.

After reviewing your code. We realize that we have released new versions of this algorithms so that we will get this PR closed.

In near future we will publish more formal release process to the community along with best practices guidelines. After that I encourage you to contribute more to the library.

Thanks.