Law.graph: def of bolt@1.27.0.0
Import: import bolt@1.27.0.0/src/rules/laws/law.bend as Law
Lines 101-104 of bolt@1.27.0.0/src/rules/laws/law.bend: https://jend.leeeet.dev/read.txt?path=bolt@1.27.0.0/src/rules/laws/law.bend&start_line=101&end_line=104

import Base
import bolt@1.27.0.0/src/rules/digest.bend as Digest
import bolt@1.27.0.0/src/rules/imports.bend as Imports

# the graph: the empty key first, leading to what the laws name, then the
# items
def graph(+ds: List<&2, Digest.Digest>) -> List<&2, Imports.Edge>:
  Imports.Edge{"", keys(named(ds))} <> graph.items(ds)

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/digest.bend&name=Digest
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/imports.bend&name=Edge
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/laws/law.bend&name=graph.items
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/laws/law.bend&name=keys
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/laws/law.bend&name=named