I've found that luck is quite predictable. If you want more luck, take more chances. Be more active. Show up more often.
Let's start this topic with an example, we have some tasks to do, some tasks are independent of each other, but some tasks depend on other tasks and those tasks must be done before these tasks. We can model this problem with a graph, the tasks are vertices and the dependencies are edges. Topological sorting is an algorithm that helps us to find an ordering of tasks such that for every task $u$ that has to be done before task $v$, $u$ comes before $v$ in the ordering.
Topological sorting works on DAGs, that is, graphs wit no cycles, if the graph contains a cycle it's impossible to find a solutions. For example, if task $A$ depends on task $B$ and task $B$ depends on task $A$ then it's impossible to determine which task has to be done first, see Chicken or Egg.
Example problem
Here you have a problem where you have to literally find an ordering for tasks: 10305 - Ordering Tasks. Here is a working implementation of Topological sorting.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
class Graph {
private:
vector<vector<int> > G;
public:
Graph() {}
Graph(int nodes) {
G.resize(nodes);
}
void addEdge(int u, int v) {
G[u].push_back(v);
}
void dfs(int u, vector<bool> &visited) {
visited[u] = true;
for (int v : G[u]) {
if (!visited[v]) {
dfs(v, visited);
}
}
printf("%d ", u + 1);
}
void sort() {
vector<bool> visited(G.size(), false);
for (int u = 0; u < int(G.size()); u++) {
if (!visited[u]) {
dfs(u, visited);
}
}
}
};
int main() {
int n, m;
scanf("%d %d", &n, &m);
while (n != 0 || m != 0) {
Graph graph(n);
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d %d", &u, &v);
graph.addEdge(v - 1, u - 1);
}
graph.sort();
scanf("%d %d", &n, &m);
}
return 0;
}
The solutions works as follows:
- If task $u$ has to be done before task $v$ create a directed edge from $v$ to $u$.
- Create a table $visited[]$ such that $visited[u]$ is true if node $u$ has been visited.
- Run a Depth-First Search on all nodes that has not been visited yet and print the nodes in reverse order, we can do that by printing node $u$ before leaving the recursive function.
The resulting sequence of nodes is a valid ordering. Notice that it's possible to have multiple valid solutions.
The previous problem is easy because is the classical example to explain Topological sorting. However, most of the time these problems are not so obvious and we have to work a bit to uncover the underlying problem, for example 1034 - Hit the Light Switches (hint, think a bout connected components).
References
[1] | ROBERT SEDGEWICK AND KEVIN WAYNE, Algorithms, 4th Edition, http://algs4.cs.princeton.edu/home/ |