algorithms – Finding path with best distance/cost ratio from a node in a graph

We have a weighted graph, where each node is a city. And the edges between the nodes are a pair of floating-point values (distance and cost of travel).

Given a node/city, describe an algorithm that can find the path with the largest distance/cost ratio from said node/city. Note that the path can traverse multiple nodes.

I need help with this (for both directed and undirected graphs). I stumbled across this question in a lecture note from my university (I graduated but am self-studying), and have no idea how to solve this.

There is no limitation on how to store the graphs, though I only know of adjacency matrix and adjacency list.