How can I implement graphs in C#?

How can I implement graphs in C#?

You can implement graphs in C# using various data structures like adjacency lists or matrices. Would you like an example?

Yes, please provide an example using an adjacency list.

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);
    }

    public void PrintGraph() {
        foreach (var vertex in adjList.Keys) {
            Console.Write(vertex + " -> ");
            foreach (var edge in adjList[vertex]) {
                Console.Write(edge + " ");
            }
            Console.WriteLine();
        }
    }
}

This code creates a graph using a dictionary to store adjacency lists.

How do I use this Graph class to create a graph?

You can create a graph by instantiating the Graph class and adding edges like this:

Graph g = new Graph();
g.AddEdge(0, 1);
g.AddEdge(0, 2);
g.AddEdge(1, 2);
g.AddEdge(2, 0);
g.AddEdge(2, 3);
g.PrintGraph();

This will create a graph and print its adjacency list.

What if I want to implement a weighted graph?

For a weighted graph, you can modify the adjacency list to store pairs of vertices and weights. Would you like to see an example?