Dijkstra's algorithm in gremlin

Question

I want to get minimum cost route in gremlin. now I use this below.

Shortest path taking into consideration the weight on tinkergraph in Java

g.V(start)