算法习题集与解答.pdfVIP

Problem A: Arborescence Counting Description In graph theory, an arborescence is a directed graph in which, for a vertex v called the root and any other vertex u, there is exactly one directed path from v to u. In other words, an arborescence is a directed, rooted tree in which all edges point away from the root. Every arborescence is a directed acyclic graph. -- from Wikipedia, the free encyclopedia You are given a directed graph with N vertices, and your task is to count the number of different arborescences of size N that can be found in the given graph. Two