Random Graph Layout Method
This option can take any value understood by the RandomTools distribution generator. See RandomTools/flavor/distribution. This method will generate n+n1d points and check if there were n unique points generated. If not, it will try again. If both distribution and generator options are given, only generator will be used.
This option can take a custom procedure that generates points (as lists) of the appropriate dimension. This method will generate n+n1d points and check if there were n unique points generated. If not, it will try again. If both distribution and generator options are given, only generator will be used.
Specify a seed to send to randomize before generating the random points.
The random layout method uses RandomTools:-Generate to generate random positions for the vertices of the graph. By default, this method randomly populates a 2⁢n1dd grid with the graph vertices (with an additional small random perturbation added to reduce the likelihood of overlapping edges).
This layout method works in two and three dimensions.
G ≔ Graph⁡undirected,1,2,2,3,3,4,4,1
G≔Graph 1: an undirected graph with 4 vertices and 4 edge(s)
A custom procedure to create random points can also be used
R ≔ RandomTools:-Generate⁡list⁡distribution⁡Uniform⁡−0.97,0.97,2,makeproc:
H ≔ HypercubeGraph⁡3
H≔Graph 2: an undirected graph with 8 vertices and 12 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)