Source location in undirected and directed hypergraphs

We generalize source location problems with edge-connectivity requirements on undirected and directed graphs to similar problems on hypergraphs. In the undirected case we consider an abstract problem which can be solved in polynomial time. For the directed case, the asymmetry of the results reflects the asymmetry of the model considered.