public Graph Prim(FromVertex from)
{
Graph graph = from.graph;
AdjacencyList <string> adjacencyList = graph;
return(TreeAlgorithms <string> .Prim(adjacencyList, from.orig));
}
public Graph Kruskal(FromVertex from)
{
Graph graph = from.graph;
AdjacencyList <char> adjacencyList = graph;
return(TreeAlgorithms <char> .Kruskal(adjacencyList));
}
public Graph DFS(FromVertex from)
{
Graph graph = from.graph;
AdjacencyList <string> adjacencyList = graph;
adjacencyList.DFS();
return(adjacencyList);
}
public Graph BFS(FromVertex from)
{
Graph graph = from.graph;
string s = from.orig;
AdjacencyList <string> adjacencyList = graph;
adjacencyList.BFS(s);
return(adjacencyList);
}
public Graph BellmanFord(FromVertex from)
{
Graph graph = from.graph;
AdjacencyList <string> adjacencyList = graph;
TreeAlgorithms <string> .BellmanFord(adjacencyList, from.orig, out GraphLib.Model.Graph <string> q);
AdjacencyMatrix <string> output = (AdjacencyMatrix <string>)q;
return(output);
}
