Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Make the vector [1 2 3 4 5 6 7 8 9 10]
Maximum running product for a string of numbers
Prime factor digits
Find the dimensions of a matrix
longest common semi-substring
BLOCK x3 (Version 2)
Construct a precedence graph from a code segment
Fermat's last theorem - again
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