Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Return the largest number that is adjacent to a zero
Getting logical indexes
Find nearest prime number less than input number
Equal to their cube
Swap two numbers
Calculate the h-index
weekday and month
Integer sequence - 2 : Kolakoski sequence
Largest Geometric Series
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