TopologyLinkDataChangeHandler in the loopremover module uses NetworkGraphImpl to get the MST, and keeps the links up to date with the datastore.

On Mon, Nov 2, 2015 at 11:27 AM, Vivek S <viveka.s@...> wrote:

Who is the consumer of the services provided by class NetworkGraphImpl ? Which module or component would initiate the creation of the loop free graph and then use it to make forwarding decisions ?

On Mon, Nov 2, 2015 at 2:23 PM, Evan Zeller <evanrzeller@...> wrote:

Folks moved to other things and just never got around to hooking it up with l2switch-main I guess. I believe there's an addPath or similarly named somewhere in there that could leverage the Dijkstra implementation.

Missed l2switch-dev on last email, looping it back in.

On Mon, Nov 2, 2015 at 11:16 AM, Vivek S <viveka.s@...> wrote:

Hi Evan,

Thanks for the reply. The code for Dijkstra's algorithm is commented out in NetworkGraphImpl any reason for this ?

On Mon, Nov 2, 2015 at 1:37 PM, Evan Zeller <evanrzeller@...> wrote:

Hi Vivek,

NetworkGraphImpl is used to find the MST for blocking loops. You'll find the skeleton of path calculation in l2switch-main. You may be able to leverage the NetworkGraphImpl for that purpose. 

Evan

On Fri, Oct 30, 2015 at 10:19 PM, Vivek S <viveka.s@...> wrote:

Hi,

I am planning to incorporate my own algorithm into the opendaylight controller to find the path between two nodes and use it to install flows. My research so far has led me to the l2switch project and NetworkGraphImpl class. Is this where the path calculation takes place ? Who are it's clients ? Which other module or interface calls functions in this class ? Also, if I have to implement my own algorithm, then should I modify this class ? If yes, which function ? Kindly help.

--

Thank you,
Vivek S

_______________________________________________
L2switch-dev mailing list
L2switch-dev@...
https://lists.opendaylight.org/mailman/listinfo/l2switch-dev

--

Thank you,
Vivek S

--

Thank you,
Vivek S