Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Getting logical indexes
Add two numbers
Upper triangular matrix
length of a vector
Average speed for the entire trip
birthday on same day of week
self description 2.0
Graph Algorithms - 1 : Length of the largest closed path
BLOCK x3 (Version 2)
Mongean Shuffle : 2
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