Math, asked by ffayyaz, 1 year ago

Define shortest path between two vertices

Answers

Answered by nishant175

In graph theory, the shortest path problem of finding a path between two vertices or nodes in a graph such that the sum of the weights of its constituent edges is minimised.

ffayyaz: Define frictious

ffayyaz: Define fictitious

Previous Question

Next Question

Similar questions

Physics, 9 months ago

the radius of curvature of convex mirror used on automobile is 2.0 m. a truck is coming behind it at constant distance of 3.5 metre calculate ( 1) the positions and nature of image...

Geography, 9 months ago

which rainfall occurs daily in Equatorial region...

Math, 9 months ago

If (65 x (10) x (15) = 24 x 3 x 5', then find the value of x + y + 2. (a) 26 (d) 48 (b) 52 (e) 45 (c)42...

English, 1 year ago

what is the relevance of prayer according to jainulabdeen...

English, 1 year ago

I would not eat that food unless I was really hungry. change into if .

Social Sciences, 1 year ago

Give reasons which have attributed to the success of federalism...

English, 1 year ago

their/looking for/soar/they/overhead/prey. reorder...

Math, 1 year ago

Solve: ¡) (9√24 )×(14√45) ¡¡) (42√60)²...