We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I really like your solution! Simple and clever. One odd thing for me is that you used an array of vectors instead of a vector of vectors. Another is that you allocated the array on the heap.
BFS: Shortest Reach in a Graph
You are viewing a single comment's thread. Return to all comments →
I really like your solution! Simple and clever. One odd thing for me is that you used an array of vectors instead of a vector of vectors. Another is that you allocated the array on the heap.