Disconnected subgraph analysis for district network diagrams

[simantics/district.git] / org.simantics.district.network.ui / src / org / simantics / district / network / ui / breakdown / Input.java

diff --git a/org.simantics.district.network.ui/src/org/simantics/district/network/ui/breakdown/Input.java b/org.simantics.district.network.ui/src/org/simantics/district/network/ui/breakdown/Input.java
new file mode 100644 (file)
index 0000000..dd80c2a
--- /dev/null
+++ b/org.simantics.district.network.ui/src/org/simantics/district/network/ui/breakdown/Input.java
@@ -0,0 +1,43 @@
+package org.simantics.district.network.ui.breakdown;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.simantics.databoard.util.Bean;
+import org.simantics.db.Resource;
+
+/**
+ * @author Tuukka Lehtonen
+ * @since 1.35.0
+ */
+public class Input {
+
+    public static class NetworkDiagrams extends Bean {
+        public List<NetworkDiagram> diagrams = new ArrayList<>();
+    }
+
+    public static class NetworkDiagram extends Bean {
+        public String name;
+        public Resource diagram;
+
+        public NetworkDiagram(String name, Resource diagram) {
+            this.name = name;
+            this.diagram = diagram;
+        }
+    }
+
+    public static class Subgraph {
+        public NetworkDiagram parent;
+        public int index;
+        public List<Resource> vertices;
+        public List<Resource> edges;
+
+        public Subgraph(NetworkDiagram parent, int index, List<Resource> vertices, List<Resource> edges) {
+            this.parent = parent;
+            this.index = index;
+            this.vertices = vertices;
+            this.edges = edges;
+        }
+    }
+
+}