package no.uis.ux.cipsi.net.monitoringbalancing.app.algorithm;

import mulavito.algorithms.shortestpath.ksp.Yen;

import org.apache.commons.collections15.Transformer;

import edu.uci.ics.jung.graph.Graph;

public class YenNoCache<V, E> extends Yen<V, E>{

    public YenNoCache(Graph<V, E> graph,
            Transformer<E, Number> nev) {
        super(graph, nev);
        dijkstra.enableCaching(false);
        dijkstra.setMaxTargets(8);
        //        dijkstra.setMaxDistance(8);
    }

}

@@ -398,16 +398,18 @@
 false);%0A
+//
         
@@ -439,18 +439,8 @@
 8);%0A
-        //
     
@@ -477,11 +477,77 @@
 ;%0A    %7D%0A
+    %0A    public Graph%3CV,E%3E getGraph() %7B%0A    %09return graph;%0A%09%7D%0A    
 %0A%7D%0A

add a helper method to get the graph from the provided algorithm