Maple Professionel
Maple Académique
Maple Edition Étudiant
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professionel
MapleSim Académique
Maple T.A. - Suite d'examens de classement
Maple T.A. MAA Placement Test Suite
Möbius - Didacticiels de mathématiques en ligne
Machine Design / Industrial Automation
Aéronautique
Ingénierie des véhicules
Robotics
Energie
System Simulation and Analysis
Model development for HIL
Modélisation du procédé pour la conception de systèmes de contrôle
Robotics/Motion Control/Mechatronics
Other Application Areas
Enseignement des mathématiques
Enseignement de l’ingénierie
Enseignement secondaire et supérieur (CPGE, BTS)
Tests et évaluations
Etudiants
Modélisation financière
Recherche opérationnelle
Calcul haute performance
Physique
Webinaires en direct
Webinaires enregistrés
Agenda des évènements
Forum MaplePrimes
Blog Maplesoft
Membres Maplesoft
Maple Ambassador Program
MapleCloud
Livres blancs techniques
Bulletin électronique
Livres Maple
Math Matters
Portail des applications
Galerie de modèles MapleSim
Cas d'Etudes Utilisateur
Exploring Engineering Fundamentals
Concepts d’enseignement avec Maple
Centre d’accueil utilisateur Maplesoft
Centre de ressources pour enseignants
Centre d’assistance aux étudiants
networks[draw] - draws a graph
Calling Sequence
draw(G)
draw(Concentric(L), G)
draw(Linear(L), G)
Parameters
G
-
graph or network
L
sequence of disjoint lists of vertices
Description
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](...).
Examples
See Also
GraphTheory, GraphTheory[DrawGraph], GraphTheory[DrawNetwork], networks(deprecated)[show], with
Download Help Document