Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with topological-ordering
Search options answers only
not deleted
user 4249
1
vote
Accepted
Valid orderings for topological sort
A source is a vertex with in-degree zero.
An order of the vertices is a topological order if deleting the vertices in that order deletes only sources.
Hence, you can verify that an order is topologica …
- 17.1k
2
votes
Accepted
Checking if there exists a 'source' vertex
Hint: if you find all the strongly connected components in the graph, the quotient graph of the SCCs is a DAG. In this DAG, if there is a meta-node that can reach all the other meta-nodes, you have y …
- 17.1k
3
votes
How to edge-color a directed acyclic graph so that every path visits none or all edges of ea...
It sounds to me like the greedy algorithm should work, I'm not able to come up with any counter-examples, however, I haven't had time to try to prove the claim either.
Terminology
Definition. Let $s …
- 17.1k