## Luhn Algorithm

0 likes • Nov 18, 2022 • 11 views
C#

## More C# Posts

#### Untitled

0 likes • Aug 5, 2023 • 5 views
C#
`public class King {    fewf}`

#### Untitled

0 likes • Aug 21, 2023 • 10 views
C#
```using System;
class Yeet{    public int value = 1;    public override string ToString (){        return value.ToString();    }}
class Bruh{    public Yeet skeet;    public override string ToString (){        return skeet.ToString();    }}
class HelloWorld {  static void Main() {      Yeet yeet = new Yeet();      Bruh bruh = new Bruh{ skeet = yeet };      ++(yeet.value);      Console.WriteLine(yeet);      Console.WriteLine(bruh);  }}```

`// C# program to print BFS traversal// from a given source vertex.// BFS(int s) traverses vertices// reachable from s.using System;using System.Collections.Generic;using System.Linq;using System.Text; // This class represents a directed// graph using adjacency list// representationclass Graph{     // No. of vertices    private int _V; //Adjacency ListsLinkedList<int>[] _adj; public Graph(int V){    _adj = new LinkedList<int>[V];    for(int i = 0; i < _adj.Length; i++)    {        _adj[i] = new LinkedList<int>();    }    _V = V;} // Function to add an edge into the graphpublic void AddEdge(int v, int w){            _adj[v].AddLast(w); } // Prints BFS traversal from a given source spublic void BFS(int s){         // Mark all the vertices as not    // visited(By default set as false)    bool[] visited = new bool[_V];    for(int i = 0; i < _V; i++)        visited[i] = false;         // Create a queue for BFS    LinkedList<int> queue = new LinkedList<int>();         // Mark the current node as    // visited and enqueue it    visited[s] = true;    queue.AddLast(s);             while(queue.Any())    {                 // Dequeue a vertex from queue        // and print it        s = queue.First();        Console.Write(s + " " );        queue.RemoveFirst();                 // Get all adjacent vertices of the        // dequeued vertex s. If a adjacent        // has not been visited, then mark it        // visited and enqueue it        LinkedList<int> list = _adj[s];         foreach (var val in list)                    {            if (!visited[val])            {                visited[val] = true;                queue.AddLast(val);            }        }    }}`