Strongly Connected Digraph

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they point. The nodes in a strongly connected digraph therefore must all have indegree of at least 1. The numbers of nonisomorphic simple strongly connected digraphs on , 2, ... nodes are 1, 1, 5, 83, 5048, 1047008, ... (OEIS A035512).

A directed graph can be tested to see if it is strongly connected using ConnectedGraphQ[g].

Wolfram Web Resources

Mathematica » The #1 tool for creating Demonstrations and anything technical.	Wolfram\|Alpha » Explore anything with the first computational knowledge engine.	Wolfram Demonstrations Project » Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.
Computerbasedmath.org » Join the initiative for modernizing math education.	Online Integral Calculator » Solve integrals with Wolfram\|Alpha.	Step-by-step Solutions » Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.
Wolfram Problem Generator » Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.	Wolfram Education Portal » Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.	Wolfram Language » Knowledge-based programming for everyone.