 A <unk> ( also called a strongly <unk> graph or a mangrove ) is a directed graph in which there is at most one directed path ( in either direction ) between any two vertices ; <unk> , it is a DAG in which , for every vertex v , the subgraph reachable from v forms a tree . 
