In the case of undirected, connected graphs the name for the maximal cycle-free subgraph of minimal weight is called Minimum Spanning Tree, and the efficient algorithms for their calculation are well known.

Questions:

- is there a name for maximally directed-cycle-free subgraphs of minimal arc-weight sum?
- which algorithms are used for their calculation and what is the complexity of their calculation?

$$ $$ In view of the replies of Brendan and Tony, I see the need for clarification and a slight modification of my question:

One of the properties of MSTs is, due to the matroid-property, that for every pair of vertices $(p,q)\in V\times V\ \ \wedge\ \ e_{qp}\in E\ \ $ it is true, that for every path between p and q in the MST, we have

$$\max_{i\in\{p,pred(q)\}}w(e_{i,succ(i)})\ \le\ w(e_{qp})$$
this is so because the greedy strategy of always adding the shortest edge, that doesn't complete a cycle, yields the global minimum of edge-weight sums.

However, as has been pointed out by Brendan, DAGs are not necessarily matroids; I would therefore give up the requirement of minimal arc-weight sum and restrict my question to DAGs that are the outcome of the same greedy strategy as in the construction of MSTs, i.e. always add the shortest arc that doesn't complete a directed cycle.

The outcome should be DAGs for which the same inequality between the weights of path-arcs and the exterior arc augmenting it to a directed cycle should hold.

**New Questions**
Besides the question for the name of such DAGs, the algorithmic questions would boil down to efficiently detecting the completion of a directed cycle and, whether the naiv application of the MST-construction algorithms (Prim, Kruskal, Boruvka) would yield the same DAG.