stuzha 0.2.7__tar.gz → 0.2.8__tar.gz

{stuzha-0.2.7 → stuzha-0.2.8}/PKG-INFO

@@ -1,5 +1,5 @@
 Metadata-Version: 2.4
 Name: stuzha
-Version: 0.2.7
+Version: 0.2.8
 Requires-Dist: colorama>=0.4.6
 Dynamic: requires-dist

{stuzha-0.2.7 → stuzha-0.2.8}/setup.py

@@ -2,7 +2,7 @@ from setuptools import setup, find_packages
 
 setup(
     name='stuzha',
-    version='0.2.7',
+    version='0.2.8',
     packages=find_packages(),
     install_requires=[
         'colorama>=0.4.6',

{stuzha-0.2.7 → stuzha-0.2.8}/stuzha/SNA.py

@@ -179,6 +179,9 @@ def ans_5():
 library(igraph)
 g <- erdos.renyi.game(10, 0.3, directed = T)
 g1 <- sample_gnp(10, 0.3, directed = T)
+
+# Density 
+
 den <- graph.density(g)
 den
 
@@ -205,6 +208,8 @@ plot(g)
 
 
 
+# Clustering
+
 library(igraph)
 
 kite <- make_graph("Krackhardt_Kite")
@@ -231,6 +236,9 @@ mods
 
 
 
+
+# Centralization
+
 source("Practical5.2.R")
 
 optimal_edges <- which.max(mods) - 1
@@ -268,6 +276,7 @@ def ans_6():
           
 # pip install networkx, matplotlib, scipy
 
+# PageRank Visualization
 
 import networkx as nx
 import matplotlib.pyplot as plt
@@ -276,36 +285,6 @@ import numpy as np
 adj = np.array([[0, 1, 1, 0], [0, 0, 1, 0], [1, 0, 0, 1], [0, 0, 1, 0]])
 nodes = ["A", "B", "C", "D"]
 
-G = nx.from_numpy_array(adj, create_using=nx.DiGraph)
-G = nx.relabel_nodes(G, {i: nodes[i] for i in range(4)})
-pr = nx.pagerank(G)
-
-print("PageRank Scores:", {n: f"{pr[n]:.4f}" for n in nodes})
-
-pos = {"A": (0, 1), "B": (2, 2), "C": (4, 1), "D": (2, 0)}
-nx.draw(G, pos, labels={n: f"{n}\n{pr[n]:.3f}" for n in nodes},
-       node_size=[800 + 3000 * pr[n] for n in nodes],
-       node_color="lightblue", edgecolors="darkblue",
-       font_size=10, arrows=True, arrowsize=20)
-plt.title("PageRank")
-plt.show()
-
-
-
-
-
-
-# Alternate Code for PageRank Visualization
-
-import networkx as nx
-import matplotlib.pyplot as plt
-import numpy as np
-
-# Define adjacency matrix and node names
-adj = np.array([[0, 1, 1, 0], [0, 0, 1, 0], [1, 0, 0, 1], [0, 0, 1, 0]])
-nodes = ["A", "B", "C", "D"]
-
-# Create Directed Graph
 G = nx.from_numpy_array(adj, create_using=nx.DiGraph)
 G = nx.relabel_nodes(G, {i: nodes[i] for i in range(len(nodes))})
 
@@ -332,12 +311,16 @@ plt.title("PageRank Visualization")
 plt.margins(0.2) 
 plt.show()
 
+
     
 ''')
       
 def ans_7():
     print(Fore.RED + '''
 
+# Structural Equivalence
+
+
 library(sna)
 library(igraph)
 
@@ -355,6 +338,42 @@ b <- blockmodel(links2, eq, h=10)
 plot(b)
 
 
+
+
+# Automorphic Equivalence
+
+library(igraph)
+
+links2 <- as.matrix(read.csv("edges.csv", header = TRUE, row.names = 1))
+
+sq <- links2 %*% t(links2)
+diag(sq) <- 0
+sq[sq > 0] <- 1
+
+g <- graph_from_adjacency_matrix(sq, mode = "undirected")
+
+auto <- automorphism_group(g)
+
+print(auto)
+print(auto$orbits)
+
+
+
+
+# Regular Equivalence
+
+library(sna)
+
+links2 <- as.matrix(read.csv("edges.csv", header = TRUE, row.names = 1))
+
+sq <- links2 %*% t(links2)
+diag(sq) <- 0
+
+eq_reg <- equiv.clust(sq, mode = "regular")
+
+plot(eq_reg)
+
+
           ''')
                    
 def ans_8():
@@ -458,6 +477,4 @@ hamming.distance(x, w)
 hamming.distance(z, w)
 hamming.distance(x, z)
 
-
-
 ''')

{stuzha-0.2.7 → stuzha-0.2.8}/stuzha.egg-info/PKG-INFO

@@ -1,5 +1,5 @@
 Metadata-Version: 2.4
 Name: stuzha
-Version: 0.2.7
+Version: 0.2.8
 Requires-Dist: colorama>=0.4.6
 Dynamic: requires-dist