Graphs model the connections in a network and are widely applicable to a variety of physical, biological, and information systems. You can use graphs to model the neurons in a brain, the flight patterns of an airline, and much more. The structure of a graph is comprised of “nodes” and “edges”. Each node represents an entity, and each edge represents a connection between two nodes. For more information, see Directed and Undirected Graphs.
|Add new node to graph|
|Remove node from graph|
|Add new edge to graph|
|Remove edge from graph|
|Reverse edge directions|
|Number of nodes in graph|
|Number of edges in graph|
|Locate node in graph|
|Locate edge in graph|
|Reorder graph nodes|
|Breadth-first graph search|
|Depth-first graph search|
|Measure node importance|
|Maximum flow in graph|
|Connected graph components|
|Biconnected graph components|
|Block-cut tree graph|
|Minimum spanning tree of graph|
|Topological order of directed acyclic graph|
|Determine if graph is acyclic|
|Determine whether two graphs are isomorphic|
|Compute equivalence relation between two graphs|
|Graph plot for directed and undirected graphs|
|GraphPlot Properties||Control graph plot appearance and behavior|
Introduction to directed and undirected graphs.
This example shows how to access and modify the nodes and/or edges in a
digraph object using the
This example shows how to add attributes to the nodes and edges in graphs created using
This example shows how to plot graphs, and then customize the display to add labels or highlighting to the graph nodes and edges.
This example shows how to customize the
GraphPlot data cursor to display extra node properties of a graph.
This example shows how to define a function that visualizes the results of
dfsearch by highlighting the nodes and edges of a graph.
This example shows how to construct and analyze a Watts-Strogatz small-world graph.
This example shows how to use a PageRank algorithm to rank a collection of websites.
This example shows how to use the Laplacian matrix of a graph to compute the Fiedler vector.