In the talk we focus on the question whether a metric graph is stochastically complete or not. For the special class of so called spherically symmetric metric graphs we give criteria in terms of their combinatorial structure. In the end we will have a look at comparison theorems between metric graphs and discrete graphs.