Can anyone tell me that if there exist an algorithm to convert a completely connected directed graph into Directed Acyclic Graph (DAG) such that wieghts of resulting DAG will be minimum (Or Maximum) and each vertex has exacly (Or Maximum or Minimum) k edges (Either Inward or Outward)?