Dijkstra$$s algorithm computes the distances of all the vertices from a given start vertex s$,$ for a weighted graph G $($with non$-$negative edge weights$)$ when $\_\_\_\_\_\_\_\_\_.$ Select all that apply.

$1$ point

G is directed

G is undirected

G is undirected or directed

G is neither directed nor undirected