wow, this is the most amazing MATLAB BFS implementations i've ever seen, and you're doing it with 2 roots at once. I'm seriously impressed. also, using sparse to make the graph from the maze matrix is genius
i am no match for your usage of the "sparse" function. I really need to learn more about it.
Project Euler: Problem 6, Natural numbers, squares and sums.
Back to basics 3 - Temp Directory
Numbers with prime factors 2, 3 and 5.
Create a square matrix of multiples
Celsius to Kelvin
Return the first and last character of a string
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
Test if a Number is a Palindrome without using any String Operations
Clock Hand Angle 1
First N Perfect Squares
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