Adjacency matrix of an undirected graph is given. Return the number of connected components in the graph.
Test case 2 matrix is not symmetrical. Can't be the adjacency matrix of an undirected graph.
yes.. fixed it
Vectorizing, too easy or too hard?
"Low : High - Low : High - Turn around " -- Create a subindices vector
Getting the indices from a matrice
Simple date to serial no. conversion
Yet Another Path Finder
possible ways through matrix
Largest Geometric Series
birthday on same day of week
Text Processing - New
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