In a weighted undirected graph, if the length of the shortest pa

In a weighted undirected graph, if the length of the shortest path from `b` to `a` is 12, and there exists an edge of weight 2 between `c` and `b`, then the length of the shortest path from `c` to `a` must be no less than 10. ~@[](3)

答案：TRUE