Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Create a matrix X, where each column is a shifted copy of the vector v
Add two numbers
Find the position of first minimum value in an integer array with numbers
Graph Algorithms - 2 : Chromatic Number
longest common substring : Skipped character version
Diagonal of a Spiral Matrix
Determine connected components of a graph
Let's see how peculiar we can get
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office