What is the difference between weighted and unweighted graphs?

What is the difference between weighted and unweighted graphs?

Weighted graphs have edges with values (weights) representing costs or distances, while unweighted graphs treat all edges equally.

Can you give me an example of each?

Sure! In a weighted graph, edges might represent distances between cities, like 5 km or 10 km. In an unweighted graph, edges simply connect nodes without any specific value.

When would I use a weighted graph instead of an unweighted one?

You'd use a weighted graph when the relationships between nodes have different costs or distances, like in routing problems.

Are there algorithms that work differently on weighted vs unweighted graphs?

Yes, algorithms like Dijkstra's work on weighted graphs, while Breadth-First Search (BFS) is typically used for unweighted graphs.