-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDirectedDFS.cs
More file actions
47 lines (40 loc) · 1.06 KB
/
DirectedDFS.cs
File metadata and controls
47 lines (40 loc) · 1.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
using System.Collections.Generic;
namespace DirectionalGraphs
{
//determines reachability of a vertex from the source vertex
class DirectedDFS
{
//tracks what V's have been visited
bool[] _marked;
//inits the DS and calls the main processing method to start
public DirectedDFS(DiGraph G, int s)
{
_marked = new bool[G.V];
dfs(G, s);
}
public DirectedDFS(DiGraph G, IEnumerable<int> sources)
{
_marked = new bool[G.V];
foreach(var s in sources)
{
if (!_marked[s])
{
dfs(G, s);
}
}
}
//internal recursive processing method
private void dfs(DiGraph G, int v)
{
_marked[v] = true;
foreach(var w in G.Adj(v))
{
if (!_marked[w])
{
dfs(G, w);
}
}
}
public bool Marked(int v) => _marked[v];
}
}