You can tell if a graph is weighted if the edges have a third value(weight). An edge consists of 2 vertices and sometimes weight. You can think of this weight as the distance needed to go from one node to another. If an edge only consists of 2 vertices and no third value or all third values are 0 , then you are working with an unweighted graph. I hope this makes sense. An example of an edge with weight E = {v0,v2, 4) (in this case 4 would be the weight. An example of an edge with no weight E = {vo, v1}.
thank you! You're my life saver!
Very great simple explanation, thanks a lot
is their any name for this algorithm and where can i find algorithm to it
hey..! how can we know if the graph is weighted or unweighted??? explain please..! i also search on google but cant understand...!
You can tell if a graph is weighted if the edges have a third value(weight). An edge consists of 2 vertices and sometimes weight. You can think of this weight as the distance needed to go from one node to another. If an edge only consists of 2 vertices and no third value or all third values are 0 , then you are working with an unweighted graph. I hope this makes sense. An example of an edge with weight E = {v0,v2, 4) (in this case 4 would be the weight. An example of an edge with no weight E = {vo, v1}.
@@delatorrejonathan99 yeah now i got it , thank you
thanks ! Great help !
I've been searching for a tutorial on BFS without an Indian accent (no offense) for an hour now.
useless