Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
PeterBurbery`MixedGraphs`
UndirectedGraphToMixedGraph  |
|
| | ||||
Details and Options
Examples
(1)
Basic Examples
(1)
In[1]:=
 | UndirectedGraphToMixedGraph |
Out[1]=
Construct a circulant graph with 35% directed edges:
In[2]:=
| UndirectedGraphToMixedGraph |
Out[2]=
Generate a random mixed spatial graph and take the largest connected component by edge count:
In[3]:=
=RandomGraph[SpatialGraphDistribution[148,]]
-2
Out[3]=
Take the largest connected graph component:
In[4]:=
| TakeLargestGraphComponentBy |
Out[4]=
Convert the graph to a mixed graph made up of 0.68 directed arcs:
In[5]:=
| UndirectedGraphToMixedGraph |
 | TakeLargestGraphComponentBy |
Out[5]=
RandomMixedGraph can be used to do this in one step:
In[6]:=
| RandomMixedGraph |
-2
Out[6]=
 |
|
 |
|
Examples Initialization
Metadata