I am trying to perform shortest path on neo4j. However, my edges do have costs, as well as the nodes. I want the shortest path in terms of minimizing (node costs + edge costs).

Is there a way of doing that?

Alternatively, I would have to add node costs to edge costs. Would there then be a way to do this dynamically? Like defining edge costs as edge costs = edge costs + successor node costs.