We address the problem of throughput-optimal packet dissemination in wireless networks with an arbitrary mix of unicast, broadcast, multicast and anycast traffic.  We will describe a new online dynamic policy, called Universal Max-Weight (UMW), which solves the above network flow problems simultaneously and efficiently. To the best of our knowledge, UMW is the first throughput-optimal algorithm for solving the generalized network-flow problem. When specialized to the unicast setting, the UMW policy yields a throughput-optimal, loop-free, routing and link-scheduling policy. Extensive simulation results show that the proposed UMW policy incurs substantially smaller delays as compared to backpressure.