Home/ Questions/Q 5846959
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-22T12:39:02+00:00

This question has a great answer for detecting cycles in a directed graph. Unfortunately,

  • 0

This question has a great answer for detecting cycles in a directed graph. Unfortunately, it does not seem easy to make a Map Reduce version of it.

Specifically, I am interested in a Map Reduce algorithm for removing cycles from a directed graph.

I have evaluated using a breadth first search (BFS) algorithm but an issue I see is that two different edges may be removed simultaneously to cut off a cycle. The impact of this scenario is that too many edges could be removed. It is important that cycles are removed while minimizing the number of edges removed.

Solutions with proofs available are preferred!

Thanks.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You need an iterative map reduce to implement this algorithm. See http://www.iterativemapreduce.org/ for a map-reduce framework that centers around iterative map reduces. Or http://www.johnandcailin.com/blog/cailin/breadth-first-graph-search-using-iterative-map-reduce-algorithm for a worked example of how to do a breadth-first search through a graph with Hadoop using an iterative map reduce.

    • 0