This pull request contains a rewrite of the articleStrongly Connected Components and Condensation Graph.

What changed:

• The article now has twotikzpictures (emdedded assvg images) to give a visual representation of strongly connected components and the condensation graph. The LaTeX source is included.
• Improved English grammar and general text flow throughout the article.
• Changed the font from e.g.$order$ toorder where appropriate. Similarly, changed$tout[v]$ and$tin[v]$ to$t_\text{out}[v]$ and$t_\text{in}[v]$.
• Merged the twoImplementation code blocks into one block. (The second block contained code that should have been in themain function in the first block. Therefore I thought it is cleaner to just put it in a single block.)
• Added comments to the code.
• Fixed some other small things:
  • The article mentioned the graphs$g$ and$gr$ even though these were never used.
  • The article did not give a clear definition of$t_\text{out}[v]$ and$t_\text{in}[v]$.
  • The article said that sorting all vertices in$G$ by exit time is equivalent to topologically sorting the vertices of$G$. (This is wrong, because$G$ is not necessarily a DAG.)

For the addedtikzpictures, the source code andsvg files themselves are in a new directorysrc/graph/strongly-connected-components-tikzpicture.

Let me know what you think!