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.
Sum all integers from 1 to 2^n
Project Euler: Problem 3, Largest prime factor
Arrange vector in ascending order
Write c^3 as sum of two squares a^2+b^2
I Plead the Fifth
Project Euler: Problem 16, Sums of Digits of Powers of Two
Next Higher Power of B
Recurring Cycle Length (Inspired by Project Euler Problem 26)
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
Determine if a Given Number is a Triangle Number
Find the treasures in MATLAB Central and discover how the community can help you!
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