AQR CAPITAL

Connected component of a directed graph G=(V,E) is a maximal set of vectces C ⊆ V such that for every pair of vertices u and v in C , vertices u and v are reachable from each other.   Given an integer N-number of vertices and an adjacency matrix of size NxN . The adjacency matrix represents the edges of a directed non weighted graph.   Find two connected components that have the maximum number of vertices . Find minimum ...