Null graph (not connected)
Mode: OUT
( )
( )
No. of components: 0
{
}
( )
Mode: ALL
( )
( )
No. of components: 0
{
}
( )

Singleton graph (connected)
Mode: OUT
( 0 )
( 1 )
No. of components: 1
{
  0: ( 1 )
}
( 1 )
Mode: ALL
( 0 )
( 1 )
No. of components: 1
{
  0: ( 1 )
}
( 1 )

Kautz graph (connected)
Mode: OUT
( 0 0 0 0 0 0 0 0 0 0 0 0 )
( 12 )
No. of components: 1
{
  0: ( 1 1 1 1 1 1 1 1 1 1 1 1 )
}
( 12 12 12 12 12 12 12 12 12 12 12 12 )
Mode: ALL
( 0 0 0 0 0 0 0 0 0 0 0 0 )
( 12 )
No. of components: 1
{
  0: ( 1 1 1 1 1 1 1 1 1 1 1 1 )
}
( 12 12 12 12 12 12 12 12 12 12 12 12 )

Directed 2-path
Mode: OUT
( 0 1 )
( 1 1 )
No. of components: 2
{
  0: ( 1 1 )
  1: ( 1 0 )
}
( 2 1 )
Mode: ALL
( 0 0 )
( 2 )
No. of components: 1
{
  0: ( 1 1 )
}
( 2 2 )

Two disjoint 3-cycles
Mode: OUT
( 1 1 1 0 0 0 )
( 3 3 )
No. of components: 2
{
  0: ( 1 1 1 0 0 0 )
  1: ( 0 0 0 1 1 1 )
}
( 3 3 3 3 3 3 )
Mode: IN
( 1 1 1 0 0 0 )
( 3 3 )
No. of components: 2
{
  0: ( 1 1 1 0 0 0 )
  1: ( 0 0 0 1 1 1 )
}
( 3 3 3 3 3 3 )
Mode: ALL
( 0 0 0 1 1 1 )
( 3 3 )
No. of components: 2
{
  0: ( 0 0 0 1 1 1 )
  1: ( 1 1 1 0 0 0 )
}
( 3 3 3 3 3 3 )

Path graph with 6 vertices ascending
Mode: OUT
( 0 1 2 3 4 5 )
( 1 1 1 1 1 1 )
No. of components: 6
{
  0: ( 1 1 1 1 1 1 )
  1: ( 1 1 1 1 1 0 )
  2: ( 1 1 1 1 0 0 )
  3: ( 1 1 1 0 0 0 )
  4: ( 1 1 0 0 0 0 )
  5: ( 1 0 0 0 0 0 )
}
( 6 5 4 3 2 1 )
Mode: IN
( 0 1 2 3 4 5 )
( 1 1 1 1 1 1 )
No. of components: 6
{
  0: ( 0 0 0 0 0 1 )
  1: ( 0 0 0 0 1 1 )
  2: ( 0 0 0 1 1 1 )
  3: ( 0 0 1 1 1 1 )
  4: ( 0 1 1 1 1 1 )
  5: ( 1 1 1 1 1 1 )
}
( 1 2 3 4 5 6 )
Mode: ALL
( 0 0 0 0 0 0 )
( 6 )
No. of components: 1
{
  0: ( 1 1 1 1 1 1 )
}
( 6 6 6 6 6 6 )

Path graph with 6 vertices descending
Mode: OUT
( 5 4 3 2 1 0 )
( 1 1 1 1 1 1 )
No. of components: 6
{
  0: ( 1 1 1 1 1 1 )
  1: ( 0 1 1 1 1 1 )
  2: ( 0 0 1 1 1 1 )
  3: ( 0 0 0 1 1 1 )
  4: ( 0 0 0 0 1 1 )
  5: ( 0 0 0 0 0 1 )
}
( 1 2 3 4 5 6 )
Mode: IN
( 5 4 3 2 1 0 )
( 1 1 1 1 1 1 )
No. of components: 6
{
  0: ( 1 0 0 0 0 0 )
  1: ( 1 1 0 0 0 0 )
  2: ( 1 1 1 0 0 0 )
  3: ( 1 1 1 1 0 0 )
  4: ( 1 1 1 1 1 0 )
  5: ( 1 1 1 1 1 1 )
}
( 6 5 4 3 2 1 )
Mode: ALL
( 0 0 0 0 0 0 )
( 6 )
No. of components: 1
{
  0: ( 1 1 1 1 1 1 )
}
( 6 6 6 6 6 6 )

Small directed graph
Mode: OUT
( 5 5 5 6 7 7 4 2 3 3 3 1 0 )
( 1 1 1 3 1 3 1 2 )
No. of components: 8
{
  0: ( 1 0 0 0 0 0 1 0 0 0 0 0 0 )
  1: ( 0 1 0 0 0 0 1 0 0 0 0 0 0 )
  2: ( 0 0 1 1 1 1 0 1 1 0 0 0 0 )
  3: ( 0 0 1 1 1 0 0 0 0 0 0 0 0 )
  4: ( 0 0 0 0 0 0 1 0 0 0 0 0 0 )
  5: ( 0 0 0 0 0 0 0 1 1 1 1 1 1 )
  6: ( 0 0 0 0 0 0 0 1 1 1 0 0 0 )
  7: ( 0 0 0 0 0 0 0 1 1 0 0 0 0 )
}
( 6 6 6 3 2 2 1 6 3 3 3 2 2 )
Mode: IN
( 5 5 5 6 7 7 4 2 3 3 3 1 0 )
( 1 1 1 3 1 3 1 2 )
No. of components: 8
{
  0: ( 1 0 0 0 0 0 0 0 0 0 0 0 0 )
  1: ( 0 1 0 0 0 0 0 0 0 0 0 0 0 )
  2: ( 0 0 0 0 0 1 0 0 0 0 0 0 0 )
  3: ( 0 0 1 1 1 1 0 0 0 0 0 0 0 )
  4: ( 1 1 0 0 0 0 1 0 0 0 0 0 0 )
  5: ( 0 0 0 0 0 0 0 0 0 0 1 1 1 )
  6: ( 0 0 0 0 0 0 0 0 0 1 1 1 1 )
  7: ( 0 0 0 0 0 1 0 1 1 1 1 1 1 )
}
( 3 3 3 4 7 7 3 1 4 4 4 1 1 )
Mode: ALL
( 0 0 0 0 0 0 1 0 0 0 0 1 1 )
( 10 3 )
No. of components: 2
{
  0: ( 0 0 1 1 1 1 0 1 1 1 1 1 1 )
  1: ( 1 1 0 0 0 0 1 0 0 0 0 0 0 )
}
( 10 10 10 10 10 10 3 10 10 10 10 3 3 )

Small undirected graph
Mode: ALL
( 0 0 0 1 1 2 )
( 3 2 1 )
No. of components: 3
{
  0: ( 0 0 0 1 1 1 )
  1: ( 0 1 1 0 0 0 )
  2: ( 1 0 0 0 0 0 )
}
( 3 3 3 2 2 1 )