I have a directed acyclic graph and an origin vertex v in that graph.How can I visit all the vertices that are reachable from v, in such a way that if I visit v1 I already visited all the vertices that have and edge to v1?Example:/-----VA->B->CStarting from A, C must be visited after B.I tried just doing a BFS and checking the parents of each vertex and if they are not visited re-add it for later, but that proved too slow, and I believe can be O(v^2).It might help to know that the graph is somewhat binary, each vertex will be pointed to by at most two vertices. In the other direction, each vertex points to a lot of vertices.

JonathonReinhart No, algorithm questions are perfectly on topic. example1 example2 example3. They can be translated to any language, and directly connect to software problems. The OP has also shown an effort to solve it himself.

**2019年06月26日45分22秒**

amit I feel like there is a lot of overlap between what's considered on-topic at Stack Overflow ("a software algorithm"), Computer Science ("algorithms, models of computation"), and Programmers ("algorithm and data structure concepts"), all quoted from their "on-topic" pages.In my opinion, if you can't tag a question with either a programming language (e.g. C), or environment (e.g. POSIX), then it's better suited for on of the other sites. This question could be answered and proven without writing a single line of code ("programming"). I've retracted my vote on precedent, but I don't agree.

**2019年06月26日45分22秒**

JonathonReinhart There is a tag with 7k questions, language-agnostic, which is considered on-topic. All the questions in my examples are not related to any specific programming language, yet are very related to programming and were really loved by the community, so I really disagree with you on this.

**2019年06月26日45分22秒**

JonathonReinhart The canonical meta post we Programmers users like to link everyone is meta.programmers.stackexchange.com/questions/7182/… Personally, my gut feeling is that this question is on topic for both SO and P.SE.

**2019年06月26日45分22秒**

This question is fine on many Stack Exchange sites, including Stack Overflow. It should not be migrated.

**2019年06月26日45分22秒**

- How to pair socks from a pile efficiently?
- Easy interview question got harder: given numbers 1..100, find the missing number(s) given exactly k are missing
- What is the optimal algorithm for the game 2048?
- Best algorithm for detecting cycles in a directed graph
- What algorithms compute directions from point A to point B on a map?
- How to remove cycles in an unweighted directed graph, such that the number of edges is maximised?
- Random walks in directed graphs/networks
- Ukkonen's suffix tree algorithm in plain English
- Image Processing: Algorithm Improvement for 'Coca-Cola Can' Recognition
- vertex or set of vertices reachable from all other vertices in a directed graph
- Shortest path in Directed Acyclic Graph with small degree
- Can a Directed acyclic graph have zero edges?
- Destroy the graph in minimum number of steps

ADS