static void Main(string[] args)
{
//BFS
BreadthFirstAlgorithm b = new BreadthFirstAlgorithm();
Employee root = b.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n------");
b.Traverse(root);
Console.WriteLine("\nSearch in Graph\n------");
Employee e = b.Search(root, "Eva");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Brian");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Soni");
Console.WriteLine(e == null ? "Employee not found" : e.name);
//DFS
DepthFirstAlgorithm d = new DepthFirstAlgorithm();
Employee rootD = d.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n------");
d.Traverse(rootD);
Console.WriteLine("\nSearch in Graph\n------");
Employee emp = d.Search(root, "Eva");
Console.WriteLine(emp == null ? "Employee not found" : emp.name);
emp = d.Search(root, "Brian");
Console.WriteLine(emp == null ? "Employee not found" : emp.name);
emp = d.Search(root, "Soni");
Console.WriteLine(emp == null ? "Employee not found" : emp.name);
}
static void Main_BreadthFirst(string[] args)
{
BreadthFirstAlgorithm b = new BreadthFirstAlgorithm();
Employee root = b.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n------");
b.Traverse(root);
Console.WriteLine("\nSearch in Graph\n------");
Employee e = b.Search(root, "Eva");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Brian");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Soni");
Console.WriteLine(e == null ? "Employee not found" : e.name);
}
static void Main()
{
Console.Title = ("Breadth-First Search Algorithm");
BreadthFirstAlgorithm b = new BreadthFirstAlgorithm();
Employee root = b.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n-----");
b.Traverse(root);
Console.WriteLine("\nSearch in Graph\n-----");
Employee e = b.Search(root, "Denis");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Rafi");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Emma");
Console.WriteLine(e == null ? "Employee not found" : e.name);
Console.ReadKey();
}
static void Main(string[] args)
{
BreadthFirstAlgorithm b = new BreadthFirstAlgorithm();
Employee root = b.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n------------");
Console.WriteLine("\nSearch in Graph\n----------");
Employee e = b.Search(root, "Eva");
Console.WriteLine(e == null ? "Employee not found" : e.Name); //if e is null, return "Employee not found", else return e.Name
e = b.Search(root, "Brian");
Console.WriteLine(e == null ? "Employee not found" : e.Name);
e = b.Search(root, "Soni");
Console.WriteLine(e == null ? "Employee: not found" : e.Name);
}
static void Main(string[] args)
{
#region PRIMER1
/// https://www.csharpstar.com/csharp-breadth-first-search/
Console.WriteLine("------START PRIMER1------");
BreadthFirstAlgorithm b = new BreadthFirstAlgorithm();
Employee root = b.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n------");
b.Traverse(root);
Console.WriteLine("\nSearch in Graph\n------");
Employee e = b.Search(root, "Eva");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Brian");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Soni");
Console.WriteLine(e == null ? "Employee not found" : e.name);
Console.WriteLine("------END PRIMER1------\n");
Console.ReadKey();
#endregion
#region PRIMER2
/// https://www.dotnetlovers.com/article/167/breadth-first-searchbfs-and-graphs
Console.WriteLine("\n------START PRIMER2------");
BreadthFirstSearch demo = new BreadthFirstSearch(5);
demo.AddV(1, 3);
demo.AddV(2, 4);
demo.AddV(2, 1);
demo.AddV(0, 3);
demo.AddV(3, 1);
demo.AddV(4, 0);
demo.AddV(3, 2);
demo.PrintPath(0, 1);
Console.WriteLine("------END PRIMER2------\n");
Console.ReadKey();
#endregion
#region PRIMER3
///https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core
/// Undirected Graph Modeled as Adjacency List
Console.WriteLine("\n------START PRIMER3------");
var vertices = new[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
var edges = new[] { Tuple.Create(1, 2), Tuple.Create(1, 3),
Tuple.Create(2, 4), Tuple.Create(3, 5), Tuple.Create(3, 6),
Tuple.Create(4, 7), Tuple.Create(5, 7), Tuple.Create(5, 8),
Tuple.Create(5, 6), Tuple.Create(8, 9), Tuple.Create(9, 10) };
var graph = new Graph <int>(vertices, edges);
var algorithms = new Algorithms();
#region Prva metoda
Console.WriteLine(string.Join(", ", algorithms.BFS(graph, 1)));
#endregion
#region Druga metoda
var path = new List <int>();
Console.WriteLine(string.Join(", ", algorithms.BFS(graph, 1, v => path.Add(v))));
Console.WriteLine(string.Join(", ", path));
#endregion
#region Treca metoda
var startVertex = 1;
var shortestPath = algorithms.ShortestPathFunction(graph, startVertex);
foreach (var vertex in vertices)
{
Console.WriteLine("shortest path to {0,2}: {1}",
vertex, string.Join(", ", shortestPath(vertex)));
}
#endregion
Console.WriteLine("------END PRIMER3------\n");
Console.ReadKey();
#endregion
}
//DJIKSTRA END
static void Main(string[] args)
{
Console.WriteLine("******************BFS BÖLÜMÜ*************");
BreadthFirstAlgorithm b = new BreadthFirstAlgorithm();
Employee root = b.BuildEmployeeGraph();
Console.WriteLine("Traverse Graph\n------");
b.Traverse(root);
Console.WriteLine("\nSearch in Graph\n------");
Employee e = b.Search(root, "Eva");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Brian");
Console.WriteLine(e == null ? "Employee not found" : e.name);
e = b.Search(root, "Soni");
Console.WriteLine(e == null ? "Employee not found" : e.name);
Console.WriteLine("******************AVL INSERT BÖLÜMÜ*************");
AVL tree = new AVL();
tree.Add(5);
tree.Add(3);
tree.Add(7);
tree.Add(2);
tree.Delete(7);
tree.DisplayTree();
Console.WriteLine("******************DJIKSTRA BÖLÜMÜ*************");
int N = 5;
int SRC = 0;
// int[][] cost = new int[N][N];
int[,] cost =
{
{ INFINITY, 5, 3, INFINITY, 2 },
{ INFINITY, INFINITY, 2, 6, INFINITY },
{ INFINITY, 1, INFINITY, 2, INFINITY },
{ INFINITY, INFINITY, INFINITY, INFINITY, INFINITY },
{ INFINITY, 6, 10, 4, INFINITY }
};
int[] distances = new int[N];
int[] previous = Distance(N, cost, distances, SRC);
for (int i = 0; i < distances.Length; ++i)
{
if (distances[i] != INFINITY)
{
Console.WriteLine(distances[i]);
}
else
{
Console.WriteLine("INFINITY");
}
}
int DEST = 1;
Console.WriteLine("\n Shortest path from " + SRC + " to " + DEST + " (straight):");
printShortestPathStraight(DEST, previous);
Console.WriteLine("\n\n Shortest path from " + SRC + " to " + DEST + " (reverse) :");
printShortestPathReverse(DEST, previous);
Console.ReadLine();
}