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[edges] - finds edges in a graph
Calling Sequence
edges(G)
edges(P, G)
edges(P, G, 'all')
Parameters
G
-
graph or network
P
vertex pair, either in a set or list
Description
Important: The networks package has been deprecated. Use the superseding command GraphTheory[Edges] instead.
This routine is used to request the names of the edges in a graph G.
If the only argument provided is the graph G then the names of all the edges in G are returned as a set.
The optional first argument P can be used to restrict the request for names to edges between a pair of vertices.
If P is the set {u, v} then the names of all the undirected edges between u and v are returned.
If P is a list, , then the names of all the edges directed from u to v are returned.
The third option 'all' can be used to indicate that all of the edges between u and v, regardless of direction, are desired.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[edges](...).
Examples
See Also
GraphTheory, GraphTheory[Edges], networks(deprecated)[vertices], with
Download Help Document