Length and Shortest path of a graph

Описание к видео Length and Shortest path of a graph

Length of the path between any two vertices of a graph is simply the no. of edges included in the path.

If more than one path is present between any 2 vertices, then the path with the minimum no. of edges is the shortest path.

Комментарии

Информация по комментариям в разработке

Похожие видео