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
MixedGraphs
Guides
Mixed Graph Functions
Symbols
EulerizeGraph
EvenDegreeVertexList
EvenDegreeVertexQ
GeneralizedGraphData
GraphConvexHull
GraphicalDegreeSequenceQ
GraphInformation
MixedGraphDirectedArcs
MixedGraphToDigraph
MixedGraphUndirectedEdges
OddDegreeVertexList
OddDegreeVertexQ
OddNodes
RandomMixedGraph
RandomSymbolicMixedGraph
RandomSymbolicWeightedMixedGraph
RandomWeightedMixedGraph
TakeLargestGraphComponentBy
UndirectedGraphToMixedGraph
Mixed Graph Functions
This paclet has functions for manipulating, analyzing, generating, and creating mixed graphs.
R
a
n
d
o
m
M
i
x
e
d
G
r
a
p
h
— creates a random mixed graph
R
a
n
d
o
m
W
e
i
g
h
t
e
d
M
i
x
e
d
G
r
a
p
h
— make a random weighted mixed graph
E
u
l
e
r
i
z
e
G
r
a
p
h
— makes a graph Eulerian by adding edges to odd vertexes
U
n
d
i
r
e
c
t
e
d
G
r
a
p
h
T
o
M
i
x
e
d
G
r
a
p
h
— make a graph mixed by turning a fraction of the edges into directed edges
M
i
x
e
d
G
r
a
p
h
U
n
d
i
r
e
c
t
e
d
E
d
g
e
s
— find the undirected edges of a mixed graph
M
i
x
e
d
G
r
a
p
h
D
i
r
e
c
t
e
d
A
r
c
s
— find the directed arcs of a mixed graph
G
r
a
p
h
I
n
f
o
r
m
a
t
i
o
n
— information for a graph
T
a
k
e
L
a
r
g
e
s
t
G
r
a
p
h
C
o
m
p
o
n
e
n
t
B
y
— take the largest graph component by a function
G
r
a
p
h
i
c
a
l
D
e
g
r
e
e
S
e
q
u
e
n
c
e
Q
— evaluate if a sequence can represent the degree sequence for a graph
R
a
n
d
o
m
S
y
m
b
o
l
i
c
M
i
x
e
d
G
r
a
p
h
— create a random mixed graph with vertices named by subscripted symbols
R
a
n
d
o
m
S
y
m
b
o
l
i
c
W
e
i
g
h
t
e
d
M
i
x
e
d
G
r
a
p
h
— create a random weighted mixed graph with vertices named by subscripted symbols
G
r
a
p
h
C
o
n
v
e
x
H
u
l
l
— compute the convex hull in a graph from a subset of the vertex set
M
i
x
e
d
G
r
a
p
h
T
o
D
i
g
r
a
p
h
— go from a mixed graph to a digraph
M
i
x
e
d
C
h
i
n
e
s
e
P
o
s
t
m
a
n
P
r
o
b
l
e
m
— solve the mixed Chinese postman problem
R
e
s
i
s
t
a
n
c
e
M
a
t
r
i
x
— compute the resistance matrix of a graph
R
a
n
d
o
m
C
u
s
t
o
m
G
r
a
p
h
— generate a graph with custom parameters, for example a random weighted mixed graph that is connected
G
e
n
e
r
a
l
i
z
e
d
G
r
a
p
h
D
a
t
a
— compute graph data for a matrix
M
i
x
e
d
S
u
b
g
r
a
p
h
— compute the subgraph of a mixed graph
M
i
x
e
d
E
u
l
e
r
i
a
n
G
r
a
p
h
Q
— test if a mixed graph is Eulerian
M
i
x
e
d
F
i
n
d
E
u
l
e
r
i
a
n
C
y
c
l
e
— find Eulerian cycles for a mixed graph
M
i
x
e
d
C
h
i
n
e
s
e
P
o
s
t
m
a
n
P
r
o
b
l
e
m
M
i
n
i
m
u
m
C
o
s
t
P
a
t
h
E
d
g
e
S
e
t
— find a set of edges that can be crossed in a particular order to solve the Mixed Chinese Postman Problem at minimal cost on a mixed graph
O
d
d
N
o
d
e
s
— find the odd nodes of a undirected connected graph
B
l
o
s
s
o
m
I
n
e
q
u
a
l
i
t
i
e
s
— compute the blossom inequalities of a weighted undirected graph
"
"