How do I implement a weighted graph in C#?

How do I implement a weighted graph in C#?

To implement a weighted graph in C#, you can use an adjacency list or an adjacency matrix. Which one would you prefer?

I think an adjacency list would be better. Can you show me an example?

Sure! Here's a simple example using a dictionary to represent the adjacency list:

using System;
using System.Collections.Generic;

class WeightedGraph
{
    private Dictionary<int, List<(int vertex, int weight)>> adjList;

    public WeightedGraph()
    {
        adjList = new Dictionary<int, List<(int, int)>>();
    }

    public void AddEdge(int source, int destination, int weight)
    {
        if (!adjList.ContainsKey(source))
            adjList[source] = new List<(int, int)>();
        adjList[source].Add((destination, weight));
    }
}

This code defines a WeightedGraph class with a method to add edges.

That looks good! How do I display the graph?

You can create a method to display the graph by iterating through the adjacency list. Here's an example:

public void DisplayGraph()
{
    foreach (var vertex in adjList)
    {
        Console.Write(vertex.Key + " -> ");
        foreach (var edge in vertex.Value)
        {
            Console.Write(edge.vertex + " (" + edge.weight + ") ");
        }
        Console.WriteLine();
    }
}