Given an adjacency matrix of a simple undirected graph, find the number of connected components.
The Goldbach Conjecture
Distance walked 2D
Project Euler: Problem 7, Nth prime
Convert a vector into numbers
Integer Sequence - II : New Fibonacci
row-th maximum row elements
Fermat's last theorem - again
Diagonal of a Spiral Matrix
remove single elements
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