Qurak

TransitiveReductionGraph

Beschikbaar

Minimal graph preserving the reachability of a directed acyclic graph

TransitiveReductionGraph[g]
TransitiveReductionGraph[{v -> w, …}]
TransitiveReductionGraph[{1 -> 2, 1 -> 5, 2 -> 3, 3 -> 4, 4 -> 5, 3 -> 6, 4 -> 6}] → Graph[<6>, <5>]

Onderwerpen

Gerelateerd

Alle 6300 functies · Gebruik dit vanuit een MCP-client