From ac2b870dc61da76d6ad8505eeaf41a7b760ff008 Mon Sep 17 00:00:00 2001
From: Nipun Kumar <111305023+NipunRaj96@users.noreply.github.com>
Date: Mon, 28 Apr 2025 22:40:50 +0530
Subject: [PATCH 1/6] Added GraphX func for java users

---
 BlackboxDemo.class | Bin 0 -> 1544 bytes
 BlackboxDemo.java  | 177 +++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 177 insertions(+)
 create mode 100644 BlackboxDemo.class
 create mode 100644 BlackboxDemo.java

diff --git a/BlackboxDemo.class b/BlackboxDemo.class
new file mode 100644
index 0000000000000000000000000000000000000000..d9e15e4a58f59c4a3144c2cc2bdb15ce128e4ec5
GIT binary patch
literal 1544
zcmaJ>TW=dh6#gc@Z0s(?O`DnqS{6v@rVceF+!B`-;xw(nX#)-^NujW|hh!Uj*V<i2
z<b_v$0aAqo5(tS_;#M9U$&vU0Nbr-YezTi2HnF-Z&73*seCIy%&%^HD0Nz6_jUmJ|
z#C0T)6v*7Mwyb=^a@O-Vs&`~95J+CM9Xq%r5HlxNGz<$Qu6kB$BMl8{1v?@TH`gXt
z6yqr!Ph&(tv+DIL^>s<OSt^wj@F?kJ&u%qj8W|i@$Pon@Q;-t^$IWsiF6{3i>=`<q
zTd1Uw#kj&eE08wJVFU%`GmBF?PUCs1d2L69LRbnf;6)8D>6pNozN{+SejuAvcH7Kt
ztQ_WRyZI&0c7jUaNvl~<M$hUnG08-lwli=0)K!K{qpVs^#}r->$TqD_S#+J672LFg
z4N`t!Ie|~JRE;c$m84nQS*O`NUe$0x$7`4tI5xmF{k2pe4JI;X9ySpr{DzJ<@s>c!
z_E&7*4rD!wZfz6-Gb*}S1z#H&LlzfRz1|Tx^0?rU*~=>Bcl-FvcL+IEkD~H9-zTKI
z7-lqF70~AzR&BHDel;(fE`uq$b+&$_Y&-ILyIGaqvQ=%66K`5JQ#)ba8k8G5TXEZ7
zO)l6<`Dm}v^Qv0x<ecjUe!%%#l);8u_lL2>PN)u9PE8tLdT!IWU<9r)J!^<ze8jmb
z`G&)IjA>&ls@7#CS!NiIVbnKgrua{Ws1<?Hy~^(Mi5W@alQdSbrs0+<@}~k52iL`R
zw%kpbk9r+V#e!7}TyI<8Zf`616r=dBSx&tn{fV;cZnj&6!&T|w^Z}Q*TXKMUZ(XAc
zT<D#GJrhN%(Wr243hZ3TaimvlSiUcP4WA2~Ih50&P&Kd{r=P6K3m@gh+ql3%Qr{3q
zlrIg}YdoFeF1RPo?La&rAyDF~#K2vo@IF2uO;s_@ry@q~f4k6DV>?KdbMZvH13i~W
zhTASOtJ*Lnql(ICnUJRFc&?Wb(y0u8YAWe2va7iroLrpZ>AAmPOeH&bxr=i^2j}<B
zuXpiwcs|fR@Yg{>sr6az;8K_G>%NKq$>zGa63Py8p5-eDe8-%>=kxdjuiTG(Cw{^b
ze&)>mg4?(U2lw$ce#JNV4d3E-Jis6L7k{!YWnzc0i0j<P5ywqd?MAqM7_OCY{TQE7
No~G<JzCaZx9|1J9YhwTa

literal 0
HcmV?d00001

diff --git a/BlackboxDemo.java b/BlackboxDemo.java
new file mode 100644
index 0000000..fa4e7a2
--- /dev/null
+++ b/BlackboxDemo.java
@@ -0,0 +1,177 @@
+import java.util.*;
+
+// ✅ Triple class for 3D hashing (like tuple<int,int,int>)
+class Triple {
+    int a, b, c;
+
+    public Triple(int a, int b, int c) {
+        this.a = a;
+        this.b = b;
+        this.c = c;
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (!(o instanceof Triple)) return false;
+        Triple other = (Triple) o;
+        return a == other.a && b == other.b && c == other.c;
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(a, b, c);
+    }
+}
+
+// ✅ Hash class to convert tuples to unique ints
+class Hash {
+    Map<Triple, Integer> hashTable = new HashMap<>();
+    int counter = 0;
+
+    int hash(int x) {
+        return hash(new Triple(x, 0, 0));
+    }
+
+    int hash(int x, int y) {
+        return hash(new Triple(x, y, 0));
+    }
+
+    int hash(int x, int y, int z) {
+        return hash(new Triple(x, y, z));
+    }
+
+    int hash(Triple t) {
+        return hashTable.computeIfAbsent(t, k -> counter++);
+    }
+}
+
+// ✅ Graph class with custom hash and edge support
+class Graph {
+    boolean isDirected;
+    List<List<Pair>> adj;
+    int N = 500000; // you can resize if needed
+    Hash h = new Hash();
+
+    public Graph(boolean isDirected) {
+        this.isDirected = isDirected;
+        adj = new ArrayList<>();
+        for (int i = 0; i < N; i++) {
+            adj.add(new ArrayList<>());
+        }
+    }
+
+    void addEdge(int u, int v, int weight) {
+        int hashedU = h.hash(u);
+        int hashedV = h.hash(v);
+        addEdgeInternal(hashedU, hashedV, weight);
+    }
+
+    void addEdge(Triple u, Triple v, int weight) {
+        int hashedU = h.hash(u);
+        int hashedV = h.hash(v);
+        addEdgeInternal(hashedU, hashedV, weight);
+    }
+
+    private void addEdgeInternal(int u, int v, int weight) {
+        adj.get(u).add(new Pair(v, weight));
+        if (!isDirected) {
+            adj.get(v).add(new Pair(u, weight));
+        }
+    }
+
+    static class Pair {
+        int node, weight;
+
+        public Pair(int node, int weight) {
+            this.node = node;
+            this.weight = weight;
+        }
+    }
+}
+
+// ✅ BFS traversal with minDist and isVisited
+class BFS {
+    Graph g;
+    int[] minDist;
+    boolean[] visited;
+
+    public BFS(Graph g) {
+        this.g = g;
+        minDist = new int[g.N];
+        Arrays.fill(minDist, -1);
+        visited = new boolean[g.N];
+    }
+
+    void run(int source) {
+        int s = g.h.hash(source);
+        runInternal(s);
+    }
+
+    void run(Triple source) {
+        int s = g.h.hash(source);
+        runInternal(s);
+    }
+
+    private void runInternal(int source) {
+        Queue<Integer> q = new LinkedList<>();
+        visited[source] = true;
+        minDist[source] = 0;
+        q.offer(source);
+
+        while (!q.isEmpty()) {
+            int curr = q.poll();
+            for (Graph.Pair p : g.adj.get(curr)) {
+                int adjNode = p.node;
+                if (!visited[adjNode]) {
+                    visited[adjNode] = true;
+                    minDist[adjNode] = minDist[curr] + 1;
+                    q.offer(adjNode);
+                }
+            }
+        }
+    }
+
+    int minDist(int target) {
+        return minDist[g.h.hash(target)];
+    }
+
+    int minDist(Triple target) {
+        return minDist[g.h.hash(target)];
+    }
+
+    boolean isVisited(int target) {
+        return visited[g.h.hash(target)];
+    }
+
+    boolean isVisited(Triple target) {
+        return visited[g.h.hash(target)];
+    }
+}
+
+// ✅ Sample usage
+public class BlackboxDemo {
+    public static void main(String[] args) {
+        Graph g = new Graph(false); // false = undirected
+
+        // Add normal node edges
+        g.addEdge(1, 2, 1);
+        g.addEdge(2, 3, 1);
+
+        // Add custom tuple-based nodes
+        g.addEdge(new Triple(4, 5, 0), new Triple(7, 8, 0), 1);
+        g.addEdge(new Triple(7, 8, 0), new Triple(9, 9, 9), 1);
+
+        BFS bfs = new BFS(g);
+
+        // Run BFS from simple node
+        bfs.run(1);
+        System.out.println("Distance from 1 to 3: " + bfs.minDist(3)); // should be 2
+        System.out.println("Is node 3 visited? " + bfs.isVisited(3));
+
+        // Run BFS from a tuple node
+        bfs = new BFS(g);
+        bfs.run(new Triple(4, 5, 0));
+        System.out.println("Distance to (9,9,9): " + bfs.minDist(new Triple(9, 9, 9))); // should be 2
+        System.out.println("Visited (9,9,9)? " + bfs.isVisited(new Triple(9, 9, 9)));
+    }
+}
\ No newline at end of file

From 5becce69ebbb58f5243bbe3f91bab662a356af4d Mon Sep 17 00:00:00 2001
From: Nipun Kumar <111305023+NipunRaj96@users.noreply.github.com>
Date: Mon, 28 Apr 2025 22:41:51 +0530
Subject: [PATCH 2/6] Delete BlackboxDemo.java

---
 BlackboxDemo.java | 177 ----------------------------------------------
 1 file changed, 177 deletions(-)
 delete mode 100644 BlackboxDemo.java

diff --git a/BlackboxDemo.java b/BlackboxDemo.java
deleted file mode 100644
index fa4e7a2..0000000
--- a/BlackboxDemo.java
+++ /dev/null
@@ -1,177 +0,0 @@
-import java.util.*;
-
-// ✅ Triple class for 3D hashing (like tuple<int,int,int>)
-class Triple {
-    int a, b, c;
-
-    public Triple(int a, int b, int c) {
-        this.a = a;
-        this.b = b;
-        this.c = c;
-    }
-
-    @Override
-    public boolean equals(Object o) {
-        if (!(o instanceof Triple)) return false;
-        Triple other = (Triple) o;
-        return a == other.a && b == other.b && c == other.c;
-    }
-
-    @Override
-    public int hashCode() {
-        return Objects.hash(a, b, c);
-    }
-}
-
-// ✅ Hash class to convert tuples to unique ints
-class Hash {
-    Map<Triple, Integer> hashTable = new HashMap<>();
-    int counter = 0;
-
-    int hash(int x) {
-        return hash(new Triple(x, 0, 0));
-    }
-
-    int hash(int x, int y) {
-        return hash(new Triple(x, y, 0));
-    }
-
-    int hash(int x, int y, int z) {
-        return hash(new Triple(x, y, z));
-    }
-
-    int hash(Triple t) {
-        return hashTable.computeIfAbsent(t, k -> counter++);
-    }
-}
-
-// ✅ Graph class with custom hash and edge support
-class Graph {
-    boolean isDirected;
-    List<List<Pair>> adj;
-    int N = 500000; // you can resize if needed
-    Hash h = new Hash();
-
-    public Graph(boolean isDirected) {
-        this.isDirected = isDirected;
-        adj = new ArrayList<>();
-        for (int i = 0; i < N; i++) {
-            adj.add(new ArrayList<>());
-        }
-    }
-
-    void addEdge(int u, int v, int weight) {
-        int hashedU = h.hash(u);
-        int hashedV = h.hash(v);
-        addEdgeInternal(hashedU, hashedV, weight);
-    }
-
-    void addEdge(Triple u, Triple v, int weight) {
-        int hashedU = h.hash(u);
-        int hashedV = h.hash(v);
-        addEdgeInternal(hashedU, hashedV, weight);
-    }
-
-    private void addEdgeInternal(int u, int v, int weight) {
-        adj.get(u).add(new Pair(v, weight));
-        if (!isDirected) {
-            adj.get(v).add(new Pair(u, weight));
-        }
-    }
-
-    static class Pair {
-        int node, weight;
-
-        public Pair(int node, int weight) {
-            this.node = node;
-            this.weight = weight;
-        }
-    }
-}
-
-// ✅ BFS traversal with minDist and isVisited
-class BFS {
-    Graph g;
-    int[] minDist;
-    boolean[] visited;
-
-    public BFS(Graph g) {
-        this.g = g;
-        minDist = new int[g.N];
-        Arrays.fill(minDist, -1);
-        visited = new boolean[g.N];
-    }
-
-    void run(int source) {
-        int s = g.h.hash(source);
-        runInternal(s);
-    }
-
-    void run(Triple source) {
-        int s = g.h.hash(source);
-        runInternal(s);
-    }
-
-    private void runInternal(int source) {
-        Queue<Integer> q = new LinkedList<>();
-        visited[source] = true;
-        minDist[source] = 0;
-        q.offer(source);
-
-        while (!q.isEmpty()) {
-            int curr = q.poll();
-            for (Graph.Pair p : g.adj.get(curr)) {
-                int adjNode = p.node;
-                if (!visited[adjNode]) {
-                    visited[adjNode] = true;
-                    minDist[adjNode] = minDist[curr] + 1;
-                    q.offer(adjNode);
-                }
-            }
-        }
-    }
-
-    int minDist(int target) {
-        return minDist[g.h.hash(target)];
-    }
-
-    int minDist(Triple target) {
-        return minDist[g.h.hash(target)];
-    }
-
-    boolean isVisited(int target) {
-        return visited[g.h.hash(target)];
-    }
-
-    boolean isVisited(Triple target) {
-        return visited[g.h.hash(target)];
-    }
-}
-
-// ✅ Sample usage
-public class BlackboxDemo {
-    public static void main(String[] args) {
-        Graph g = new Graph(false); // false = undirected
-
-        // Add normal node edges
-        g.addEdge(1, 2, 1);
-        g.addEdge(2, 3, 1);
-
-        // Add custom tuple-based nodes
-        g.addEdge(new Triple(4, 5, 0), new Triple(7, 8, 0), 1);
-        g.addEdge(new Triple(7, 8, 0), new Triple(9, 9, 9), 1);
-
-        BFS bfs = new BFS(g);
-
-        // Run BFS from simple node
-        bfs.run(1);
-        System.out.println("Distance from 1 to 3: " + bfs.minDist(3)); // should be 2
-        System.out.println("Is node 3 visited? " + bfs.isVisited(3));
-
-        // Run BFS from a tuple node
-        bfs = new BFS(g);
-        bfs.run(new Triple(4, 5, 0));
-        System.out.println("Distance to (9,9,9): " + bfs.minDist(new Triple(9, 9, 9))); // should be 2
-        System.out.println("Visited (9,9,9)? " + bfs.isVisited(new Triple(9, 9, 9)));
-    }
-}
\ No newline at end of file

From a1e1ddc9153eefc6e697ac1da6a656ea623343fb Mon Sep 17 00:00:00 2001
From: Nipun Kumar <111305023+NipunRaj96@users.noreply.github.com>
Date: Mon, 28 Apr 2025 22:42:11 +0530
Subject: [PATCH 3/6] Delete BlackboxDemo.class

---
 BlackboxDemo.class | Bin 1544 -> 0 bytes
 1 file changed, 0 insertions(+), 0 deletions(-)
 delete mode 100644 BlackboxDemo.class

diff --git a/BlackboxDemo.class b/BlackboxDemo.class
deleted file mode 100644
index d9e15e4a58f59c4a3144c2cc2bdb15ce128e4ec5..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 1544
zcmaJ>TW=dh6#gc@Z0s(?O`DnqS{6v@rVceF+!B`-;xw(nX#)-^NujW|hh!Uj*V<i2
z<b_v$0aAqo5(tS_;#M9U$&vU0Nbr-YezTi2HnF-Z&73*seCIy%&%^HD0Nz6_jUmJ|
z#C0T)6v*7Mwyb=^a@O-Vs&`~95J+CM9Xq%r5HlxNGz<$Qu6kB$BMl8{1v?@TH`gXt
z6yqr!Ph&(tv+DIL^>s<OSt^wj@F?kJ&u%qj8W|i@$Pon@Q;-t^$IWsiF6{3i>=`<q
zTd1Uw#kj&eE08wJVFU%`GmBF?PUCs1d2L69LRbnf;6)8D>6pNozN{+SejuAvcH7Kt
ztQ_WRyZI&0c7jUaNvl~<M$hUnG08-lwli=0)K!K{qpVs^#}r->$TqD_S#+J672LFg
z4N`t!Ie|~JRE;c$m84nQS*O`NUe$0x$7`4tI5xmF{k2pe4JI;X9ySpr{DzJ<@s>c!
z_E&7*4rD!wZfz6-Gb*}S1z#H&LlzfRz1|Tx^0?rU*~=>Bcl-FvcL+IEkD~H9-zTKI
z7-lqF70~AzR&BHDel;(fE`uq$b+&$_Y&-ILyIGaqvQ=%66K`5JQ#)ba8k8G5TXEZ7
zO)l6<`Dm}v^Qv0x<ecjUe!%%#l);8u_lL2>PN)u9PE8tLdT!IWU<9r)J!^<ze8jmb
z`G&)IjA>&ls@7#CS!NiIVbnKgrua{Ws1<?Hy~^(Mi5W@alQdSbrs0+<@}~k52iL`R
zw%kpbk9r+V#e!7}TyI<8Zf`616r=dBSx&tn{fV;cZnj&6!&T|w^Z}Q*TXKMUZ(XAc
zT<D#GJrhN%(Wr243hZ3TaimvlSiUcP4WA2~Ih50&P&Kd{r=P6K3m@gh+ql3%Qr{3q
zlrIg}YdoFeF1RPo?La&rAyDF~#K2vo@IF2uO;s_@ry@q~f4k6DV>?KdbMZvH13i~W
zhTASOtJ*Lnql(ICnUJRFc&?Wb(y0u8YAWe2va7iroLrpZ>AAmPOeH&bxr=i^2j}<B
zuXpiwcs|fR@Yg{>sr6az;8K_G>%NKq$>zGa63Py8p5-eDe8-%>=kxdjuiTG(Cw{^b
ze&)>mg4?(U2lw$ce#JNV4d3E-Jis6L7k{!YWnzc0i0j<P5ywqd?MAqM7_OCY{TQE7
No~G<JzCaZx9|1J9YhwTa


From 630c76106012e6aca162c4bde22472692873303f Mon Sep 17 00:00:00 2001
From: Nipun Kumar <111305023+NipunRaj96@users.noreply.github.com>
Date: Mon, 28 Apr 2025 23:32:16 +0530
Subject: [PATCH 4/6] Create a

---
 GraphX_javaFunc/a | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 GraphX_javaFunc/a

diff --git a/GraphX_javaFunc/a b/GraphX_javaFunc/a
new file mode 100644
index 0000000..8b13789
--- /dev/null
+++ b/GraphX_javaFunc/a
@@ -0,0 +1 @@
+

From 626e701cfb9f01946afef600750e1cf8133e7a2c Mon Sep 17 00:00:00 2001
From: Nipun Kumar <111305023+NipunRaj96@users.noreply.github.com>
Date: Mon, 28 Apr 2025 23:32:53 +0530
Subject: [PATCH 5/6] Add files via upload

---
 GraphX_javaFunc/BFS.class          | Bin 0 -> 1768 bytes
 GraphX_javaFunc/BlackboxDemo.class | Bin 0 -> 1544 bytes
 GraphX_javaFunc/BlackboxDemo.java  | 177 +++++++++++++++++++++++++++++
 GraphX_javaFunc/Graph$Pair.class   | Bin 0 -> 350 bytes
 GraphX_javaFunc/Graph.class        | Bin 0 -> 1188 bytes
 GraphX_javaFunc/Hash.class         | Bin 0 -> 1558 bytes
 GraphX_javaFunc/Triple.class       | Bin 0 -> 693 bytes
 7 files changed, 177 insertions(+)
 create mode 100644 GraphX_javaFunc/BFS.class
 create mode 100644 GraphX_javaFunc/BlackboxDemo.class
 create mode 100644 GraphX_javaFunc/BlackboxDemo.java
 create mode 100644 GraphX_javaFunc/Graph$Pair.class
 create mode 100644 GraphX_javaFunc/Graph.class
 create mode 100644 GraphX_javaFunc/Hash.class
 create mode 100644 GraphX_javaFunc/Triple.class

diff --git a/GraphX_javaFunc/BFS.class b/GraphX_javaFunc/BFS.class
new file mode 100644
index 0000000000000000000000000000000000000000..a6198b85d04569c6edce0876bcff4a3bb576fdab
GIT binary patch
literal 1768
zcmaJ>T~ixX7=BJzvSc}h@)49$Y|*wR0l|V&B^2eOw5tJHKx(0CH(>({VUun)wD>*R
z(F>jN!W*qKdf6LqoB>+YalG~)IeygVY=Tg!z1VZkzWYA!^SmEtfBXB#UjPiFWFUkp
z9hyWn!UBg^taYm=XSqu~Q|T2u;|qib9oO-P1gc{3xd>_y(P2o`LeexcJ|iHO1oYH-
z&nhe@Bd9~Yj>8fSXcVXptaO>=V=8pBL=-IqtU2zOQzSuX!8GtVT6G+eXv5K66(!%v
z^$dHSwNVt%vQ92XF|h^HEX#O8;uwxI(7ID}e0xy^npgBsN<4)V<XfhH>Vj2VP8v9c
zr**_6;z%%<GICokZ!t4Y1vTiBcm~}9wO+|JUElUxi<BBa&#3^<D)ec7j-_Tjr;xLg
zaZ^X1Kyy&EKyJ!$SM9|V^D@wjDg*sEqvHjM7cn5vuvc9bf64Zgd@EP7r?LVqBuX9d
zNY-KyXLSroyo8qp>i5VlmF$wu8t1cF6)76qhc0(78J}115s6WZk;^HbTPye*K`(<Z
z;}Yj_fk_tfs=Upy{R%2ER1&X9yo!`SjpO=rN^lT@4XwkZ#1t;_-CA5>>&hA`#VGoe
zKaCk3vl6diPM~g2zN!*oOE%Z&gSl6j74~(BE0|ZzY>4IOnP|(d%7DeJ*vWJiZ|Hba
z;w_bI;~vwl3oF2uPue$q<!ec#gWO#jbZ~%-U|LUHv>Y#j46+hSYKS#AzsQ7*SY^iJ
z%tIRuZ1rroJy}{y+up2|&Z)9+cpjJ$Iv<+xt<36#RjBwxoZ{T>(5mrbdi#coZ^lf%
z<Ynw}M@4KH$q}8--yE~o^4%&c0cpCf?TzNFV$oK&LrKPQ&Txp=x{434Cs(Mu7VNw#
z+-tyb!7^8eZ`1Tv{-+XmArhTi&=Z}TIP|lzg{H(NnnL&RSlOa&q5TJX3aoHFf-u)K
zG}b7BMKr<Yz0Kkz%LS~WyAr=w{aa{hWH5ab9c|k<c{Xu$8=ZTx>H?1ys$JzDBNyOv
z|AX(`M$g0XdEyJiUne84a2YRZsZeLc?|wq>mAiOuf;!sUv{{u~Th&xo+dVwLgJcMo
zyLK=va2q#xI4AHc`nO>Ym1R$~@8D91w&@*Q78uZ4wH+)7e2sB+x~AMS1J$k7o3Q)C
ziXs~ByUn5or!req*_+zCwQEyd(eS^tckXZBx&MhOMkpxk5bAmM*`^Xt>ulW(bYKGs
zyp1z>hoyd(WqOZa-{<-PKF5dn3LoJce2i~#3u{ETp!!dA=otJ9T|&pzKVbfjkZN<3
zamtO4v*^mwpj7eMZBF<1G?sfD<_>%sz)n8`rh0M!_8DO=@(+Qv?_=xxFWVOZtndh!
ZVmko)lDS+bGz1St?gj&7_+w%n{{eJ8SWy4~

literal 0
HcmV?d00001

diff --git a/GraphX_javaFunc/BlackboxDemo.class b/GraphX_javaFunc/BlackboxDemo.class
new file mode 100644
index 0000000000000000000000000000000000000000..d9e15e4a58f59c4a3144c2cc2bdb15ce128e4ec5
GIT binary patch
literal 1544
zcmaJ>TW=dh6#gc@Z0s(?O`DnqS{6v@rVceF+!B`-;xw(nX#)-^NujW|hh!Uj*V<i2
z<b_v$0aAqo5(tS_;#M9U$&vU0Nbr-YezTi2HnF-Z&73*seCIy%&%^HD0Nz6_jUmJ|
z#C0T)6v*7Mwyb=^a@O-Vs&`~95J+CM9Xq%r5HlxNGz<$Qu6kB$BMl8{1v?@TH`gXt
z6yqr!Ph&(tv+DIL^>s<OSt^wj@F?kJ&u%qj8W|i@$Pon@Q;-t^$IWsiF6{3i>=`<q
zTd1Uw#kj&eE08wJVFU%`GmBF?PUCs1d2L69LRbnf;6)8D>6pNozN{+SejuAvcH7Kt
ztQ_WRyZI&0c7jUaNvl~<M$hUnG08-lwli=0)K!K{qpVs^#}r->$TqD_S#+J672LFg
z4N`t!Ie|~JRE;c$m84nQS*O`NUe$0x$7`4tI5xmF{k2pe4JI;X9ySpr{DzJ<@s>c!
z_E&7*4rD!wZfz6-Gb*}S1z#H&LlzfRz1|Tx^0?rU*~=>Bcl-FvcL+IEkD~H9-zTKI
z7-lqF70~AzR&BHDel;(fE`uq$b+&$_Y&-ILyIGaqvQ=%66K`5JQ#)ba8k8G5TXEZ7
zO)l6<`Dm}v^Qv0x<ecjUe!%%#l);8u_lL2>PN)u9PE8tLdT!IWU<9r)J!^<ze8jmb
z`G&)IjA>&ls@7#CS!NiIVbnKgrua{Ws1<?Hy~^(Mi5W@alQdSbrs0+<@}~k52iL`R
zw%kpbk9r+V#e!7}TyI<8Zf`616r=dBSx&tn{fV;cZnj&6!&T|w^Z}Q*TXKMUZ(XAc
zT<D#GJrhN%(Wr243hZ3TaimvlSiUcP4WA2~Ih50&P&Kd{r=P6K3m@gh+ql3%Qr{3q
zlrIg}YdoFeF1RPo?La&rAyDF~#K2vo@IF2uO;s_@ry@q~f4k6DV>?KdbMZvH13i~W
zhTASOtJ*Lnql(ICnUJRFc&?Wb(y0u8YAWe2va7iroLrpZ>AAmPOeH&bxr=i^2j}<B
zuXpiwcs|fR@Yg{>sr6az;8K_G>%NKq$>zGa63Py8p5-eDe8-%>=kxdjuiTG(Cw{^b
ze&)>mg4?(U2lw$ce#JNV4d3E-Jis6L7k{!YWnzc0i0j<P5ywqd?MAqM7_OCY{TQE7
No~G<JzCaZx9|1J9YhwTa

literal 0
HcmV?d00001

diff --git a/GraphX_javaFunc/BlackboxDemo.java b/GraphX_javaFunc/BlackboxDemo.java
new file mode 100644
index 0000000..fa4e7a2
--- /dev/null
+++ b/GraphX_javaFunc/BlackboxDemo.java
@@ -0,0 +1,177 @@
+import java.util.*;
+
+// ✅ Triple class for 3D hashing (like tuple<int,int,int>)
+class Triple {
+    int a, b, c;
+
+    public Triple(int a, int b, int c) {
+        this.a = a;
+        this.b = b;
+        this.c = c;
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (!(o instanceof Triple)) return false;
+        Triple other = (Triple) o;
+        return a == other.a && b == other.b && c == other.c;
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(a, b, c);
+    }
+}
+
+// ✅ Hash class to convert tuples to unique ints
+class Hash {
+    Map<Triple, Integer> hashTable = new HashMap<>();
+    int counter = 0;
+
+    int hash(int x) {
+        return hash(new Triple(x, 0, 0));
+    }
+
+    int hash(int x, int y) {
+        return hash(new Triple(x, y, 0));
+    }
+
+    int hash(int x, int y, int z) {
+        return hash(new Triple(x, y, z));
+    }
+
+    int hash(Triple t) {
+        return hashTable.computeIfAbsent(t, k -> counter++);
+    }
+}
+
+// ✅ Graph class with custom hash and edge support
+class Graph {
+    boolean isDirected;
+    List<List<Pair>> adj;
+    int N = 500000; // you can resize if needed
+    Hash h = new Hash();
+
+    public Graph(boolean isDirected) {
+        this.isDirected = isDirected;
+        adj = new ArrayList<>();
+        for (int i = 0; i < N; i++) {
+            adj.add(new ArrayList<>());
+        }
+    }
+
+    void addEdge(int u, int v, int weight) {
+        int hashedU = h.hash(u);
+        int hashedV = h.hash(v);
+        addEdgeInternal(hashedU, hashedV, weight);
+    }
+
+    void addEdge(Triple u, Triple v, int weight) {
+        int hashedU = h.hash(u);
+        int hashedV = h.hash(v);
+        addEdgeInternal(hashedU, hashedV, weight);
+    }
+
+    private void addEdgeInternal(int u, int v, int weight) {
+        adj.get(u).add(new Pair(v, weight));
+        if (!isDirected) {
+            adj.get(v).add(new Pair(u, weight));
+        }
+    }
+
+    static class Pair {
+        int node, weight;
+
+        public Pair(int node, int weight) {
+            this.node = node;
+            this.weight = weight;
+        }
+    }
+}
+
+// ✅ BFS traversal with minDist and isVisited
+class BFS {
+    Graph g;
+    int[] minDist;
+    boolean[] visited;
+
+    public BFS(Graph g) {
+        this.g = g;
+        minDist = new int[g.N];
+        Arrays.fill(minDist, -1);
+        visited = new boolean[g.N];
+    }
+
+    void run(int source) {
+        int s = g.h.hash(source);
+        runInternal(s);
+    }
+
+    void run(Triple source) {
+        int s = g.h.hash(source);
+        runInternal(s);
+    }
+
+    private void runInternal(int source) {
+        Queue<Integer> q = new LinkedList<>();
+        visited[source] = true;
+        minDist[source] = 0;
+        q.offer(source);
+
+        while (!q.isEmpty()) {
+            int curr = q.poll();
+            for (Graph.Pair p : g.adj.get(curr)) {
+                int adjNode = p.node;
+                if (!visited[adjNode]) {
+                    visited[adjNode] = true;
+                    minDist[adjNode] = minDist[curr] + 1;
+                    q.offer(adjNode);
+                }
+            }
+        }
+    }
+
+    int minDist(int target) {
+        return minDist[g.h.hash(target)];
+    }
+
+    int minDist(Triple target) {
+        return minDist[g.h.hash(target)];
+    }
+
+    boolean isVisited(int target) {
+        return visited[g.h.hash(target)];
+    }
+
+    boolean isVisited(Triple target) {
+        return visited[g.h.hash(target)];
+    }
+}
+
+// ✅ Sample usage
+public class BlackboxDemo {
+    public static void main(String[] args) {
+        Graph g = new Graph(false); // false = undirected
+
+        // Add normal node edges
+        g.addEdge(1, 2, 1);
+        g.addEdge(2, 3, 1);
+
+        // Add custom tuple-based nodes
+        g.addEdge(new Triple(4, 5, 0), new Triple(7, 8, 0), 1);
+        g.addEdge(new Triple(7, 8, 0), new Triple(9, 9, 9), 1);
+
+        BFS bfs = new BFS(g);
+
+        // Run BFS from simple node
+        bfs.run(1);
+        System.out.println("Distance from 1 to 3: " + bfs.minDist(3)); // should be 2
+        System.out.println("Is node 3 visited? " + bfs.isVisited(3));
+
+        // Run BFS from a tuple node
+        bfs = new BFS(g);
+        bfs.run(new Triple(4, 5, 0));
+        System.out.println("Distance to (9,9,9): " + bfs.minDist(new Triple(9, 9, 9))); // should be 2
+        System.out.println("Visited (9,9,9)? " + bfs.isVisited(new Triple(9, 9, 9)));
+    }
+}
\ No newline at end of file
diff --git a/GraphX_javaFunc/Graph$Pair.class b/GraphX_javaFunc/Graph$Pair.class
new file mode 100644
index 0000000000000000000000000000000000000000..7a515df29945958500243fd0792bb6e8327187d8
GIT binary patch
literal 350
zcmW-cJ5R$f6orq|G%rG5KzR-f3~dHFbVW!|1Vlmw2?(rCuv(YYsge}<TMQKv13!Qt
zg}Bb(b9L==kH7o-_x%Il40|37)NGhO>aZAEGycX0DOZ!hZ9Ef6$zYvGCCgKWTCX3u
zaNyeTe5}D|@UC*cm>%76nKPIwdl3vQ)TV}yrgm8GLQbX>Q}2agKO)ztay4(H6657O
z7Wo5@Q=0Scvt^!$OR1aodCHU5IQzH|^XyndF*svUl-F5N+SsPN>T3o+R7&Kdloy34
zC|<MRkO&M~P#*#%g~lNzKH9WJ+NN%(x7TmM7g(^rf*l;Ju>M&YJER?$q>rQ#Ts)zH
YXBya`I|G~8s%jTIR6UAx(8VsCe^e<uFaQ7m

literal 0
HcmV?d00001

diff --git a/GraphX_javaFunc/Graph.class b/GraphX_javaFunc/Graph.class
new file mode 100644
index 0000000000000000000000000000000000000000..bfe5be5cc06835f1dbb0efa06589554e17301366
GIT binary patch
literal 1188
zcmZ`&TTc@~7(KIXS-LEj0#%_c7rC|NQdF*%`+bvANgx<_Tj&NBOCj6V=)1qc2jBF?
zXA^-SiSgOr;ji#PJhQD9MbqreH#6UNzH`n@zyA328NfVNH7M|?@apiPN}%D$d~PPP
zX6_*IWbeq@F9=jk**Uu~BjAa~wmneacKG3krlLlNj#>fVs$-rW3Wzj6Lq)xScg@Tn
zYN&%p<~HhRLNgDURF#rPNx6MT$6eeL(Cqw@?XZ`XVa~3KR)Hp$N3mdM6Z4K^zD(Kq
zf`*n7UPMP5+DXXF9FcOWk}K1aHR!~B6<s>I(IZgz=doMHM!{&Q?uOQ6Y*%vb(-B3C
zA`Z!vQ`CqV8u|9?7{H)Fy_v}@XAUeQSFoI%nWd<xVHmM(S)7o?!vZzY)RtqPX02q*
zkc1xUc!Uu)Kd|U&keIjIs~DpjuAAK(rtN4L#e}?=Nt(<Sv26kWrhSkz3q{8g82(H7
z)U9;|D>=iT6tgQ)yo)Cp0@SDMoRuyf?^({4xtHZm?PkH;f3|L(me*=ot3dN_LBE8#
ze6-DzqO)(U*s?mXkY)AW$%`fH_+&`>P9xG*zOZh|9(e)X$mJ|&F>B`Y7METr6CE^H
z;dAuz<BQ-3dBG5P%t%3!BVU@_mJf-emuEgqah&GrH9Y(QtMLnnc%yoT>i8Avb}rCx
zhCn=Yh9K81Tr&)Nro-`%sD6i5PT}(YB{~#5eWi%^*WW%6O2G`rUJ?Vw*=_{#GJ=>u
zD<;uHVhPfk<Gex&v&;%WxkjJ-FZqQ4zEc61Fj(feK#(f#w6SR*bdKIJuZ+Sn^2LMR
zpf7TcxNI%l){U+kb8I_L#S4gF(Z!qp7heB4hDvw?GWtK>3h`Enw?;gJBKe-nc*pcp
z`adU430>lWf-mU2!st#oa)I%ZKRgS*LAy)|-%JTrQYz+^6r>QwI=YaiNgJ+F9*9|9
Y*8-a<6t%=zUgs#58EJ0hr>oUJ0h~eF-T(jq

literal 0
HcmV?d00001

diff --git a/GraphX_javaFunc/Hash.class b/GraphX_javaFunc/Hash.class
new file mode 100644
index 0000000000000000000000000000000000000000..72eb0cfc7e9b6172b89212998b3b5b2e0bb23905
GIT binary patch
literal 1558
zcmbVMT~pIQ6g}G(0wK_Xe29FASfDLP{X)ee3PmJZz!?~3@X2jiAdn`VG-2dF`Jgj=
zD9$)OJN_oeyJ?W1$b%2rZ0_#4=j^#R`~Bz1R{%43ts;V`f|!On)H5V@_#V%i+}g@6
z7k5O-WvHJrEW@2<h^EqO3K|$%{Y{>0nArth-CpDs6$+w_Xo9AoSwjor3^BRJ(6~*n
zRbDg&L%eW?Bvei!S~axc3WHLzJ<Ami1Jf0B5bvsER7|0w9bHo0RSKnaT~Dv61iPl8
z2ff51(=#-s3bpOIwBAN1>(_7{0}OS%QZe@#hEfG7CzlQ>*z~NDYuHwHKA7a1Fo>H9
zk{X6E%+P#JEy*w0<%;JDeRHN*6&87uPu22;49i{05b%fhD@dJM>W6i5VM{nFMv&1k
ziZO-;!*bWS>5+w01YItTYslg@*|sO+%bN_HDLtG$NRy)qtQcDscRh#TV<B}^fvHp1
zLdQ4-P7^eiw>SK{8J1Y`%0=M>m5dRYPWDnk<hxcFnlzidT-@MES(PNo>pQE<1r!YG
zitRZiF>lEBXq`2AX}4&<n-gVwT$)b}IcwW))pdAfQMlXoMl}Iy#o-Hl4<EkPySaEB
zp2=pJ(eMb92~5W8F{k1=<`ulqumDm#=oi^{-mv!UU6C#LM<6=B$xE*7Q2R8M!(Ttb
z>;b5zZh>1Hrl=+hw!Q0Bf>!Wzuegq3ZG|J}fUElz@qddo%FD4~YXaIlH_a8p6;xzR
zw=Ci0O<t{vs)7RjEq{4((eV^4G4x-)m0F|b1qP@N5&ARbL-zw1?)YDKX`~B)#(H|_
z5~7uRG@C$_W<W>g7%cMz%K9-H520qFhe&*+1%~@Hw$L`vRS-ijCGGR)6G4g*N+#*z
z1aDvOiAImnd4%rw6smzG7f6{*@E`<|DFaaNKR`(z^e_a9g+P55Go^e`Zve`YbSbYZ
za{zTTb0XD$#*HYxVdMzuKV^<3BC?BrGsc3mtsfxqCia$G`Gi{^C|~$&W5n^8ViDvp
ZMQ@E(^Avl6r<lb{il`KMg+(l*`xk#)ZLt6V

literal 0
HcmV?d00001

diff --git a/GraphX_javaFunc/Triple.class b/GraphX_javaFunc/Triple.class
new file mode 100644
index 0000000000000000000000000000000000000000..0baf6b2c6114ad3b7caa18a0018405c30770739f
GIT binary patch
literal 693
zcmZuu$!^n76g@9?V#jq7r$ZRp&@vU<MRdigRmCJEOD$cbs#I7#hu7A{O-gE4d<(1W
z*mQ$LM1=%`E#HI?=Q%+jfvh_`-+Rxw!}p(`z5sZLz(EOy1=B?t6#?%^p2^iz_6}CJ
z<0IA01S;!EFUd9p3_sYd!ba7C<6;UfV>^T7Bvk@JQX(C#yJ+Z;i1n-KV!C*B9n50R
zLd(S^To!2lA&PpLI#2@v>rAG(+TIsv`BAX>PsW;qtC+X2;G&IdzcKPGNhi&o3YdrT
z^iTu5_^W<A%32VyV?T<bV3&!H`!CseV>9WgXZdlg20Jp=qg2%ET&9GY^Zx_!T%gv;
zWcSsUJed^OnsSWB6_LZ~^z%ViJxw%R^HIv|xc}yfI_}@oGhvB~DRKP<g=?gS-dSO}
zEm{MD_gJJ};%lARChcta5h9!)!3q~fsD<qjy!ZSsaGkov3V^57C*oI!gBjur+`!EV
z(!Rbnv+l2agZ&m|<9y{S?5*$vth<yU+H`AlYeP)a_2_y-SmryJ#yJa11y#KOX^_Mt
zO%t~mnSxRMfxv?OfXByeEKfK$*pXnua^*8hdxqw^z)WY))KrC6)=b*Fz!gn0o~Ke&
KwW#kD#Qrb)4SJUV

literal 0
HcmV?d00001


From 2f1f3cc87e348e80bfb5d5a47ee313469c52c09a Mon Sep 17 00:00:00 2001
From: Nipun Kumar <111305023+NipunRaj96@users.noreply.github.com>
Date: Mon, 28 Apr 2025 23:33:13 +0530
Subject: [PATCH 6/6] Delete GraphX_javaFunc/a

---
 GraphX_javaFunc/a | 1 -
 1 file changed, 1 deletion(-)
 delete mode 100644 GraphX_javaFunc/a

diff --git a/GraphX_javaFunc/a b/GraphX_javaFunc/a
deleted file mode 100644
index 8b13789..0000000
--- a/GraphX_javaFunc/a
+++ /dev/null
@@ -1 +0,0 @@
-