Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Create a cell array out of a struct
Better bullseye matrix
Back to basics 5 - Clipboard
Return the first and last character of a string
Path of least resistance - Move all direction
Fermat's last theorem - again
Diagonal of a Spiral Matrix
Construct a precedence graph from a code segment
longest common substring : Skipped character version
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