Index: applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/connectedness/DiGraphSealer.java
===================================================================
--- applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/connectedness/DiGraphSealer.java	(revision 29595)
+++ applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/connectedness/DiGraphSealer.java	(revision 29854)
@@ -1,6 +1,6 @@
 package org.openstreetmap.josm.plugins.JunctionChecker.connectedness;
 
-import java.util.ArrayList;
 import java.util.Vector;
+
 import org.openstreetmap.josm.plugins.JunctionChecker.datastructure.Channel;
 import org.openstreetmap.josm.plugins.JunctionChecker.datastructure.ChannelDiGraph;
@@ -45,5 +45,4 @@
 			}
 		}
-		int counter = 0;
 		Channel tempChannel;
 		LeadsTo tempLeadsTo;
@@ -73,5 +72,4 @@
 				newID++;
 				digraph.addChannel(tempChannel);
-				counter++;
 			}
 		}
@@ -103,5 +101,4 @@
 				newID++;
 				digraph.addChannel(tempChannel);
-				counter++;
 			}
 		}
@@ -125,5 +122,4 @@
 	 */
 	private void deleteDuplicateChannels() {
-		ArrayList<Integer> pointer = new ArrayList<Integer>();
 
 		for (int i = 0; i < digraph.getChannels().size(); i++) {
@@ -136,5 +132,4 @@
 				}
 			}
-
 		}
 	}
Index: applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/PseudoChannelRemover.java
===================================================================
--- applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/PseudoChannelRemover.java	(revision 29595)
+++ applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/PseudoChannelRemover.java	(revision 29854)
@@ -13,8 +13,6 @@
 
 	private final ChannelDiGraph digraph;
-	private final ArrayList<Channel> pseudochannels = new ArrayList<Channel>();
-	private int c = 0;
+	//private final ArrayList<Channel> pseudochannels = new ArrayList<Channel>();
 	private Channel succChannel;
-	private String s;
 	private Channel tempToChannel;
 	private LeadsTo tempLeadsTo;
@@ -27,5 +25,4 @@
 		succChannel = tempchannel.getLeadsTo().get(0).getToChannel();
 		tempchannel.setToNode(succChannel.getToNode());
-		s = "";
 		//log.trace("---Folgender Channel ist überflüssig: " + succChannel.getNewid() + "---");
 		//log.trace("... und wird durch diesen ersetzt: " + tempchannel.getNewid());
@@ -57,5 +54,4 @@
 		digraph.removeChannel(succChannel);
 		//pseudochannels.add(tempchannel.getSuccChannels().get(0));
-		c++;
 	}
 
Index: applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/TurnRestrictionChecker.java
===================================================================
--- applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/TurnRestrictionChecker.java	(revision 29595)
+++ applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/converting/TurnRestrictionChecker.java	(revision 29854)
@@ -20,5 +20,4 @@
 	private final ArrayList<OSMRelation> turnrestrictionsrelations = new ArrayList<OSMRelation>();
 	private final ChannelDiGraph channelDigraph;
-	private final boolean isInturnrestriction;
 	private int relationpointer;
 	private LeadsTo tempLeadsTo;
@@ -35,5 +34,4 @@
 		}
 		this.channelDigraph = channelDigraph;
-		this.isInturnrestriction = false;
 	}
 
Index: applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/datastructure/OSMRelation.java
===================================================================
--- applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/datastructure/OSMRelation.java	(revision 29595)
+++ applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/datastructure/OSMRelation.java	(revision 29854)
@@ -64,5 +64,5 @@
 		}
 		
-		public Class getType() {
+		public Class<? extends OSMEntity> getType() {
 			return member.getClass();
 		}
Index: applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/BackPropagation.java
===================================================================
--- applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/BackPropagation.java	(revision 29595)
+++ applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/BackPropagation.java	(revision 29854)
@@ -11,6 +11,4 @@
 public class BackPropagation {
 
-	private Channel y;
-	private Channel z;
 	private final ChannelDiGraph digraph;
 
@@ -25,6 +23,4 @@
 	 */
 	public void backPropagation(Channel y, Channel z, Channel zstrich) {
-		this.y = y;
-		this.z = z;
 		for (int i = 0; i < z.getReachableNodes().size(); i++) {
 			y.addReachableNode(z.getReachableNodeAt(i));
Index: applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/JMinimality.java
===================================================================
--- applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/JMinimality.java	(revision 29595)
+++ applications/editors/josm/plugins/junctionchecking/src/org/openstreetmap/josm/plugins/JunctionChecker/junctionchecking/JMinimality.java	(revision 29854)
@@ -30,8 +30,6 @@
 	private long EEovern = 0;
 	private final HashSet<Channel> subgraph = new HashSet<Channel>();//The candidate subgraph to be tested
-	private double durchlauf = 1;
 	private ProgressMonitor pm;
 	private final boolean pmenabled;
-	private final ArrayList<Integer> anzahlchannels = new ArrayList<Integer>();
 	private final ArrayList<HashSet<Channel>> junctions = new ArrayList<HashSet<Channel>>();
 	private final boolean searchFirstJunction;
@@ -85,5 +83,5 @@
 
 		Combination c = new Combination(Grid.length, n);
-		EEovern = (int) c.Choose(Grid.length*Grid.length, n*n);
+		EEovern = (int) Combination.Choose(Grid.length*Grid.length, n*n);
 		long ans = c.Choose(); //This is the number of subcolumns to be generated
 		int[][] v; // this is a column variable containing n y-index entries plus true false values (0/1)
@@ -135,5 +133,4 @@
 		ArrayList<int[]> CandidateK = new ArrayList<int[]>(n*n); //saves the candidate K_{n-1} in entry-exit pairs
 		long lindex= 0;
-		int countk = 0;
 		int h = 0;
 		int m = 0;
@@ -188,7 +185,5 @@
 					}
 					if (missing <=1 && smallerjunction == true){//The k-subgrid is a different junction candidate satisfying total reachability
-						countk++;
 						CheckMinimal = CheckSmallJunction(CandidateK)==false;// If the candidate is a smaller junction, then minimality is false
-						durchlauf++;
 						//log.info("durchlauf: " + durchlauf + " Wert von CheckMinimal: " + CheckMinimal);
 						if (!CheckMinimal) {