//public static void Main(string[] args)
//{
// string s;
// var inputs = new List<string>();
// while ((s = Console.ReadLine()) != null)
// inputs.Add(s);
// foreach (var result in Answer(inputs.ToArray()))
// Console.WriteLine(result);
//}
public static IList <string> Answer(IList <string> inputs)
{
var graph = Inputs.AdjacencyListGraphLong(inputs).ToUndirectedAdjacencyGraph();
//Console.WriteLine(graph.ToPrettyString());
var dsf = new DepthFirstSearchWithComponents(graph);
dsf.Search();
//Console.WriteLine(dsf.ToPrettyString());
return(new[] { dsf.MaxComponent.ToString() });
}
//public static void Main(string[] args)
//{
// string s;
// var inputs = new List<string>();
// while ((s = Console.ReadLine()) != null)
// inputs.Add(s);
// foreach (var result in Answer(inputs.ToArray()))
// Console.WriteLine(result);
//}
public static IList <string> Answer(IList <string> inputs)
{
var graphInputs = Inputs.AdjacencyListGraphLong(inputs);
var graph = graphInputs.ToUndirectedAdjacencyGraph();
//Console.WriteLine(graph.ToPrettyString());
var points = graphInputs.NextAsEdge();
var dsf = new DepthFirstSearchWithComponents(graph);
dsf.Explore(points.Left);
//Console.WriteLine(dsf.ToPrettyString());
var hasPath = dsf.Visited(points.Right) ? "1" : "0";
return(new[] { hasPath });
}
public static IEnumerable <int> StronglyConnectedComponents(AdjacencyListGraph <long> graph, AdjacencyListGraph <long> reverse)
{
//run dfs of reverse graph
var srg = new TopologicalSort(reverse);
srg.Search();
//look for v in graph in reverse post order
var sg = new DepthFirstSearchWithComponents(graph);
var order = srg.Order;
foreach (var v in order)
{
//if not visited => explore and mark visted vertices as new component
sg.Explore(v);
}
return(sg.Components);
}
