That is called a weighted graph
(where each edge has a "cost"). The "cost" in your case would be the total time to travel from one node to the next (which can be calculated with the inputs you specified, speed and distance).
You mentioned one possible solution already: Dijkstra's algorithm
, which works for weighted graphs.
Now, if A-B is different than B-A, that'd be more interesting (it appears, however, that the "roads" you are describing are the same speed in both directions).