hasCycles

hasCycles, process

def process hasCycles(a: text, b: text): boolean

Interprets the pairs (a, b) as edges of a directed graph and returns true if the corresponding edge is part of a cycle.

• a: the source node identifier of the edge.
• b: the destination node identifier of the edge.

Example

table Edges = with 
  [| as A, as B |]  // HasCycles
  [| "1", "2" |]    // false
  [| "2", "3" |]    // true
  [| "3", "4" |]    // true
  [| "4", "2" |]    // true
  [| "5", "5" |]    // true
  [| "5", "6" |]    // false

Edges.HasCycles = hasCycles(Edges.A, Edges.B)

show table "Part of cycles" a1b6 with
  Edges.A
  Edges.B
  Edges.HasCycles

See also

• extend.billOfMaterials