Published package / CLIR

algo.graph_traversal

v0.1.0

Обходы и структура графа: BFS, DFS, компоненты связности, топологическая сортировка методом Кана и через DFS, сильно связные компоненты Косарайю и Тарьяна — описания семи алгоритмов

The version is immutable: the content at this address never changes.

The descriptor below is exactly the record the resolver puts into law.lock. Its shape is normative ($defs/LockedPackage of the lockfile schema), so publication status is expressed by the section of the catalogue rather than by a field inside it: an extra field would make the descriptor invalid.

{
  "contentHash": "sha256:72f11a240fee523709baa9bc10e572d6f0c79ad64c1cdfb4293960d8f76032f6",
  "features": [
    "core-executable"
  ],
  "name": "algo.graph_traversal",
  "namespace": "urn:algo:clir:graph-traversal",
  "registryId": "law-dsl-dev",
  "resolverUri": "registry://law-dsl-dev/algo.graph_traversal/0.1.0",
  "version": "0.1.0"
}

Signature

Not issued. The field schema exists (signature: algorithm, keyId, value); an issuer and keys do not: a signature attests the provenance of the bytes, not the legal correctness of the rules, and is a separate piece of work.