Back to Opa

Intro

docs/docs/policy-reference/_examples/graphs/reachable/intro.md

1.19.0320 B
Original Source
<!-- markdownlint-disable MD041 -->

A common class of recursive rules can be reduced to a graph reachability problem, so graph.reachable is useful for more than just graph analysis. This usually requires some pre- and postprocessing. The following example shows you how to "flatten" a hierarchy of access permissions.