edu.cmu.tetradapp.workbench.DistanceFromSelected Maven / Gradle / Ivy
///////////////////////////////////////////////////////////////////////////////
// For information as to what this class does, see the Javadoc, below. //
// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, //
// 2007, 2008, 2009, 2010, 2014, 2015, 2022 by Peter Spirtes, Richard //
// Scheines, Joseph Ramsey, and Clark Glymour. //
// //
// This program is free software; you can redistribute it and/or modify //
// it under the terms of the GNU General Public License as published by //
// the Free Software Foundation; either version 2 of the License, or //
// (at your option) any later version. //
// //
// This program is distributed in the hope that it will be useful, //
// but WITHOUT ANY WARRANTY; without even the implied warranty of //
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //
// GNU General Public License for more details. //
// //
// You should have received a copy of the GNU General Public License //
// along with this program; if not, write to the Free Software //
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA //
///////////////////////////////////////////////////////////////////////////////
package edu.cmu.tetradapp.workbench;
import edu.cmu.tetrad.graph.Graph;
import edu.cmu.tetrad.graph.LayoutUtil;
import edu.cmu.tetrad.graph.Node;
import edu.cmu.tetradapp.util.LayoutEditable;
import javax.swing.*;
import java.awt.*;
import java.util.List;
import java.util.*;
/**
* Lays out a graph by placing springs between the nodes and letting the system settle (one node at a time).
*
* @author josephramsey
*/
final class DistanceFromSelected {
/**
* The graph being laid out.
*/
private final Graph graph;
/**
* The selected nodes.
*/
private final List selected;
/**
* Has information about nodes on screen.
*/
private final LayoutEditable layoutEditable;
//==============================CONSTRUCTORS===========================//
public DistanceFromSelected(LayoutEditable layoutEditable) {
this.graph = layoutEditable.getGraph();
List selected = new ArrayList<>();
for (Node node : this.graph.getNodes()) {
Map modelToDisplay = layoutEditable.getModelNodesToDisplay();
DisplayNode displayNode = (DisplayNode) modelToDisplay.get(node);
if (displayNode != null && displayNode.isSelected()) {
selected.add(node);
}
}
if (selected.isEmpty()) {
String names = JOptionPane.showInputDialog("Selected nodes (space delimited):");
List nodes = new ArrayList<>();
String[] _names = names.split(" ");
for (String name : _names) {
Node node = this.graph.getNode(name);
if (node != null) {
nodes.add(node);
}
}
if (nodes.isEmpty()) {
nodes.add(this.graph.getNodes().get(0));
}
selected = nodes;
}
this.selected = selected;
this.layoutEditable = layoutEditable;
}
//============================PUBLIC METHODS==========================//
public void doLayout() {
if (this.selected.isEmpty()) {
new LayoutUtil.FruchtermanReingoldLayout(this.graph).doLayout();
return;
}
List> tiers = placeInTiers(this.graph, this.selected);
int y = 0;
for (List tier : tiers) {
y += 60;
if (tier.isEmpty()) continue;
Node node = tier.get(0);
DisplayNode displayNode = (DisplayNode) this.layoutEditable.getModelNodesToDisplay().get(node);
Rectangle r = displayNode.getBounds();
int x = r.width / 2 + 10;
node.setCenterX(x);
node.setCenterY(y);
int lastHalf = r.width / 2;
for (int i = 1; i < tier.size(); i++) {
node = tier.get(i);
displayNode = (DisplayNode) this.layoutEditable.getModelNodesToDisplay().get(node);
r = displayNode.getBounds();
int thisHalf = r.width / 2;
x += lastHalf + thisHalf + 5;
node.setCenterX(x);
node.setCenterY(y);
lastHalf = thisHalf;
}
}
}
private List> placeInTiers(Graph graph, List selected) {
// We know selected is not empty.
List nodes = graph.getNodes();
List> tiers = new ArrayList<>();
tiers.add(selected);
Set all = new HashSet<>(selected);
while (true) {
List tier1 = tiers.get(tiers.size() - 1);
List tier2 = new ArrayList<>();
for (Node node : tier1) {
List adj = graph.getAdjacentNodes(node);
adj.removeAll(all);
tier2.addAll(adj);
all.addAll(adj);
}
if (tier2.isEmpty()) break;
tiers.add(tier2);
}
List remainder = new ArrayList<>(nodes);
remainder.removeAll(all);
tiers.add(new ArrayList<>(remainder));
return tiers;
}
//============================PRIVATE METHODS=========================//
private void placeNodes(Node node, Map tiers, Graph graph) {
if (tiers.containsKey(node)) {
return;
}
Set keySet = tiers.keySet();
List parents = graph.getParents(node);
parents.retainAll(keySet);
List children = graph.getChildren(node);
children.retainAll(keySet);
if (parents.isEmpty() && children.isEmpty()) {
tiers.put(node, 0);
} else if (parents.isEmpty()) {
int cMin = getCMin(children, tiers);
tiers.put(node, cMin - 1);
placeChildren(node, tiers, graph);
return;
} else {
int pMax = getPMax(parents, tiers);
int cMin = getCMin(children, tiers);
tiers.put(node, pMax + 1);
if (!children.isEmpty() && cMin < pMax + 2) {
int diff = (pMax + 2) - cMin;
List descendants =
graph.paths().getDescendants(Collections.singletonList(node));
descendants.retainAll(keySet);
descendants.remove(node);
for (Node descendant : descendants) {
Integer index = tiers.get(descendant);
tiers.put(descendant, index + diff);
}
}
}
placeChildren(node, tiers, graph);
}
private void placeChildren(Node node, Map tiers,
Graph graph) {
// Recurse.
List adj = graph.getAdjacentNodes(node);
for (Node _node : adj) {
placeNodes(_node, tiers, graph);
}
}
private int getPMax(List parents, Map tiers) {
int pMax = Integer.MIN_VALUE;
for (Node parent : parents) {
Integer index = tiers.get(parent);
if (index > pMax) {
pMax = index;
}
}
return pMax;
}
private int getCMin(List children, Map tiers) {
int cMin = Integer.MAX_VALUE;
for (Node child : children) {
Integer index = tiers.get(child);
if (index < cMin) {
cMin = index;
}
}
return cMin;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy