Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Given an unsigned integer x, find the largest y by rearranging the bits in x
Create an index-powered vector
03 - Matrix Variables 6
Test if a matrix is symmetric
longest common semi-substring
Fermat's last theorem - again
Cat, Meowcat and Concatenation
possible ways through matrix
Tribute to Ramanujan
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