RelationGraph.cycle_erased: def of bendvy-ecs-core@0.1.0.3
Import: import bendvy-ecs-core@0.1.0.3/relation_graph.bend as RelationGraph
Lines 103-106 of bendvy-ecs-core@0.1.0.3/relation_graph.bend: https://jend.leeeet.dev/read.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&start_line=103&end_line=106

import Base
import entity_key.bend as K
import relation_types.bend as T

def cycle_erased(-S: Data,+graph: T.Graph<S>,descriptor: T.Descriptor<S>,source: K.Key,target: K.Key) -> Bool:
  match graph descriptor:
    case T.Graph{edges,inverses} T.Descriptor{k,n,inv,T.Ordinary{}}: False{}
    case T.Graph{+edges,+inverses} T.Descriptor{+k,+n,+inv,T.Hierarchy{}}: cycle_loop_erased(S,List.length(&2,T.Edge<S>,edges),T.Graph{edges,inverses},T.Descriptor{k,n,inv,T.Hierarchy{}},source,target)

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.length
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/entity_key.bend&name=Key
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_graph.bend&name=cycle_loop_erased
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Descriptor
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Edge
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=Graph
  https://jend.leeeet.dev/definition.txt?path=bendvy-ecs-core@0.1.0.3/relation_types.bend&name=RelationKind