risk-network 0.0.5b5__tar.gz → 0.0.6b0__tar.gz

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: risk-network
-Version: 0.0.5b5
+Version: 0.0.6b0
 Summary: A Python package for biological network analysis
 Author: Ira Horecka
 Author-email: Ira Horecka <ira89@icloud.com>
@@ -710,8 +710,7 @@ Requires-Dist: threadpoolctl
 Requires-Dist: tqdm
 
 <p align="center">
-  <img src="./docs/github/risk-logo-dark.png#gh-dark-mode-only" width="400" />
-  <img src="./docs/github/risk-logo-light.png#gh-light-mode-only" width="400" />
+  <img src="https://i.imgur.com/Fo9EmnK.png" width="400" />
 </p>
 
 <p align="center">
@@ -736,7 +735,7 @@ RISK is a software tool for visualizing spatial relationships in networks. It ai
 
 *Saccharomyces cerevisiae* proteins oriented by physical interactions discovered through affinity enrichment and mass spectrometry (Michaelis et al., 2023).
 
-![PPI Network Demo](./docs/github/network.png)
+![PPI Network Demo](https://i.imgur.com/NnyK6nO.png)
 
 ## Installation
 

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/README.md

@@ -1,6 +1,5 @@
 <p align="center">
-  <img src="./docs/github/risk-logo-dark.png#gh-dark-mode-only" width="400" />
-  <img src="./docs/github/risk-logo-light.png#gh-light-mode-only" width="400" />
+  <img src="https://i.imgur.com/Fo9EmnK.png" width="400" />
 </p>
 
 <p align="center">
@@ -25,7 +24,7 @@ RISK is a software tool for visualizing spatial relationships in networks. It ai
 
 *Saccharomyces cerevisiae* proteins oriented by physical interactions discovered through affinity enrichment and mass spectrometry (Michaelis et al., 2023).
 
-![PPI Network Demo](./docs/github/network.png)
+![PPI Network Demo](https://i.imgur.com/NnyK6nO.png)
 
 ## Installation
 

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/risk/__init__.py

@@ -7,4 +7,4 @@ RISK: RISK Infers Spatial Kinships
 
 from risk.risk import RISK
 
-__version__ = "0.0.5-beta.5"
+__version__ = "0.0.6-beta.0"

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/risk/network/io.py

@@ -418,29 +418,37 @@ class NetworkIO:
         return G
 
     def _remove_invalid_graph_properties(self, G: nx.Graph) -> None:
-        """Remove invalid properties from the graph.
+        """Remove invalid properties from the graph, including self-loops, nodes with fewer edges than
+        the threshold, and isolated nodes.
 
         Args:
             G (nx.Graph): A NetworkX graph object.
         """
-        # First, Remove self-loop edges to ensure correct edge count
+        # Count number of nodes and edges before cleaning
+        num_initial_nodes = G.number_of_nodes()
+        num_initial_edges = G.number_of_edges()
+        # Remove self-loops to ensure correct edge count
         G.remove_edges_from(list(nx.selfloop_edges(G)))
-        # Then, iteratively remove nodes with fewer edges than the specified threshold
+        # Iteratively remove nodes with fewer edges than the threshold
         while True:
-            nodes_to_remove = [
-                node for node in G.nodes() if G.degree(node) < self.min_edges_per_node
-            ]
+            nodes_to_remove = [node for node in G.nodes if G.degree(node) < self.min_edges_per_node]
             if not nodes_to_remove:
-                break  # Exit loop if no more nodes to remove
-
-            # Remove the nodes and their associated edges
+                break  # Exit loop if no more nodes need removal
             G.remove_nodes_from(nodes_to_remove)
 
-        # Optionally: Remove any isolated nodes if needed
+        # Remove isolated nodes
         isolated_nodes = list(nx.isolates(G))
         if isolated_nodes:
             G.remove_nodes_from(isolated_nodes)
 
+        # Log the number of nodes and edges before and after cleaning
+        num_final_nodes = G.number_of_nodes()
+        num_final_edges = G.number_of_edges()
+        print(f"Initial node count: {num_initial_nodes}")
+        print(f"Final node count: {num_final_nodes}")
+        print(f"Initial edge count: {num_initial_edges}")
+        print(f"Final edge count: {num_final_edges}")
+
     def _assign_edge_weights(self, G: nx.Graph) -> None:
         """Assign weights to the edges in the graph.
 
@@ -502,6 +510,7 @@ class NetworkIO:
         print(f"Edge weight: {'Included' if self.include_edge_weight else 'Excluded'}")
         if self.include_edge_weight:
             print(f"Weight label: {self.weight_label}")
+        print(f"Minimum edges per node: {self.min_edges_per_node}")
         print(f"Projection: {'Sphere' if self.compute_sphere else 'Plane'}")
         if self.compute_sphere:
             print(f"Surface depth: {self.surface_depth}")

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/risk/network/plot.py

@@ -494,6 +494,7 @@ class NetworkPlotter:
         if max_labels is not None and max_labels < len(filtered_domain_centroids):
             step = len(filtered_domain_centroids) / max_labels
             selected_indices = [int(i * step) for i in range(max_labels)]
+            # Filter the centroids, terms, and valid_indices to only use the selected indices
             filtered_domain_centroids = {
                 k: v
                 for i, (k, v) in enumerate(filtered_domain_centroids.items())
@@ -504,8 +505,8 @@ class NetworkPlotter:
                 for i, (k, v) in enumerate(filtered_domain_terms.items())
                 if i in selected_indices
             }
-            fontcolor = fontcolor[selected_indices]
-            arrow_color = arrow_color[selected_indices]
+            # Update valid_indices to match selected indices
+            valid_indices = [valid_indices[i] for i in selected_indices]
 
         # Calculate the bounding box around the network
         center, radius = _calculate_bounding_box(
@@ -629,12 +630,16 @@ class NetworkPlotter:
         return domain_central_node
 
     def get_annotated_node_colors(
-        self, nonenriched_color: str = "white", random_seed: int = 888, **kwargs
+        self,
+        nonenriched_color: Union[str, List, Tuple, np.ndarray] = "white",
+        random_seed: int = 888,
+        **kwargs,
     ) -> np.ndarray:
         """Adjust the colors of nodes in the network graph based on enrichment.
 
         Args:
-            nonenriched_color (str, optional): Color for non-enriched nodes. Defaults to "white".
+            nonenriched_color (str, list, tuple, or np.ndarray, optional): Color for non-enriched nodes.
+                Defaults to "white". If an alpha channel is provided, it will be used to darken the RGB values.
             random_seed (int, optional): Seed for random number generation. Defaults to 888.
             **kwargs: Additional keyword arguments for `get_domain_colors`.
 
@@ -647,12 +652,23 @@ class NetworkPlotter:
             # Convert the non-enriched color from string to RGBA
             nonenriched_color = mcolors.to_rgba(nonenriched_color)
 
+        # Ensure nonenriched_color is a NumPy array
+        nonenriched_color = np.array(nonenriched_color)
+        # If alpha is provided (4th value), darken the RGB values based on alpha
+        if len(nonenriched_color) == 4 and nonenriched_color[3] < 1.0:
+            alpha = nonenriched_color[3]
+            # Adjust RGB based on alpha (darken)
+            nonenriched_color[:3] = nonenriched_color[:3] * alpha
+            # Set alpha to 1.0 after darkening the color
+            nonenriched_color[3] = 1.0
+
         # Adjust node colors: replace any fully transparent nodes (enriched) with the non-enriched color
         adjusted_network_colors = np.where(
-            np.all(network_colors == 0, axis=1, keepdims=True),
-            np.array([nonenriched_color]),
-            network_colors,
+            np.all(network_colors[:, :3] == 0, axis=1, keepdims=True),  # Check RGB values only
+            np.array([nonenriched_color]),  # Apply the non-enriched color (with adjusted alpha)
+            network_colors,  # Keep the original colors
         )
+
         return adjusted_network_colors
 
     def get_annotated_node_sizes(

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/risk_network.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: risk-network
-Version: 0.0.5b5
+Version: 0.0.6b0
 Summary: A Python package for biological network analysis
 Author: Ira Horecka
 Author-email: Ira Horecka <ira89@icloud.com>
@@ -710,8 +710,7 @@ Requires-Dist: threadpoolctl
 Requires-Dist: tqdm
 
 <p align="center">
-  <img src="./docs/github/risk-logo-dark.png#gh-dark-mode-only" width="400" />
-  <img src="./docs/github/risk-logo-light.png#gh-light-mode-only" width="400" />
+  <img src="https://i.imgur.com/Fo9EmnK.png" width="400" />
 </p>
 
 <p align="center">
@@ -736,7 +735,7 @@ RISK is a software tool for visualizing spatial relationships in networks. It ai
 
 *Saccharomyces cerevisiae* proteins oriented by physical interactions discovered through affinity enrichment and mass spectrometry (Michaelis et al., 2023).
 
-![PPI Network Demo](./docs/github/network.png)
+![PPI Network Demo](https://i.imgur.com/NnyK6nO.png)
 
 ## Installation
 

{risk_network-0.0.5b5 → risk_network-0.0.6b0}/risk/constants.py

@@ -3,6 +3,8 @@ risk/constants
 ~~~~~~~~~~~~~~
 """
 
+GROUP_LINKAGE_METHODS = ["single", "complete", "average", "weighted", "centroid", "median", "ward"]
+
 GROUP_DISTANCE_METRICS = [
     "braycurtis",
     "canberra",
@@ -27,5 +29,3 @@ GROUP_DISTANCE_METRICS = [
     "sqeuclidean",
     "yule",
 ]
-
-GROUP_LINKAGE_METHODS = ["single", "complete", "average", "weighted", "centroid", "median", "ward"]