[Feature]: Support for faster shortest path search on graphs on non-negative attributes of nodes

[thuongle2210]

What do you want?

I want a feature supporting shortest path search based on non-negative attributes of nodes.

Feature Area

Graph Operations

Additional context

In real-world cases like transaction amounts, risk scores, or path distances, where weights are non-negative, Dijkstra's algorithm is the ideal choice for finding shortest paths efficiently

[thuongle2210]

I will help you to implement this operation.

[xav-db]

hey man, thanks for this, I will implement dijkstras for edge properties. I will make it configurable as to what algorithm is used.