How can I represent a graph in C#?

How can I represent a graph in C#?

You can represent a graph in C# using an adjacency list or an adjacency matrix. Which one would you like to know more about?

What's the difference between an adjacency list and an adjacency matrix?

An adjacency list uses a list of lists to represent edges, which is more space-efficient for sparse graphs. An adjacency matrix uses a 2D array, which is easier for dense graphs but consumes more memory.

Can you show me an example of an adjacency list implementation?

Sure! Here's a simple implementation:

using System;
using System.Collections.Generic;

class Graph {
    private Dictionary<int, List<int>> adjList;

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

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

This creates a graph where you can add edges between vertices.