Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
A collection of mixed graph functionality
Contributed by: Peter Cullen Burbery
This paclet contains a functions for manipulating, generating, and analyzing mixed graphs.
This paclet is for the mixed Chinese postman problem MCPP or MCP and arc routing research. I am working on implementing a version of FindPostmanTour for mixed graphs. The MCP is NP complete.
To install this paclet in your Wolfram Language environment,
evaluate this code:
PacletInstall["PeterBurbery/MixedGraphs"]
To load the code after installation, evaluate this code:
Needs["PeterBurbery`MixedGraphs`"]
Generate a random mixed graph with 20 vertices and 54 edges with 0.75 directed edges:
| In[1]:= |
| Out[1]= | ![]() |
Create a list of 3 random mixed graphs with 20 vertices and 54 edges:
| In[2]:= |
| Out[2]= | ![]() |
Create a random mixed graph from a graph distribution:
| In[3]:= |
| Out[3]= | ![]() |
Create a list of 2 random mixed graphs with a graph distribution:
| In[4]:= |
| Out[4]= | ![]() |
Create a random mixed graph with the Barabasi-Albert graph distribution:
| In[5]:= |
| Out[5]= | ![]() |
Create a list of mixed graphs:
| In[6]:= |
| Out[6]= | ![]() |
Create a mixed graph with the degree graph vertex distribution:
| In[7]:= |
| Out[7]= | ![]() |
Create a mixed graph with the price graph distribution based on an attractiveness parameter of 1:
| In[8]:= |
| Out[8]= | ![]() |
Create a random mixed graph that obeys a spatial graph distribution:
| In[9]:= |
| Out[9]= | ![]() |
Use the uniform graph distribution for a mixed graph:
| In[10]:= |
| Out[10]= | ![]() |
Create a random mixed graph generated with the Watts–Strogatz graph distribution:
| In[11]:= |
| Out[11]= | ![]() |
Create a list of mixed graphs:
| In[12]:= |
| Out[12]= | ![]() |
Wolfram Language Version 13.1