/*
Copyright 2008-2010 Gephi
Authors : Mathieu Bastian <mathieu.bastian@gephi.org>
Website : http://www.gephi.org
This file is part of Gephi.
DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
Copyright 2011 Gephi Consortium. All rights reserved.
The contents of this file are subject to the terms of either the GNU
General Public License Version 3 only ("GPL") or the Common
Development and Distribution License("CDDL") (collectively, the
"License"). You may not use this file except in compliance with the
License. You can obtain a copy of the License at
http://gephi.org/about/legal/license-notice/
or /cddl-1.0.txt and /gpl-3.0.txt. See the License for the
specific language governing permissions and limitations under the
License. When distributing the software, include this License Header
Notice in each file and include the License files at
/cddl-1.0.txt and /gpl-3.0.txt. If applicable, add the following below the
License Header, with the fields enclosed by brackets [] replaced by
your own identifying information:
"Portions Copyrighted [year] [name of copyright owner]"
If you wish your version of this file to be governed by only the CDDL
or only the GPL Version 3, indicate your decision by adding
"[Contributor] elects to include this software in this distribution
under the [CDDL or GPL Version 3] license." If you do not indicate a
single choice of license, a recipient has the option to distribute
your version of this file under either the CDDL, the GPL Version 3 or
to extend the choice of license to its licensees as provided above.
However, if you add GPL Version 3 code and therefore, elected the GPL
Version 3 license, then the option applies only if the new code is
made subject to such option by the copyright holder.
Contributor(s):
Portions Copyrighted 2011 Gephi Consortium.
*/
package org.gephi.graph.dhns.filter;
import java.util.HashMap;
import java.util.Map;
import org.gephi.graph.api.Edge;
import org.gephi.graph.api.Graph;
import org.gephi.graph.api.GraphView;
import org.gephi.graph.api.HierarchicalGraph;
import org.gephi.graph.api.Node;
import org.gephi.graph.dhns.DhnsGraphController;
import org.gephi.graph.dhns.core.Dhns;
import org.gephi.graph.dhns.core.GraphFactoryImpl;
import org.gephi.graph.dhns.core.GraphViewImpl;
import org.gephi.graph.dhns.core.TreeStructure;
import org.gephi.graph.dhns.edge.AbstractEdge;
import org.gephi.graph.dhns.graph.HierarchicalDirectedGraphImpl;
import org.gephi.graph.dhns.node.AbstractNode;
import org.gephi.graph.dhns.node.iterators.TreeListIterator;
import org.junit.AfterClass;
import org.junit.Before;
import org.junit.BeforeClass;
import org.junit.Test;
import static org.junit.Assert.*;
import org.openide.util.Exceptions;
public class DhnsTestFiltering {
private Dhns dhnsGlobal;
private HierarchicalGraph graphGlobal;
private Map<String, Node> nodeMap;
private Map<String, Edge> edgeMap;
@BeforeClass
public static void setUpClass() throws Exception {
}
@AfterClass
public static void tearDownClass() throws Exception {
}
@Before
public void setUp() {
DhnsGraphController controller = new DhnsGraphController();
dhnsGlobal = new Dhns(controller, null);
graphGlobal = new HierarchicalDirectedGraphImpl(dhnsGlobal, dhnsGlobal.getGraphStructure().getMainView());
nodeMap = new HashMap<String, Node>();
edgeMap = new HashMap<String, Edge>();
TreeStructure treeStructure = dhnsGlobal.getGraphStructure().getMainView().getStructure();
GraphFactoryImpl factory = dhnsGlobal.factory();
//Nodes
//System.out.println("-----Global-----");
for (int i = 0; i < 10; i++) {
Node node = factory.newNode();
node.getNodeData().setLabel("Node " + i);
graphGlobal.addNode(node);
nodeMap.put(node.getNodeData().getLabel(), node);
//System.out.println("Node " + i + " added. Id = " + node.getId());
}
//System.out.println("---End Global---");
//Edges
Node node0 = nodeMap.get("Node 0");
Node node1 = nodeMap.get("Node 1");
Node node2 = nodeMap.get("Node 2");
Node node3 = nodeMap.get("Node 3");
Node node4 = nodeMap.get("Node 4");
Node node5 = nodeMap.get("Node 5");
Node node6 = nodeMap.get("Node 6");
Node node7 = nodeMap.get("Node 7");
Node node8 = nodeMap.get("Node 8");
AbstractEdge edge1 = factory.newEdge("4-5", node4, node5, 1f, true);
AbstractEdge edge2 = factory.newEdge("5-6", node5, node6, 4f, true);
AbstractEdge edge3 = factory.newEdge("6-5", node6, node5, 3f, true);
AbstractEdge edge4 = factory.newEdge("7-7", node7, node7, 5f, true);
AbstractEdge edge5 = factory.newEdge("4-4", node4, node4, 2f, true);
AbstractEdge edge6 = factory.newEdge("2-1", node2, node1, 1f, true);
AbstractEdge edge7 = factory.newEdge("2-3", node2, node3, 10f, true);
AbstractEdge edge8 = factory.newEdge("2-5", node2, node5, 12f, true);
graphGlobal.addEdge(edge1);
graphGlobal.addEdge(edge2);
graphGlobal.addEdge(edge3);
graphGlobal.addEdge(edge4);
graphGlobal.addEdge(edge5);
graphGlobal.addEdge(edge6);
graphGlobal.addEdge(edge7);
graphGlobal.addEdge(edge8);
edgeMap.put("4-5", edge1);
edgeMap.put("5-6", edge2);
edgeMap.put("6-5", edge3);
edgeMap.put("7-7", edge4);
edgeMap.put("4-4", edge5);
edgeMap.put("2-1", edge6);
edgeMap.put("2-3", edge7);
edgeMap.put("2-5", edge8);
}
@Test
public void testSetUp() {
Node[] expected = new Node[10];
for (int i = 0; i < nodeMap.size(); i++) {
expected[i] = nodeMap.get("Node " + i);
}
Node[] actual = graphGlobal.getNodes().toArray();
assertArrayEquals(expected, actual);
}
@Test
public void testNewView() {
// dhnsGlobal.getGraphStructure().getMainView().getStructure().showTreeAsTable();
GraphViewImpl view = dhnsGlobal.getGraphStructure().getNewView();
// view.getStructure().showTreeAsTable();
for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
AbstractNode node = itr.next();
assertEquals(view.getViewId(), node.getViewId());
AbstractNode mainNode = node.getInView(0);
assertNotNull(mainNode);
assertNotSame(node, mainNode);
assertSame(node.getNodeData(), mainNode.getNodeData());
if (mainNode.parent != null) {
assertNotNull(node.parent);
assertEquals(node.parent.getViewId(), view.getViewId());
}
}
for (TreeListIterator itr = new TreeListIterator(view.getStructure().getTree(), 1); itr.hasNext();) {
AbstractNode node = itr.next();
AbstractNode mainNode = node.getInView(0);
assertEquals(node.getEdgesInTree().getCount(), mainNode.getEdgesInTree().getCount());
assertEquals(node.getEdgesOutTree().getCount(), mainNode.getEdgesOutTree().getCount());
for (AbstractEdge edge : node.getEdgesInTree()) {
assertSame(edge, mainNode.getEdgesInTree().getItem(edge.getSource().getNumber()));
}
}
}
@Test
public void testFlatten() {
Node[] nodeGroup = new Node[]{nodeMap.get("Node 1"), nodeMap.get("Node 2")};
graphGlobal.groupNodes(nodeGroup);
GraphView newView = dhnsGlobal.newView();
HierarchicalGraph viewGraph = dhnsGlobal.getHierarchicalGraph(newView);
viewGraph.resetViewToTopNodes();
viewGraph.flatten();
dhnsGlobal.destroyView(newView);
viewGraph = null;
newView = null;
System.gc();
try {
Thread.sleep(2000);
} catch (InterruptedException ex) {
Exceptions.printStackTrace(ex);
}
}
@Test
public void testDelete() {
Node node1 = nodeMap.get("Node 1");
Node node2 = nodeMap.get("Node 2");
Edge edge21 = edgeMap.get("2-1");
GraphView newView = dhnsGlobal.newView();
HierarchicalGraph viewGraph = dhnsGlobal.getHierarchicalGraph(newView);
assertNotNull(node1.getNodeData().getNode(newView.getViewId()));
assertNotNull(dhnsGlobal.getGraphStructure().getNodeFromDictionnary(node1.getId(), newView.getViewId()));
assertNotNull(dhnsGlobal.getGraphStructure().getNodeFromDictionnary(node1.getId(), graphGlobal.getView().getViewId()));
assertNotNull(dhnsGlobal.getGraphStructure().getEdgeFromDictionnary(edge21.getId()));
graphGlobal.removeNode(node1);
assertNull(node1.getNodeData().getNode(graphGlobal.getView().getViewId()));
assertNull(node1.getNodeData().getNode(newView.getViewId()));
assertEquals(Boolean.FALSE, graphGlobal.contains(node1));
assertEquals(Boolean.FALSE, viewGraph.contains(node1));
assertEquals(Boolean.FALSE, graphGlobal.contains(edge21));
assertEquals(Boolean.FALSE, viewGraph.contains(edge21));
}
// private void showEdges(TreeStructure treeStructure) {
// ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
// for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
// AbstractNode node = itr.next();
// System.out.print("Node " + node.getId() + " OUT : ");
// for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
// AbstractEdge edge = edgeIterator.next();
// System.out.print(edge.getTarget().getId() + " / ");
// }
// System.out.println();
// System.out.print("Node " + node.getId() + " IN : ");
// for (edgeIterator.setNode(node.getEdgesInTree()); edgeIterator.hasNext();) {
// AbstractEdge edge = edgeIterator.next();
// System.out.print(edge.getSource().getId() + " / ");
// }
// System.out.println();
// }
// }
// @Test
// public void testFiltering() {
// dhnsGlobal.getGraphStructure().getStructure().showTreeAsTable();
// graphGlobal.getView().addPredicate(new DegreePredicate(3, 5));
// Node[] actual = graphGlobal.getNodes().toArray();
// for (int i = 0; i < actual.length; i++) {
// System.out.println(actual[i].getId());
// }
// ((ViewImpl) graphGlobal.getView()).getGraphStructure().getStructure().showTreeAsTable();
// }
// @Test
// public void testGrouping() {
// //graphGlobal.getView().addPredicate(new DegreePredicate(3, 5));
// graphGlobal.groupNodes(new Node[]{nodeMap.get("Node 1"), nodeMap.get("Node 2")});
// dhnsGlobal.getGraphStructure().getMainView().getStructure().showTreeAsTable();
// Node[] actual = graphGlobal.getNodes().toArray();
// for (int i = 0; i < actual.length; i++) {
// System.out.println(actual[i].getId());
// }
// System.out.println("edges");
// Edge[] actual2 = graphGlobal.getEdges().toArray();
// for (int i = 0; i < actual2.length; i++) {
// System.out.println(actual2[i].getSource().getNodeData().getLabel() + "->" + actual2[i].getTarget().getNodeData().getLabel());
// }
// }
// @Test
// public void testMetaEdgesProcessing() {
// Dhns dhns = new Dhns(new DhnsGraphController());
// GraphStructure graphStructure = dhns.getGraphStructure();
// TreeStructure treeStructure = graphStructure.getStructure();
// GraphFactoryImpl factoryImpl = new GraphFactoryImpl(new IDGen(), null);
// EdgeProcessor edgeProcessor = new EdgeProcessor(dhns);
//
// AbstractNode n1 = factoryImpl.newNode();
// AbstractNode n2 = factoryImpl.newNode();
// AbstractNode n3 = factoryImpl.newNode();
// AbstractNode n4 = factoryImpl.newNode();
// AbstractNode n5 = factoryImpl.newNode();
// AbstractNode n6 = factoryImpl.newNode();
//
// treeStructure.insertAsChild(n1, treeStructure.getRoot());
// treeStructure.insertAsChild(n4, treeStructure.getRoot());
// treeStructure.insertAsChild(n2, n1);
// treeStructure.insertAsChild(n3, n1);
// treeStructure.insertAsChild(n5, n4);
// treeStructure.insertAsChild(n6, n4);
//
// AbstractEdge e23 = factoryImpl.newEdge(n2, n3);
// AbstractEdge e25 = factoryImpl.newEdge(n2, n5);
// AbstractEdge e52 = factoryImpl.newEdge(n5, n2);
// AbstractEdge e53 = factoryImpl.newEdge(n5, n3);
// AbstractEdge e65 = factoryImpl.newEdge(n6, n5);
//
// n2.getEdgesOutTree().add(e23);
// n3.getEdgesInTree().add(e23);
// n2.getEdgesOutTree().add(e25);
// n5.getEdgesInTree().add(e25);
// n5.getEdgesOutTree().add(e52);
// n2.getEdgesInTree().add(e52);
// n5.getEdgesOutTree().add(e53);
// n3.getEdgesInTree().add(e53);
// n6.getEdgesOutTree().add(e65);
// n5.getEdgesInTree().add(e65);
//
// n1.setEnabled(true);
// n4.setEnabled(true);
//
// edgeProcessor.computeMetaEdges(graphStructure);
//
// HierarchicalDirectedGraphImpl graph = new HierarchicalDirectedGraphImpl(dhns, graphStructure);
// Edge[] actual = graph.getMetaEdges().toArray();
// assertEquals(2, actual.length);
// MetaEdgeImpl metaEdge14 = (MetaEdgeImpl)actual[0];
// MetaEdgeImpl metaEdge41 = (MetaEdgeImpl)actual[1];
// assertSame(n1, metaEdge14.getSource());
// assertSame(n4, metaEdge14.getTarget());
// assertEquals(1f, metaEdge14.getWeight(),0);
// assertSame(n4, metaEdge41.getSource());
// assertSame(n1, metaEdge41.getTarget());
// assertEquals(2f, metaEdge41.getWeight(),0);
// edgeProcessor.clearAllMetaEdges();
//
// n1.setEnabled(false);
// n3.setEnabled(true);
//
// edgeProcessor.computeMetaEdges(graphStructure);
//
// actual = graph.getMetaEdges().toArray();
// assertEquals(1, actual.length);
// MetaEdgeImpl metaEdge43 = (MetaEdgeImpl)actual[0];
// assertSame(n4, metaEdge43.getSource());
// assertSame(n3, metaEdge43.getTarget());
// edgeProcessor.clearAllMetaEdges();
//
// n4.setEnabled(false);
// n5.setEnabled(true);
//
// edgeProcessor.computeMetaEdges(graphStructure);
//
// actual = graph.getMetaEdges().toArray();
// assertEquals(0, actual.length);
//
// treeStructure.showTreeAsTable();
// }
}