IPAM appears to be housed within the UCLA Foundation. It does not have a separate EIN.

I think the link should be giving.ucla.edu/Campaign

Once nice property is that if a user is interested only in a specific destination node, [s]he can just cut short iterating upon reaching that node! The min cost would be returned in a silver plater; or so to speak.

I just realized that Dijkstra’s algorithm is simply one type of graph search strategy, like BFS or DFS. To explore this idea, I rewrote it so that the graph is traversed using an iterator (while still following Dijkstra’s algorithm):

github.com/hansonchar/p...

github.com/hansonchar/p...