added dfs in csharp

Author: shiningflash

CSHARP/Program.cs

@@ -7,6 +7,7 @@ public static void Main(string[] args) {
         // BFS bfs = new BFS();
         // bfs.manageBFS(lines);
 
-        
+        DFS dfs = new DFS();
+        dfs.manageDFS(lines);
     }
 }

CSHARP/dfs.cs

@@ -0,0 +1,61 @@
+using System;
+using System.Collections.Generic;
+
+public class DFS {
+    
+    public int nodes, edges;
+    public bool[] vis;
+    public List <int>[] graph;
+
+    public DFS() {
+
+    }
+
+    public void initDFS(int nodes, int edges) {
+        this.nodes = nodes;
+        this.edges = edges;
+
+        graph = new List<int>[nodes];
+        for (int i = 0; i < nodes; i++) {
+            vis = new bool[nodes];
+            graph[i] = new List<int>();
+        }
+    }
+
+    public void dfs(int u) {
+        Console.Write("{0} ", u);
+        vis[u] = true;
+
+        for (int i = 0; i < graph[u].Count; i++) {
+            int v = graph[u][i];
+            if (vis[v] == false) {
+                dfs(v);
+            }
+        }
+    }
+
+    public void manageDFS(string[] lines) {
+
+        string[] line1 = lines[0].Split(' ');
+        int nodes = int.Parse(line1[0]);
+        int edges = int.Parse(line1[1]);
+
+        initDFS(nodes, edges);
+
+        for (int i = 1; i <= edges; i++) {
+            string[] all_edge = lines[i].Split(' ');
+            int u = int.Parse(all_edge[0]);
+            int v = int.Parse(all_edge[1]);
+            graph[u].Add(v);
+            graph[v].Add(u);
+        }
+
+        for (int i = 0; i < nodes; i++) {
+            if (vis[i] == false) {
+                dfs(i);
+            }
+        } 
+
+        Console.WriteLine();
+    }
+}

CSHARP/in.txt

@@ -1,11 +1,6 @@
-8 10
+6 5
 0 1
-0 2
-0 3
-0 4
-1 5
-2 5
-3 6
-4 6
-5 7
-6 7
+1 2
+2 4
+3 4
+1 5

DFS.cpp

@@ -45,7 +45,7 @@ int main() {
     return 0;
 }
 
-/******************
+/*
  INPUT
   ---
   - 1st line, 6 Vertex, 5 Edge
@@ -54,8 +54,9 @@ int main() {
 1 2
 2 4
 3 4
+1 5
 
  OUTPUT:
   -----
 0 1 5 2 4 3
-*****************/
+*/