ExpressionGraph

ExpressionGraph[expr]

gives the tree graph with different levels at different depths.

ExpressionGraph[expr,n]

gives the tree graph only down to level n.

ExpressionGraph[expr,n,form]

gives a tree graph in which subexpressions that match form are leaves.

Details and Options

Examples

open allclose all

Basic Examples  (3)

Construct a graph from a symbolic expression formatted as a tree:

Display a nest expression as a symmetric tree:

An asymmetric tree:

Limit the depth of a graphic object:

Scope  (5)

ExpressionGraph works with a formatted symbolic expression:

ExpressionGraph works with an expression containing subscripted variables:

A nested list:

A graphic object:

Limit the depth of the tree:

Use VertexLabels->True to generate a labeled graph:

Give a tree graph in which subexpressions that match form are leaves:

Options  (82)

AnnotationRules  (3)

Specify an annotation for vertices:

Edges:

Graph itself:

DirectedEdges  (1)

By default, an undirected graph is generated:

Use DirectedEdges->True to generate a directed graph:

EdgeLabels  (7)

Label the edge 12:

Label all edges individually:

Use any expression as a label:

Use Placed with symbolic locations to control label placement along an edge:

Use explicit coordinates to place labels:

Vary positions within the label:

Place multiple labels:

Use automatic labeling by values through Tooltip and StatusArea:

EdgeShapeFunction  (6)

Get a list of built-in settings for EdgeShapeFunction:

Undirected edges including the basic line:

Lines with different glyphs on the edges:

Directed edges including solid arrows:

Line arrows:

Open arrows:

Specify an edge function for an individual edge:

Combine with a different default edge function:

Draw edges by running a program:

EdgeShapeFunction can be combined with EdgeStyle:

EdgeShapeFunction has higher priority than EdgeStyle:

EdgeStyle  (2)

Style all edges:

Style individual edges:

EdgeWeight  (3)

Specify a weight for all edges:

Use any numeric expression as a weight:

Specify weights for individual edges:

GraphHighlight  (3)

Highlight the vertex 1:

Highlight the edge 13:

Highlight vertices and edges:

GraphHighlightStyle  (2)

Get a list of built-in settings for GraphHighlightStyle:

Use built-in settings for GraphHighlightStyle:

GraphLayout  (5)

By default, the layout is chosen automatically:

Specify layouts on special curves:

Specify layouts that satisfy optimality criteria:

VertexCoordinates overrides GraphLayout coordinates:

Use AbsoluteOptions to extract VertexCoordinates computed using a layout algorithm:

PlotTheme  (4)

Base themes  (2)

Use a common base theme:

Use a monochrome theme:

Feature themes  (2)

Use a large graph theme:

Use a classic diagram theme:

VertexCoordinates  (2)

By default, any vertex coordinates are computed automatically:

Extract the resulting vertex coordinates using AbsoluteOptions:

Specify a layout function along an ellipse:

Use it to generate vertex coordinates for a graph:

VertexLabels  (13)

Use vertex names as labels:

Label individual vertices:

Label all vertices:

Use any expression as a label:

Use Placed with symbolic locations to control label placement, including outside positions:

Symbolic outside corner positions:

Symbolic inside positions:

Symbolic inside corner positions:

Use explicit coordinates to place the center of labels:

Place all labels at the upper-right corner of the vertex and vary the coordinates within the label:

Place multiple labels:

Any number of labels can be used:

Use the argument to Placed to control formatting including Tooltip:

Or StatusArea:

Use more elaborate formatting functions:

VertexShape  (5)

Use any Graphics, Image or Graphics3D as a vertex shape:

Specify vertex shapes for individual vertices:

VertexShape can be combined with VertexSize:

VertexShape is not affected by VertexStyle:

VertexShapeFunction has higher priority than VertexShape:

VertexShapeFunction  (10)

Get a list of built-in collections for VertexShapeFunction:

Use built-in settings for VertexShapeFunction in the "Basic" collection:

Simple basic shapes:

Common basic shapes:

Use built-in settings for VertexShapeFunction in the "Rounded" collection:

Use built-in settings for VertexShapeFunction in the "Concave" collection:

Draw individual vertices:

Combine with a default vertex function:

Draw vertices using a predefined graphic:

Draw vertices by running a program:

VertexShapeFunction can be combined with VertexStyle:

VertexShapeFunction has higher priority than VertexStyle:

VertexShapeFunction can be combined with VertexSize:

VertexShapeFunction has higher priority than VertexShape:

VertexSize  (8)

By default, the size of vertices is computed automatically:

Specify the size of all vertices using symbolic vertex size:

Use a fraction of the minimum distance between vertex coordinates:

Use a fraction of the overall diagonal for all vertex coordinates:

Specify size in both the and directions:

Specify the size for individual vertices:

VertexSize can be combined with VertexShapeFunction:

VertexSize can be combined with VertexShape:

VertexStyle  (5)

Style all vertices:

Style individual vertices:

VertexShapeFunction can be combined with VertexStyle:

VertexShapeFunction has higher priority than VertexStyle:

VertexStyle can be combined with BaseStyle:

VertexStyle has higher priority than BaseStyle:

VertexShape is not affected by VertexStyle:

VertexWeight  (3)

Set the weight for all vertices:

Specify the weight for individual vertices:

Use any numeric expression as a weight:

Applications  (2)

Visualize the Wolfram axiom for Boolean algebra as a tree:

Generate recursive programming tree:

Properties & Relations  (5)

Use VertexCount and EdgeCount to count vertices and edges:

Use VertexList and EdgeList to enumerate vertices and edges in standard order:

Compute the AdjacencyMatrix from a graph:

FullForm gives a linear expression similar to ExpressionGraph:

Use TreeForm to plot a tree graph:

Possible Issues  (1)

ExpressionGraph[expr] works on the evaluated expression expr:

Neat Examples  (2)

A complete binary tree:

A complete ternary tree:

The RGB color cube expression tree:

Introduced in 2020
 (12.1)