Maple Professional
Maple Academic
Maple Student Edition
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professional
MapleSim Academic
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
Aerospace
Vehicle Engineering
Robotics
Power Industries
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Robotics/Motion Control/Mechatronics
Other Application Areas
Mathematics Education
Engineering Education
High Schools & Two-Year Colleges
Testing & Assessment
Students
Financial Modeling
Operations Research
High Performance Computing
Physics
Live Webinars
Recorded Webinars
Upcoming Events
MaplePrimes
Maplesoft Blog
Maplesoft Membership
Maple Ambassador Program
MapleCloud
Technical Whitepapers
E-Mail Newsletters
Maple Books
Math Matters
Application Center
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
networks[adjacency] - construct the adjacency matrix of a graph
Calling Sequence
adjacency(G)
Parameters
G
-
graph or network
Description
Important: The networks package has been deprecated. Use the superseding command GraphTheory[AdjacencyMatrix] instead.
Two vertices are said to be adjacent if one or more edges connect them. This routine constructs an adjacency matrix whose rows and columns are indexed by the vertices and whose i-jth entry is the number of edges from vertex i to vertex j.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[adjacency](...).
Examples
See Also
GraphTheory, GraphTheory[AdjacencyMatrix], networks(deprecated)[complete], networks(deprecated)[incidence], with
Download Help Document