TransitiveClosureGraph
gives the transitive closure of the graph g.
TransitiveClosureGraph[{vw,…}]
uses rules vw to specify the graph g.
Details and Options
- TransitiveClosureGraph is also known as reachability graph.
- TransitiveClosureGraph[g] gives a graph with the same vertices as in g, and a vertex u is connected to a vertex v if there is a path from u to v in g.
- TransitiveClosureGraph takes the same options as Graph.
- Possible settings for the Method option include "Warshall", "Warren", and "Purdom". The default setting of Automatic switches among these methods depending on the graph given.
- TransitiveClosureGraph works with undirected graphs, directed graphs, and multigraphs.
-
AlignmentPoint Center the default point in the graphic to align with AnnotationRules {} annotations for graph, edges and vertices AspectRatio Automatic ratio of height to width Axes False whether to draw axes AxesLabel None axes labels AxesOrigin Automatic where axes should cross AxesStyle {} style specifications for the axes Background None background color for the plot BaselinePosition Automatic how to align with a surrounding text baseline BaseStyle {} base style specifications for the graphic ContentSelectable Automatic whether to allow contents to be selected CoordinatesToolOptions Automatic detailed behavior of the coordinates tool DirectedEdges Automatic whether to interpret Rule as DirectedEdge EdgeLabels None labels and label placements for edges EdgeLabelStyle Automatic style to use for edge labels EdgeShapeFunction Automatic generate graphic shapes for edges EdgeStyle Automatic style used for edges EdgeWeight Automatic weights for edges Epilog {} primitives rendered after the main plot FormatType TraditionalForm the default format type for text Frame False whether to put a frame around the plot FrameLabel None frame labels FrameStyle {} style specifications for the frame FrameTicks Automatic frame ticks FrameTicksStyle {} style specifications for frame ticks GraphHighlight {} graph elements to highlight GraphHighlightStyle Automatic style for highlight GraphLayout Automatic how to lay out vertices and edges GridLines None grid lines to draw GridLinesStyle {} style specifications for grid lines ImageMargins 0. the margins to leave around the graphic ImagePadding All what extra padding to allow for labels etc. ImageSize Automatic the absolute size at which to render the graphic LabelStyle {} style specifications for labels Method Automatic details of graphics methods to use PerformanceGoal Automatic aspects of performance to try to optimize PlotLabel None an overall label for the plot PlotRange All range of values to include PlotRangeClipping False whether to clip at the plot range PlotRangePadding Automatic how much to pad the range of values PlotRegion Automatic the final display region to be filled PlotTheme $PlotTheme overall theme for the graph PreserveImageOptions Automatic whether to preserve image options when displaying new versions of the same graphic Prolog {} primitives rendered before the main plot RotateLabel True whether to rotate y labels on the frame Ticks Automatic axes ticks TicksStyle {} style specifications for axes ticks VertexCoordinates Automatic coordinates for vertices VertexLabels None labels and placements for vertices VertexLabelStyle Automatic style to use for vertex labels VertexShape Automatic graphic shape for vertices VertexShapeFunction Automatic generate graphic shapes for vertices VertexSize Medium size of vertices VertexStyle Automatic styles for vertices VertexWeight Automatic weights for vertices
List of all options
Examples
open allclose allBasic Examples (1)
Scope (5)
TransitiveClosureGraph works with undirected graphs:
Use rules to specify the graph:
TransitiveClosureGraph works with large graphs:
Options (3)
Applications (2)
Properties & Relations (6)
The transitive closure graph has the same vertices as the original graph:
An edge uv is in the closure graph if there is a path from u to v in the original graph:
There is a path from 1 to 6 in the given graph, by no direct edge:
There is a direct edge 16 in the transitive closure:
The transitive closure of a connected undirected graph is a complete graph:
Using transitive closure to find the reachability of each vertex in the graph:
TransitiveClosureGraph can be computed using GraphPower:
The transitive closure is the same for a graph and its transitive reduction:
Text
Wolfram Research (2014), TransitiveClosureGraph, Wolfram Language function, https://reference.wolfram.com/language/ref/TransitiveClosureGraph.html (updated 2015).
CMS
Wolfram Language. 2014. "TransitiveClosureGraph." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/TransitiveClosureGraph.html.
APA
Wolfram Language. (2014). TransitiveClosureGraph. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/TransitiveClosureGraph.html