public void BreadthFirstSearch(int startNode)
{
bool[] visitedNodes = new bool[V];
Queue <int> q = new Queue <int>();
// Consider first node as starting point of search.
q.Enqueue(startNode);
while (q.Count != 0)
{
int frontNode = q.Dequeue();
if (visitedNodes[frontNode] == false)
{
Console.WriteLine(frontNode);
visitedNodes[frontNode] = true;
if (arr[frontNode] != null)
{
AdjListNode current = arr[frontNode].Head;
while (current != null)
{
q.Enqueue(current.Destination);
current = current.Next;
}
}
}
}
}
public void PrintGraph()
{
for (int i = 0; i < arr.Length; i++)
{
AdjListNode current = arr[i].Head;
Console.WriteLine(i);
while (current != null)
{
Console.WriteLine(" " + current.Destination);
current = current.Next;
}
}
}
private void DFSUtil(int v, ref bool[] visited)
{
visited[v] = true;
Console.WriteLine(v);
AdjListNode current = arr[v].Head;
while (current != null)
{
if (visited[current.Destination] == false)
{
DFSUtil(current.Destination, ref visited);
}
current = current.Next;
}
}
public void AddEdge(int source, int dest)
{
AdjListNode node = new AdjListNode {
Destination = dest
};
if (arr[source] == null)
{
arr[source] = new AdjList {
Head = node
};
}
else
{
node.Next = arr[source].Head;
arr[source].Head = node;
}
//undirected graph so add edge from destination to source also
AdjListNode newNode = new AdjListNode {
Destination = source
};
if (arr[dest] == null)
{
arr[dest] = new AdjList {
Head = newNode
};
}
else
{
newNode.Next = arr[dest].Head;
arr[dest].Head = newNode;
}
}
public AdjListNode(int vex)
{
AdjVex = vex;
Next = null;
}
public VexNode(GraphNode <T> data, AdjListNode <T> first_adj)
{
Data = data;
FirstAdj = first_adj;
}