Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Similar Triangles - find the height of the tree
Vectorize the digits of an Integer
Set some matrix elements to zero
Replace Nonzero Numbers with 1
Graph Algorithms - 1 : Length of the largest closed path
longest common substring : Skipped character version
Elements with highest local average
Integer Sequence - II : New Fibonacci
Path of least resistance - Move all direction
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