# Algoritmos de gráficas y redes

Gráficas dirigidas y sin dirigir, análisis de 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

expandir todo

 `graph` Graph with undirected edges `digraph` Graph with directed edges
 `addnode` Add new node to graph `rmnode` Remove node from graph `addedge` Add new edge to graph `rmedge` Remove edge from graph `flipedge` Reverse edge directions `numnodes` Number of nodes in graph `numedges` Number of edges in graph `findnode` Locate node in graph `findedge` Locate edge in graph `edgecount` Number of edges between two nodes `reordernodes` Reorder graph nodes `subgraph` Extract subgraph
 `centrality` Measure node importance `conncomp` Connected graph components `biconncomp` Biconnected graph components `condensation` Graph condensation `bctree` Block-cut tree graph `toposort` Topological order of directed acyclic graph `isdag` Determine if graph is acyclic `transreduction` Transitive reduction `transclosure` Transitive closure `isisomorphic` Determine whether two graphs are isomorphic `isomorphism` Compute isomorphism between two graphs `ismultigraph` Determine whether graph has multiple edges `simplify` Reduce multigraph to simple graph
 `bfsearch` Breadth-first graph search `dfsearch` Depth-first graph search `shortestpath` Shortest path between two single nodes `shortestpathtree` Shortest path tree from node `distances` Shortest path distances of all node pairs `allpaths` Find all paths between two graph nodes (desde R2021a) `maxflow` Maximum flow in graph `minspantree` Minimum spanning tree of graph `hascycles` Determine whether graph contains cycles (desde R2021a) `allcycles` Find all cycles in graph (desde R2021a) `cyclebasis` Fundamental cycle basis of graph (desde R2021a)
 `adjacency` Graph adjacency matrix `incidence` Graph incidence matrix `laplacian` Graph Laplacian matrix
 `degree` Degree of graph nodes `neighbors` Neighbors of graph node `nearest` Nearest neighbors within radius `indegree` In-degree of nodes `outdegree` Out-degree of nodes `predecessors` Node predecessors `successors` Node successors `inedges` Incoming edges to node `outedges` Outgoing edges from node
 `plot` Plot graph nodes and edges `labeledge` Label graph edges `labelnode` Label graph nodes `layout` Change layout of graph plot `highlight` Highlight nodes and edges in plotted graph

## Objetos

 `GraphPlot` Graph plot for directed and undirected graphs