Solution to Draw a simple, undirected graph yourself, the vertices are connected with each other including 8 … - Sikademy
Author Image

Archangel Macsika

Draw a simple, undirected graph yourself, the vertices are connected with each other including 8 vertices and 14 edges. Find the shortest path from two arbitrary vertices:​ a) The weight of each edge is 1.​ b) Self-weighting for edges

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

Solution:

a) 8 vertices and 14 edges

Shortest path is minimum distance by following minimum weights between the 2 vertices.

Let the two arbitrary vertices are A,F.

Path to AF:



So, the shortest path is A-E-F (because weight = 2, smallest).



b) Self-weighting for edges

Path to AF:



So, the shortest path is A-E-G-F (since weight = 4, smallest).


Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-347-qpid-234