visualization/plugins/org.eclipse.pde.visualization.dependency/src/org/eclipse/pde/visualization/dependency/views/ShortestPathDependencyAnalysis.java

/*******************************************************************************
 * Copyright 2005-2006, CHISEL Group, University of Victoria, Victoria, BC,
 * Canada. All rights reserved. This program and the accompanying materials are
 * made available under the terms of the Eclipse Public License v1.0 which
 * accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 * 
 * Contributors: The Chisel Group, University of Victoria IBM CAS, IBM Toronto
 * Lab
 ******************************************************************************/
package org.eclipse.pde.visualization.dependency.views;

import java.util.Arrays;
import java.util.HashSet;

import org.eclipse.zest.core.viewers.EntityConnectionData;
import org.eclipse.zest.core.viewers.GraphViewer;

/**
 * 
 * @author Ian Bull
 */
public class ShortestPathDependencyAnalysis extends AbstractVisualizationLabelProvider {

	public ShortestPathDependencyAnalysis(GraphViewer viewer, AbstractVisualizationLabelProvider currentLabelProvider) {
		super(viewer,currentLabelProvider );
	}

	protected void calculateInterestingDependencies(HashSet interestingRels, HashSet interestingEntities) {

		if (this.getSelected() != null) {
			Object[] descriptions = AnalysisUtil.getPath(this.rootNode, this.getSelected());

			for (int i = 0; i < descriptions.length; i++) {
				for (int j = 0; j < descriptions.length; j++) {
					EntityConnectionData entityConnectionData = new EntityConnectionData(descriptions[i], descriptions[j]);
					interestingRels.add(entityConnectionData);
				}
			}
			interestingEntities.addAll(Arrays.asList(descriptions));
		}
	}

}