Algoritmos de gráficas y redes
Las gráficas modelan las conexiones de una red y se aplican ampliamente a una gran variedad de sistemas físicos, biológicos y de información. Es posible usar gráficas para modelar las neuronas de un cerebro, los patrones de vuelo de una línea aérea y mucho más. La estructura de una gráfica está compuesta de “nodos” y “bordes”. Cada nodo representa una entidad, y cada borde, una conexión entre dos nodos. Para obtener más información, consulte Directed and Undirected Graphs.
Funciones
Objetos
GraphPlot | Graph plot for directed and undirected graphs |
Propiedades
| GraphPlot Properties | Graph plot appearance and behavior |
Temas
- Directed and Undirected Graphs
Introduction to directed and undirected graphs.
- Graphs and Matrices
This example shows an application of sparse matrices and explains the relationship between graphs and matrices.
- Modify Nodes and Edges of Existing Graph
This example shows how to access and modify the nodes and/or edges in a
graphordigraphobject using theaddedge,rmedge,addnode,rmnode,findedge,findnode, andsubgraphfunctions. - Add Graph Node Names, Edge Weights, and Other Attributes
This example shows how to add attributes to the nodes and edges in graphs created using
graphanddigraph. - Graph Plotting and Customization
This example shows how to plot graphs, and then customize the display to add labels or highlighting to the graph nodes and edges.
- Label Graph Nodes and Edges
This example shows how to add and customize labels on graph nodes and edges.
- Add Node Properties to Graph Plot Data Tips
This example shows how to customize
GraphPlotdata tips to display extra node properties of a graph. - Visualize Breadth-First and Depth-First Search
This example shows how to define a function that visualizes the results of
bfsearchanddfsearchby highlighting the nodes and edges of a graph.
Información relacionada
Ejemplos destacados
Build Watts-Strogatz Small World Graph Model
Construct and analyze a Watts-Strogatz small-world graph. The Watts-Strogatz model is a random graph that has small-world network properties, such as clustering and short average path length.
Use PageRank Algorithm to Rank Websites
Use a PageRank algorithm to rank a collection of websites. Although the PageRank algorithm was originally designed to rank search engine results, it also can be more broadly applied to the nodes in many different types of graphs. The PageRank score gives an idea of the relative importance of each graph node based on how it is connected to the other nodes.
Partition Graph with Laplacian Matrix
Use the Laplacian matrix of a graph to compute the Fiedler vector. The Fiedler vector can be used to partition the graph into two subgraphs.
