No vertices:
{
}
Directed graph with loops and multi-edges, order 0:
{
  0: ( 0 )
  1: ( 1 )
  2: ( 2 )
  3: ( 3 )
  4: ( 4 )
  5: ( 5 )
}
Directed graph with loops and multi-edges, order 1, ignoring direction:
{
  0: ( 0 1 2 )
  1: ( 1 0 3 )
  2: ( 2 0 3 )
  3: ( 3 1 2 4 )
  4: ( 4 3 )
  5: ( 5 )
}
Directed graph with loops and multi-edges, order 1, only checking IGRAPH_IN:
{
  0: ( 0 2 )
  1: ( 1 0 )
  2: ( 2 0 )
  3: ( 3 1 2 )
  4: ( 4 3 )
  5: ( 5 )
}
Directed graph with loops and multi-edges, order 10, ignoring direction:
{
  0: ( 0 1 2 3 4 )
  1: ( 1 0 3 2 4 )
  2: ( 2 0 3 1 4 )
  3: ( 3 1 2 4 0 )
  4: ( 4 3 1 2 0 )
  5: ( 5 )
}
Directed graph with loops and multi-edges, order 2, mindist 2, IGRAPH_OUT:
{
  0: ( 3 )
  1: ( 4 )
  2: ( 1 4 )
  3: ( )
  4: ( )
  5: ( )
}
Directed graph with loops and multi-edges, order 4, mindist 4, IGRAPH_ALL:
{
  0: ( )
  1: ( )
  2: ( )
  3: ( )
  4: ( )
  5: ( )
}
Directed graph with loops and multi-edges, infinite order, IGRAPH_OUT:
{
  0: ( 0 1 2 3 4 )
  1: ( 1 3 4 )
  2: ( 2 0 3 1 4 )
  3: ( 3 4 )
  4: ( 4 )
  5: ( 5 )
}
Directed graph with loops and multi-edges, infinite order, mindist 2, IGRAPH_OUT:
{
  0: ( 3 4 )
  1: ( 4 )
  2: ( 1 4 )
  3: ( )
  4: ( )
  5: ( )
}
Directed graph with loops and multi-edges, infinite order, mindist 2, IGRAPH_IN:
{
  0: ( )
  1: ( 2 )
  2: ( )
  3: ( 0 )
  4: ( 1 2 0 )
  5: ( )
}
Negative mindist.
