Consider the directed graph in which nodes are questions on Mathematics SE and (directed) edges are links from one question to another question.
What questions have the highest in-degree? Can one find that out? If so, how?
Possible duplicate:
Consider the directed graph in which nodes are questions on Mathematics SE and (directed) edges are links from one question to another question.
What questions have the highest in-degree? Can one find that out? If so, how?
Possible duplicate: