draws a graph
graph or network
sequence of disjoint lists of vertices
Important: The networks package has been deprecated. Use the superseding commands GraphTheory[DrawGraph] and GraphTheory[DrawNetwork] instead.
This routine is used to provide a visual display of the edges and vertices of a graph.
If no vertex partition is specified with the Linear or Concentric options, all vertices are drawn at equal intervals around a circle.
The Linear option draws the vertex groups specified by the lists in L in lines.
The Concentric option draws the vertex groups as specified by lists in L in concentric circles, with the first group in L forming the innermost circle.
Vertices not included in one of the lists in L are formed into a last group.
The method of drawing a specific graph can be specified by assigning a plotting procedure, as in the statement G(_Draw) := proc(G) draw(Concentric([6, 8, 10, 7, 9])) end proc. These procedures can invoke the draw() command with specific arguments, or build an appropriate PLOT data structure directly. An example of such a procedure can be found associated with the Petersen graph.
This routine is normally loaded by using the command with(networks), but it may also be referenced using the full name networks[draw](...).
G ≔ petersen⁡:
Download Help Document
What kind of issue would you like to report? (Optional)