| commit | 2f686c5c5eacf0e7fee0f5a0f52a3575bc3d4bf3 | [log] [tgz] |
|---|---|---|
| author | Pavlin Radoslavov <pavlin@onlab.us> | Wed Feb 13 11:27:13 2013 -0800 |
| committer | Pavlin Radoslavov <pavlin@onlab.us> | Wed Feb 13 11:27:13 2013 -0800 |
| tree | 3296b4ad59c879ae0b79063b879e57fae1abc8f9 | |
| parent | d46b749aa744c621b122294a43c081e26cf7ce53 [diff] |
Add a fix to the Shortest-Path computation algorithm for the corner case when computing a path from/to the same DPID. In that case, we just return a list of "src" and "dest". NOTE: The return value will change in the future to return a single hop/entry instead of two. Currently, we need both entries to capture the source and destination ports.