//2nd score. Locate near rewardest and try reach others
static public void RunProgram1(String fileName)
{
Parser parser = new Parser();
Map map = parser.GetParsedMap(fileName + ".txt");
RouteFinder finder = new RouteFinder();
var r = finder.FindRoutesAprox(map);
Output.OutputFile(r, fileName + "_answer.txt");
}
static public void Test(String fileName)
{
Parser parser = new Parser();
Map map = parser.GetParsedMap(fileName + ".txt");
RouteFinder finder = new RouteFinder();
var coos = finder.FindCoordinates(map);
foreach (var coo in coos)
{
Console.WriteLine("{0} {1}", coo.X, coo.Y);
}
/*
* var rr = finder.FindCustomerRoutes(map);
* var jr = finder.GetJoinRoutes(rr);
*
* foreach (var j in jr)
* {
* Console.WriteLine(j.Count);
* }
*
* /*
* var tree = finder.GetOptimalTree(rr);
* var split_tree = finder.SplitTree(tree, 3);
*
* foreach (var r in rr)
* {
* foreach (var p in r.Paths)
* {
* Console.WriteLine("{0} {1} {2} {3}", r.Office.X, r.Office.Y, p.GetDirection(),p.Cost);
* }
* }
*
* foreach (var t in tree)
* {
* Console.WriteLine("A:{0} {1} B:{2} {3} Cost:{4}", t.A.X, t.A.Y, t.B.X, t.B.Y, t.Cost);
* }
* Console.WriteLine("************");
* foreach (var st in split_tree)
* {
* Console.WriteLine("-------------");
* foreach (var t in st)
* {
* Console.WriteLine("A:{0} {1} B:{2} {3} Cost:{4}", t.A.X, t.A.Y, t.B.X, t.B.Y, t.Cost);
* }
* }*/
}
//Optimal tree plus group of branches
static public void RunProgram(String fileName)
{
Parser parser = new Parser();
Map map = parser.GetParsedMap(fileName + ".txt");
RouteFinder finder = new RouteFinder();
var routes = finder.GetOptimalRoutes(map);
int total = 0;
foreach (var route in routes)
{
total += route.Reward;
}
Console.WriteLine(total);
Output.OutputFile(routes, fileName + "_answer.txt");
}
