Given an adjacency matrix of a simple undirected graph, find the number of connected components.
Encode Roman Numerals
Connect Four Win Checker
Get the length of a given vector
find radius of cone
Create incrementing array
Graph Algorithms - 1 : Length of the largest closed path
birthday on same day of week
Graph Algorithms - 2 : Chromatic Number
Yet Another Path Finder
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