Given an undirected graph $G = (V,E)$, the first Betti number of G is $|E| - |V| + k$, where $k$ is the number of connected components of $G$.
I was thinking what is the case for a directed graph $G$. Is it analogous, and the Betti number equals to the minimal number of feedback arc set ( )?
