Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Indexed Probability Table
Find nearest prime number less than input number
Append two matrix as shown below example
Compute LOG(1+X) in natural log
Fermat's last theorem - again
Construct a precedence graph from a code segment
Graph Algorithms - 1 : Length of the largest closed path
Generate this matrix
Beauty of Parentheses
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