gephi.team team mailing list archive

[Sébastien Heymann <sebastien.heymann@xxxxxxxxx>]

Sébastien Heymann has proposed merging lp:~daniel-bernardes/gephi/gephi-0.8a-PajekExportPlugin into lp:gephi.

Requested reviews:
  Gephi Team (gephi.team)

For more details, see:
https://code.launchpad.net/~daniel-bernardes/gephi/gephi-0.8a-PajekExportPlugin/+merge/62498

Add Pajek exporter.
-- 
https://code.launchpad.net/~daniel-bernardes/gephi/gephi-0.8a-PajekExportPlugin/+merge/62498
Your team Gephi Team is requested to review the proposed merge of lp:~daniel-bernardes/gephi/gephi-0.8a-PajekExportPlugin into lp:gephi.

=== added file 'ExportPlugin/src/org/gephi/io/exporter/plugin/ExporterBuilderPajek.java'
--- ExportPlugin/src/org/gephi/io/exporter/plugin/ExporterBuilderPajek.java	1970-01-01 00:00:00 +0000
+++ ExportPlugin/src/org/gephi/io/exporter/plugin/ExporterBuilderPajek.java	2011-05-26 15:09:20 +0000
@@ -0,0 +1,48 @@
+/*
+Copyright 2008-2010 Gephi
+Authors : Mathieu Bastian <mathieu.bastian@xxxxxxxxx>
+Website : http://www.gephi.org
+
+This file is part of Gephi.
+
+Gephi is free software: you can redistribute it and/or modify
+it under the terms of the GNU Affero General Public License as
+published by the Free Software Foundation, either version 3 of the
+License, or (at your option) any later version.
+
+Gephi 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 Affero General Public License for more details.
+
+You should have received a copy of the GNU Affero General Public License
+along with Gephi.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package org.gephi.io.exporter.plugin;
+
+import org.gephi.io.exporter.api.FileType;
+import org.gephi.io.exporter.spi.GraphExporter;
+import org.gephi.io.exporter.spi.GraphFileExporterBuilder;
+import org.openide.util.NbBundle;
+import org.openide.util.lookup.ServiceProvider;
+
+/**
+ *
+ * @author danielb
+ */
+@ServiceProvider(service = GraphFileExporterBuilder.class)
+public class ExporterBuilderPajek implements GraphFileExporterBuilder {
+
+    public GraphExporter buildExporter() {
+        return new ExporterPajek();
+    }
+
+    public FileType[] getFileTypes() {
+        FileType ft = new FileType(".net", "Pajek files");
+        return new FileType[]{ft};
+    }
+
+    public String getName() {
+        return "NET";
+    }
+}

=== added file 'ExportPlugin/src/org/gephi/io/exporter/plugin/ExporterPajek.java'
--- ExportPlugin/src/org/gephi/io/exporter/plugin/ExporterPajek.java	1970-01-01 00:00:00 +0000
+++ ExportPlugin/src/org/gephi/io/exporter/plugin/ExporterPajek.java	2011-05-26 15:09:20 +0000
@@ -0,0 +1,144 @@
+/*
+Copyright 2008-2010 Gephi
+Authors : Mathieu Bastian <mathieu.bastian@xxxxxxxxx>
+Website : http://www.gephi.org
+
+This file is part of Gephi.
+
+Gephi is free software: you can redistribute it and/or modify
+it under the terms of the GNU Affero General Public License as
+published by the Free Software Foundation, either version 3 of the
+License, or (at your option) any later version.
+
+Gephi 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 Affero General Public License for more details.
+
+You should have received a copy of the GNU Affero General Public License
+along with Gephi.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package org.gephi.io.exporter.plugin;
+
+import java.io.Writer;
+import java.util.HashMap;
+import org.gephi.graph.api.Edge;
+import org.gephi.graph.api.GraphModel;
+import org.gephi.graph.api.HierarchicalGraph;
+import org.gephi.graph.api.Node;
+import org.gephi.graph.api.UndirectedGraph;
+import org.gephi.io.exporter.spi.CharacterExporter;
+import org.gephi.io.exporter.spi.GraphExporter;
+import org.gephi.project.api.Workspace;
+import org.gephi.utils.longtask.spi.LongTask;
+import org.gephi.utils.progress.Progress;
+import org.gephi.utils.progress.ProgressTicket;
+
+/**
+ *
+ * @author danielb
+ */
+public class ExporterPajek implements GraphExporter, CharacterExporter, LongTask {
+
+    // Options
+    private boolean nodeCoords = true;
+    private boolean edgeWeight = true;
+    // Architecture
+    private Workspace workspace;
+    private Writer writer;
+    private boolean exportVisible;
+    private boolean cancel = false;
+    private ProgressTicket progressTicket;
+
+    public boolean cancel() {
+        cancel = true;
+        return true;
+    }
+
+    public void setProgressTicket(ProgressTicket progressTicket) {
+        this.progressTicket = progressTicket;
+    }
+
+    public boolean isExportVisible() {
+        return exportVisible;
+    }
+
+    public void setExportVisible(boolean exportVisible) {
+        this.exportVisible = exportVisible;
+    }
+
+    public void setWriter(Writer writer) {
+        this.writer = writer;
+    }
+
+    public Workspace getWorkspace() {
+        return workspace;
+    }
+
+    public void setWorkspace(Workspace workspace) {
+        this.workspace = workspace;
+    }
+
+    public boolean execute() {
+        GraphModel graphModel = workspace.getLookup().lookup(GraphModel.class);
+        HierarchicalGraph graph = null;
+        if (exportVisible) {
+            graph = graphModel.getHierarchicalGraphVisible();
+        } else {
+            graph = graphModel.getHierarchicalGraph();
+        }
+        try {
+            exportData(graph);
+        } catch (Exception e) {
+            throw new RuntimeException(e);
+        }
+
+        return !cancel;
+    }
+
+    private void exportData(HierarchicalGraph graph) throws Exception {
+        int max = graph.getNodeCount(), i=1;
+        HashMap<String, Integer> idx = new HashMap<String, Integer>(3*max/2+1);
+
+        Progress.start(progressTicket, max);
+        graph.readLock();
+
+        writer.append("*Vertices " + max + "\n");
+
+        for (Node node : graph.getNodes()) {
+            writer.append(Integer.toString(i));
+            writer.append(" \"" + node.getNodeData().getLabel() + "\"");
+            if(nodeCoords) {
+                writer.append(" "+node.getNodeData().x()+" "+node.getNodeData().y()+" "+node.getNodeData().z());
+            }
+            writer.append("\n");
+            idx.put(node.getNodeData().getId(), i++); // assigns Ids from the interval [1..max]
+        }
+
+        if (graph instanceof UndirectedGraph) {
+            writer.append("*Edges\n");
+        } else {
+            writer.append("*Arcs\n");
+        }
+
+        for (Edge edge : graph.getEdgesAndMetaEdges()) {
+            if (cancel) {
+                break;
+            }
+            if (edge != null) {
+                writer.append(Integer.toString(idx.get(edge.getSource().getNodeData().getId())) + " ");
+                writer.append(Integer.toString(idx.get(edge.getTarget().getNodeData().getId())));
+                if (edgeWeight) {
+                    writer.append(" " + edge.getWeight());
+                }
+                writer.append("\n");
+            }
+
+            Progress.progress(progressTicket);
+        }
+
+        graph.readUnlockAll();
+
+        Progress.finish(progressTicket);
+    }
+}