public string run()
{
var testArray = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
var tree = new FenwickTree <int>(testArray, Operations.BinPlusInt, Operations.BinMinusInt, 0);
DotSerializer.Show(tree);
return(String.Empty);
}
public string run()
{
int[] arr = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
var g = new RangeMaxQueryTree <int>(arr);
DotSerializer.Show(g);
return(string.Empty);
}
public string run()
{
var sb = new StringBuilder();
var tree = new BinaryTree <int>(0,
new BinaryTree <int>(0,
new BinaryTree <int>(0),
new BinaryTree <int>(0)),
new BinaryTree <int>(0))
.ForAll((node) => node.RightIndex());
DotSerializer.Show(tree);
var solver = new LCAThroughRMQTaskSolver <BinaryTree <int> >(tree);
sb.AppendLine(solver.AskIndex(2, 4).ToString());
return(sb.ToString());
}
public string run()
{
var g = new PlainGraph(6);
g.AddEdge(0, 5, 14);
g.AddEdge(0, 2, 9);
g.AddEdge(0, 1, 7);
g.AddEdge(1, 2, 10);
g.AddEdge(2, 5, 2);
g.AddEdge(1, 3, 15);
g.AddEdge(2, 3, 11);
g.AddEdge(3, 4, 6);
g.AddEdge(2, 5, 2);
g.AddEdge(4, 5, 9);
Dijkstra.FindDistances(g, 0);
DotSerializer.Show(g);
return(String.Empty);
}
