Mathematics > Graph and Network Algorithms

54 functions in MATLAB › Mathematics > Graph and Network Algorithms.

`addedge`	Adds edges to a graph or digraph, creating new nodes if needed.
`addnode`	Adds nodes to a graph or digraph.
`adjacency`	Adjacency matrix of a graph.
`allcycles`	Finds every simple cycle of a graph or digraph.
`allpaths`	Finds every simple path between two nodes.
`bctree`	Block-cut tree of an undirected graph.
`bfsearch`	Breadth-first search: nodes in order of discovery by distance in edges.
`biconncomp`	Biconnected components (blocks) of an undirected graph.
`centrality`	Importance score of each node, by one of several measures.
`condensation`	Condensation of a digraph: each strongly connected component becomes one node.
`conncomp`	Connected components of a graph or digraph.
`cyclebasis`	A set of independent cycles from which all cycles of a graph can be built.
`degree`	Number of edges at each node of a graph.
`dfsearch`	Depth-first search: nodes in the order a depth-first traversal discovers them.
`digraph`	Creates a directed graph from edges or an adjacency matrix.
`distances`	Shortest-path distances between nodes.
`edgecount`	Number of edges between two nodes of a multigraph.
`findedge`	Index of the edge between two nodes.
`findnode`	Index of a node given its name.
`flipedge`	Reverses the direction of edges in a digraph.
`graph`	Creates an undirected graph from edges or an adjacency matrix.
`hascycles`	Tests whether a graph or digraph contains a cycle.
`highlight`	Colors chosen nodes or edges of a graph plot.
`incidence`	Incidence matrix: which edges touch which nodes.
`indegree`	Number of edges entering each node of a digraph.
`inedges`	Indices of the edges entering a node.
`isdag`	Tests whether a digraph is a directed acyclic graph.
`isisomorphic`	Tests whether two graphs have the same structure.
`ismultigraph`	Tests whether a graph has parallel edges.
`isomorphism`	Finds a node mapping that makes two graphs identical.
`labeledge`	Adds labels to the edges of a graph plot.
`labelnode`	Adds labels to the nodes of a graph plot.
`laplacian`	Laplacian matrix of a graph.
`layout`	Changes how a graph plot places its nodes.
`maxflow`	Maximum flow through a network from a source to a sink.
`minspantree`	Minimum spanning tree of a weighted graph.
`nearest`	Nodes within a given distance of a node.
`neighbors`	Nodes directly connected to a node.
`numedges`	Number of edges in a graph.
`numnodes`	Number of nodes in a graph.
`outdegree`	Number of edges leaving each node of a digraph.
`outedges`	Indices of the edges leaving a node.
`predecessors`	Nodes that have an edge into a given node of a digraph.
`reordernodes`	Renumbers the nodes of a graph.
`rmedge`	Removes edges from a graph or digraph.
`rmnode`	Removes nodes, and the edges at them, from a graph or digraph.
`shortestpath`	Shortest path between two nodes.
`shortestpathtree`	Tree of shortest paths from one source node.
`simplify`	Collapses parallel edges and removes self-loops of a graph.
`subgraph`	Extracts the graph induced by a set of nodes.
`successors`	Nodes that a given node of a digraph points to.
`toposort`	Topological order of the nodes of a directed acyclic graph.
`transclosure`	Transitive closure of a directed graph.
`transreduction`	Transitive reduction of a directed acyclic graph.