What are some common graph algorithms implemented in C#?

What are some common graph algorithms implemented in C#?

Some common graph algorithms in C# include Dijkstra's algorithm, A* search, and Depth-First Search (DFS). Would you like details on any specific one?

Can you explain Dijkstra's algorithm?

Dijkstra's algorithm finds the shortest path from a starting node to all other nodes in a weighted graph. It uses a priority queue to explore the nearest unvisited node.

How do I implement Dijkstra's algorithm in C#?

You can implement Dijkstra's algorithm using a priority queue. Start by initializing distances, then repeatedly extract the minimum distance node and update its neighbors.

Can you provide a sample code for that?

Sure! Here's a simple implementation:

using System;
using System.Collections.Generic;

class Graph {
    private int V;
    private List<Tuple<int, int>>[] adj;

    public Graph(int v) {
        V = v;
        adj = new List<Tuple<int, int>>[v];
        for (int i = 0; i < v; i++)
            adj[i] = new List<Tuple<int, int>>();
    }

    public void AddEdge(int u, int v, int w) {
        adj[u].Add(Tuple.Create(v, w));
        adj[v].Add(Tuple.Create(u, w)); // For undirected graph
    }

    public void Dijkstra(int src) {
        int[] dist = new int[V];
        bool[] sptSet = new bool[V];

        for (int i = 0; i < V; i++) {
            dist[i] = int.MaxValue;
            sptSet[i] = false;
        }

        dist[src] = 0;

        for (int count = 0; count < V - 1; count++) {
            int u = MinDistance(dist, sptSet);
            sptSet[u] = true;

            foreach (var neighbor in adj[u]) {
                int v = neighbor.Item1;
                int weight = neighbor.Item2;
                if (!sptSet[v] && dist[u] != int.MaxValue && dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                }
            }
        }

        PrintSolution(dist);
    }

    private int MinDistance(int[] dist, bool[] sptSet) {
        int min = int.MaxValue, minIndex = -1;
        for (int v = 0; v < V; v++) {
            if (!sptSet[v] && dist[v] <= min) {
                min = dist[v];
                minIndex = v;
            }
        }
        return minIndex;
    }

    private void PrintSolution(int[] dist) {
        Console.WriteLine("Vertex Distance from Source");
        for (int i = 0; i < V; i++)
            Console.WriteLine(i + "		" + dist[i]);
    }
}

This code defines a graph and implements Dijkstra's algorithm to find the shortest paths.