Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
DiagrammaticComputation
Guides
DiagramConversion
DiagramDrawing
DiagramGrid
DiagramRewriting
Diagrams
DiagramSurgery
FeynmanDiagrams
Ports
Tech Notes
Diagram Examples
Introduction to Diagrammatic Computation
Rewriting Diagrams
Symbols
AnnihilationRule
CapDiagram
ColumnDiagram
CommutationRule
CopyDiagram
CupDiagram
DiagramArrange
DiagramAssignPorts
DiagramCases
DiagramComposition
DiagramCopySplit
DiagramDecompose
DiagramDelete
DiagramDraw
DiagramDual
DiagramExpressionReplace
DiagramExtract
DiagramFlip
DiagramFunction
DiagramGraphics
DiagramGraphSimplify
DiagramGridHeight
DiagramGrid
DiagramGridTree
DiagramGridWidthHeight
DiagramGridWidth
DiagramHypergraph
DiagramHypergraphRule
DiagramInsert
DiagramMapAt
DiagramMap
DiagramMatchPorts
Diagram
DiagramNestReplace
DiagramNetwork
DiagramPattern
DiagramPermute
DiagramPosition
DiagramPositions
DiagramProduct
DiagramQ
DiagramReplaceList
DiagramReplace
DiagramReplacePart
DiagramReverse
DiagramRightComposition
DiagramRule
DiagramsFreePorts
DiagramsGraph
DiagramsNetGraph
DiagramSplit
DiagramsPortGraph
DiagramSubdiagrams
DiagramSum
DiagramTensor
DuplicateAnnihilationRule
DuplicateEraserRule
EmptyDiagram
EmptyDiagramQ
EmptyPortQ
EraserAnnihilationRule
EraserDiagram
EraserRule
FeynArtsTopologyGraphics
FeynmanDiagram
GridInputPorts
GridOutputPorts
IdentityDiagram
MergeDiagram
PermutationDiagram
PortDual
PortMinus
Port
PortNeutral
PortPower
PortProduct
PortQ
PortSum
PropagationRule
RemoveDiagramRule
RowDiagram
SimplifyDiagram
SingletonDiagram
SpiderDiagram
TagPort
TensorDiagram
ToDiagram
ToDiagramNetwork
TopologyGraphics
TopologyGraph
TopologyGraphs
UntagPort
WigglyArcFunction
ZeroDiagram
ZeroPortQ
Wolfram`DiagrammaticComputation`
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
[
t
o
p
o
l
o
g
y
i
n
s
e
r
t
i
o
n
s
]
c
o
m
p
u
t
e
s
t
h
e
F
e
y
n
A
r
t
s
g
r
a
p
h
i
c
s
d
a
t
a
(
D
i
a
g
r
a
m
G
r
a
p
h
i
c
s
)
f
o
r
a
t
o
p
o
l
o
g
y
w
i
t
h
f
i
e
l
d
i
n
s
e
r
t
i
o
n
s
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
A low-level helper: it resolves vertex placements and propagator shapes through the FeynArts shape database and returns one
F
e
y
n
A
r
t
s
`
D
i
a
g
r
a
m
G
r
a
p
h
i
c
s
object per insertion.
▪
F
e
y
n
A
r
t
s
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
wraps this and renders the result to ordinary
G
r
a
p
h
i
c
s
; use that for display.
Examples
(
0
)
S
e
e
A
l
s
o
F
e
y
n
A
r
t
s
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
▪
T
o
p
o
l
o
g
y
G
r
a
p
h
▪
F
e
y
n
m
a
n
D
i
a
g
r
a
m
R
e
l
a
t
e
d
G
u
i
d
e
s
▪
F
e
y
n
m
a
n
D
i
a
g
r
a
m
s
Compute the graphics data for a topology and its field insertions (one
D
i
a
g
r
a
m
G
r
a
p
h
i
c
s
per inserted graph):
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
[
t
o
p
o
l
o
g
y
i
n
s
e
r
t
e
d
G
r
a
p
h
s
]
For rendered output, use
F
e
y
n
A
r
t
s
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
, which feeds this data through the FeynArts renderer:
I
n
[
1
]
:
=
N
e
e
d
s
[
"
F
e
y
n
A
r
t
s
`
"
]
F
e
y
n
A
r
t
s
`
$
F
A
V
e
r
b
o
s
e
=
0
;
I
n
[
2
]
:
=
F
e
y
n
A
r
t
s
T
o
p
o
l
o
g
y
G
r
a
p
h
i
c
s
[
F
i
r
s
t
@
C
r
e
a
t
e
T
o
p
o
l
o
g
i
e
s
[
0
,
2
2
]
]
O
u
t
[
2
]
=
"
"