Wed Apr 22 10:55:13 2026

digraph_arc_test():
  numpy version:      1.26.4
  python version:     3.10.12
  Test digraph_arc(), which implements digraph algorithms
  using an arc list representation.

digraph_adj_to_arc_test():
  digraph_adj_to_arc() converts a digraph in
  adjacency form to arc list form

  The digraph adjacency matrix:
array([[0, 1, 0, 0, 0, 0],
       [0, 0, 1, 0, 0, 0],
       [0, 0, 0, 1, 0, 0],
       [0, 0, 0, 0, 1, 0],
       [0, 0, 0, 0, 0, 1],
       [0, 1, 0, 0, 0, 0]])

  The digraph edge list:
array([[0., 1.],
       [5., 1.],
       [1., 2.],
       [2., 3.],
       [3., 4.],
       [4., 5.]])

digraph_arc_degree_test():
  digraph_arc_degree() computes the degree of the nodes,

  The digraph arc list:
array([[0, 2],
       [0, 6],
       [0, 9],
       [1, 4],
       [1, 9],
       [2, 5],
       [2, 8],
       [3, 6],
       [3, 7],
       [5, 8],
       [7, 9]])
  The in- and out- degrees:
array([[0., 3.],
       [0., 2.],
       [1., 2.],
       [0., 2.],
       [1., 0.],
       [1., 1.],
       [2., 0.],
       [1., 1.],
       [2., 0.],
       [3., 0.]])

digraph_arc_is_eulerian_test()
  digraph_arc_is_eulerian() checks if a digraph
  has (at least one) Euler circuit.

  The digraph arc list:
array([[0, 1],
       [2, 0],
       [0, 3],
       [4, 0],
       [1, 2],
       [3, 1],
       [1, 4],
       [3, 2],
       [2, 4],
       [4, 3]])
  The digraph has an eulerian circuit.

digraph_arc_to_adj_test():
  digraph_arc_to_adj() converts an arclist
  digraph to an adjacency digraph.

  The digraph arc list:
array([[0, 2],
       [0, 4],
       [1, 5],
       [1, 7],
       [2, 3],
       [2, 5],
       [2, 6],
       [3, 2],
       [4, 1],
       [5, 3],
       [5, 7],
       [6, 6],
       [6, 8],
       [7, 0],
       [8, 4],
       [8, 6]])

  The digraph adjacency matrix:
array([[0., 0., 1., 0., 1., 0., 0., 0., 0.],
       [0., 0., 0., 0., 0., 1., 0., 1., 0.],
       [0., 0., 0., 1., 0., 1., 1., 0., 0.],
       [0., 0., 1., 0., 0., 0., 0., 0., 0.],
       [0., 1., 0., 0., 0., 0., 0., 0., 0.],
       [0., 0., 0., 1., 0., 0., 0., 1., 0.],
       [0., 0., 0., 0., 0., 0., 1., 0., 1.],
       [1., 0., 0., 0., 0., 0., 0., 0., 0.],
       [0., 0., 0., 0., 1., 0., 1., 0., 0.]])

digraph_arc_to_star_test():
  digraph_arc_to_star() converts an arclist
  digraph to a forward star representation.

  The digraph arc list:
array([[0, 2],
       [0, 4],
       [1, 5],
       [1, 7],
       [2, 3],
       [2, 5],
       [2, 6],
       [3, 2],
       [4, 1],
       [5, 3],
       [5, 7],
       [6, 6],
       [6, 8],
       [7, 0],
       [8, 4],
       [8, 6]])

  The digraph forward star representation:
  arcfir():
array([ 0.,  2.,  4.,  7.,  8.,  9., 11., 13., 14., 16.])
  fwdarc():
array([2., 4., 5., 7., 3., 5., 6., 2., 1., 3., 7., 6., 8., 0., 4., 6.])

digraph_arc_test():
  Normal end of execution.
Wed Apr 22 10:55:13 2026