risk-network 0.0.6b5__py3-none-any.whl → 0.0.6b7__py3-none-any.whl

risk/__init__.py

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

risk/network/plot.py

@@ -274,7 +274,7 @@ class NetworkPlotter:
 
     def plot_subnetwork(
         self,
-        nodes: List,
+        nodes: Union[List, Tuple, np.ndarray],
         node_size: Union[int, np.ndarray] = 50,
         node_shape: str = "o",
         node_edgewidth: float = 1.0,
@@ -288,20 +288,24 @@ class NetworkPlotter:
         """Plot a subnetwork of selected nodes with customizable node and edge attributes.
 
         Args:
-            nodes (list): List of node labels to include in the subnetwork.
+            nodes (list, tuple, or np.ndarray): List of node labels to include in the subnetwork. Accepts nested lists.
             node_size (int or np.ndarray, optional): Size of the nodes. Can be a single integer or an array of sizes. Defaults to 50.
             node_shape (str, optional): Shape of the nodes. Defaults to "o".
             node_edgewidth (float, optional): Width of the node edges. Defaults to 1.0.
             edge_width (float, optional): Width of the edges. Defaults to 1.0.
-            node_color (str, list, tuple, or np.ndarray, optional): Color of the nodes. Can be a single color or an array of colors. Defaults to "white".
+            node_color (str, list, tuple, or np.ndarray, optional): Color of the nodes. Defaults to "white".
             node_edgecolor (str, list, tuple, or np.ndarray, optional): Color of the node edges. Defaults to "black".
             edge_color (str, list, tuple, or np.ndarray, optional): Color of the edges. Defaults to "black".
-            node_alpha (float, optional): Alpha value (transparency) for the nodes. Defaults to 1.0.
-            edge_alpha (float, optional): Alpha value (transparency) for the edges. Defaults to 1.0.
+            node_alpha (float, optional): Transparency for the nodes. Defaults to 1.0.
+            edge_alpha (float, optional): Transparency for the edges. Defaults to 1.0.
 
         Raises:
             ValueError: If no valid nodes are found in the network graph.
         """
+        # Flatten nested lists of nodes, if necessary
+        if any(isinstance(item, (list, tuple, np.ndarray)) for item in nodes):
+            nodes = [node for sublist in nodes for node in sublist]
+
         # Filter to get node IDs and their coordinates
         node_ids = [
             self.graph.node_label_to_id_map.get(node)
@@ -407,7 +411,7 @@ class NetworkPlotter:
 
     def plot_subcontour(
         self,
-        nodes: List,
+        nodes: Union[List, Tuple, np.ndarray],
         levels: int = 5,
         bandwidth: float = 0.8,
         grid_size: int = 250,
@@ -417,10 +421,10 @@ class NetworkPlotter:
         alpha: float = 1.0,
         fill_alpha: float = 0.2,
     ) -> None:
-        """Plot a subcontour for a given set of nodes using Kernel Density Estimation (KDE).
+        """Plot a subcontour for a given set of nodes or a list of node sets using Kernel Density Estimation (KDE).
 
         Args:
-            nodes (list): List of node labels to plot the contour for.
+            nodes (list, tuple, or np.ndarray): List of node labels or list of lists of node labels to plot the contour for.
             levels (int, optional): Number of contour levels to plot. Defaults to 5.
             bandwidth (float, optional): Bandwidth for KDE. Controls the smoothness of the contour. Defaults to 0.8.
             grid_size (int, optional): Resolution of the grid for KDE. Higher values create finer contours. Defaults to 250.
@@ -433,33 +437,45 @@ class NetworkPlotter:
         Raises:
             ValueError: If no valid nodes are found in the network graph.
         """
-        # Don't log subcontour parameters as they are specific to individual annotations
-        # Filter to get node IDs and their coordinates
-        node_ids = [
-            self.graph.node_label_to_id_map.get(node)
-            for node in nodes
-            if node in self.graph.node_label_to_id_map
-        ]
-        if not node_ids or len(node_ids) == 1:
-            raise ValueError("No nodes found in the network graph or insufficient nodes to plot.")
+        # Check if nodes is a list of lists or a flat list
+        if any(isinstance(item, (list, tuple, np.ndarray)) for item in nodes):
+            # If it's a list of lists, iterate over sublists
+            node_groups = nodes
+        else:
+            # If it's a flat list of nodes, treat it as a single group
+            node_groups = [nodes]
 
         # Convert color to RGBA using the _to_rgba helper function
-        color = _to_rgba(color, alpha)
-        # Draw the KDE contour for the specified nodes
-        node_coordinates = self.graph.node_coordinates
-        self._draw_kde_contour(
-            self.ax,
-            node_coordinates,
-            node_ids,
-            color=color,
-            levels=levels,
-            bandwidth=bandwidth,
-            grid_size=grid_size,
-            linestyle=linestyle,
-            linewidth=linewidth,
-            alpha=alpha,
-            fill_alpha=fill_alpha,
-        )
+        color_rgba = _to_rgba(color, alpha)
+
+        # Iterate over each group of nodes (either sublists or flat list)
+        for sublist in node_groups:
+            # Filter to get node IDs and their coordinates for each sublist
+            node_ids = [
+                self.graph.node_label_to_id_map.get(node)
+                for node in sublist
+                if node in self.graph.node_label_to_id_map
+            ]
+            if not node_ids or len(node_ids) == 1:
+                raise ValueError(
+                    "No nodes found in the network graph or insufficient nodes to plot."
+                )
+
+            # Draw the KDE contour for the specified nodes
+            node_coordinates = self.graph.node_coordinates
+            self._draw_kde_contour(
+                self.ax,
+                node_coordinates,
+                node_ids,
+                color=color_rgba,
+                levels=levels,
+                bandwidth=bandwidth,
+                grid_size=grid_size,
+                linestyle=linestyle,
+                linewidth=linewidth,
+                alpha=alpha,
+                fill_alpha=fill_alpha,
+            )
 
     def _draw_kde_contour(
         self,
@@ -550,6 +566,7 @@ class NetworkPlotter:
         fontcolor: Union[str, List, Tuple, np.ndarray] = "black",
         fontalpha: float = 1.0,
         arrow_linewidth: float = 1,
+        arrow_style: str = "->",
         arrow_color: Union[str, List, Tuple, np.ndarray] = "black",
         arrow_alpha: float = 1.0,
         max_labels: Union[int, None] = None,
@@ -557,7 +574,10 @@ class NetworkPlotter:
         min_words: int = 1,
         max_word_length: int = 20,
         min_word_length: int = 1,
-        words_to_omit: Union[List[str], None] = None,
+        words_to_omit: Union[List, None] = None,
+        overlay_ids: bool = False,
+        ids_to_keep: Union[List, Tuple, np.ndarray, None] = None,
+        ids_to_replace: Union[Dict, None] = None,
     ) -> None:
         """Annotate the network graph with labels for different domains, positioned around the network for clarity.
 
@@ -569,6 +589,7 @@ class NetworkPlotter:
             fontcolor (str, list, tuple, or np.ndarray, optional): Color of the label text. Can be a string or RGBA array. Defaults to "black".
             fontalpha (float, optional): Transparency level for the font color. Defaults to 1.0.
             arrow_linewidth (float, optional): Line width of the arrows pointing to centroids. Defaults to 1.
+            arrow_style (str, optional): Style of the arrows pointing to centroids. Defaults to "->".
             arrow_color (str, list, tuple, or np.ndarray, optional): Color of the arrows. Defaults to "black".
             arrow_alpha (float, optional): Transparency level for the arrow color. Defaults to 1.0.
             max_labels (int, optional): Maximum number of labels to plot. Defaults to None (no limit).
@@ -576,7 +597,16 @@ class NetworkPlotter:
             min_words (int, optional): Minimum number of words required to display a label. Defaults to 1.
             max_word_length (int, optional): Maximum number of characters in a word to display. Defaults to 20.
             min_word_length (int, optional): Minimum number of characters in a word to display. Defaults to 1.
-            words_to_omit (List[str], optional): List of words to omit from the labels. Defaults to None.
+            words_to_omit (List, optional): List of words to omit from the labels. Defaults to None.
+            overlay_ids (bool, optional): Whether to overlay domain IDs in the center of the centroids. Defaults to False.
+            ids_to_keep (list, tuple, np.ndarray, or None, optional): IDs of domains that must be labeled. To discover domain IDs,
+                you can set `overlay_ids=True`. Defaults to None.
+            ids_to_replace (dict, optional): A dictionary mapping domain IDs to custom labels (strings). The labels should be space-separated words.
+                If provided, the custom labels will replace the default domain terms. To discover domain IDs, you can set `overlay_ids=True`.
+                Defaults to None.
+
+        Raises:
+            ValueError: If the number of provided `ids_to_keep` exceeds `max_labels`.
         """
         # Log the plotting parameters
         params.log_plotter(
@@ -589,6 +619,7 @@ class NetworkPlotter:
             ),  # np.ndarray usually indicates custom colors
             label_fontalpha=fontalpha,
             label_arrow_linewidth=arrow_linewidth,
+            label_arrow_style=arrow_style,
             label_arrow_color="custom" if isinstance(arrow_color, np.ndarray) else arrow_color,
             label_arrow_alpha=arrow_alpha,
             label_max_labels=max_labels,
@@ -597,9 +628,16 @@ class NetworkPlotter:
             label_max_word_length=max_word_length,
             label_min_word_length=min_word_length,
             label_words_to_omit=words_to_omit,
+            label_overlay_ids=overlay_ids,
+            label_ids_to_keep=ids_to_keep,
+            label_ids_to_replace=ids_to_replace,
         )
 
-        # Convert colors to RGBA using the _to_rgba helper function, applying alpha separately for font and arrow
+        # Set max_labels to the total number of domains if not provided (None)
+        if max_labels is None:
+            max_labels = len(self.graph.domain_to_nodes_map)
+
+        # Convert colors to RGBA using the _to_rgba helper function
         fontcolor = _to_rgba(fontcolor, fontalpha, num_repeats=len(self.graph.domain_to_nodes_map))
         arrow_color = _to_rgba(
             arrow_color, arrow_alpha, num_repeats=len(self.graph.domain_to_nodes_map)
@@ -615,55 +653,85 @@ class NetworkPlotter:
             if nodes:  # Skip if the domain has no nodes
                 domain_centroids[domain] = self._calculate_domain_centroid(nodes)
 
-        # Initialize empty lists to collect valid indices
+        # Initialize dictionaries and lists for valid indices
         valid_indices = []
         filtered_domain_centroids = {}
         filtered_domain_terms = {}
-        # Loop through domain_centroids with index
-        for idx, (domain, centroid) in enumerate(domain_centroids.items()):
-            # Process the domain term
-            terms = self.graph.trimmed_domain_to_term[domain].split(" ")
-            # Remove words_to_omit
-            if words_to_omit:
-                terms = [term for term in terms if term.lower() not in words_to_omit]
-            # Filter words based on length
-            terms = [term for term in terms if min_word_length <= len(term) <= max_word_length]
-            # Trim to max_words
-            terms = terms[:max_words]
-            # Check if the domain passes the word count condition
-            if len(terms) >= min_words:
-                # Add to filtered_domain_centroids
-                filtered_domain_centroids[domain] = centroid
-                # Store the filtered and trimmed terms
-                filtered_domain_terms[domain] = " ".join(terms)
-                # Keep track of the valid index - used for fontcolor and arrow_color
-                valid_indices.append(idx)
-
-        # If max_labels is specified and less than the available labels
-        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())
-                if i in selected_indices
-            }
-            filtered_domain_terms = {
-                k: v
-                for i, (k, v) in enumerate(filtered_domain_terms.items())
-                if i in selected_indices
-            }
-            # Update valid_indices to match selected indices
-            valid_indices = [valid_indices[i] for i in selected_indices]
+        # Handle the ids_to_keep logic
+        if ids_to_keep:
+            # Convert ids_to_keep to remove accidental duplicates
+            ids_to_keep = set(ids_to_keep)
+            # Check if the number of provided ids_to_keep exceeds max_labels
+            if max_labels is not None and len(ids_to_keep) > max_labels:
+                raise ValueError(
+                    f"Number of provided IDs ({len(ids_to_keep)}) exceeds max_labels ({max_labels})."
+                )
+
+            # Process the specified IDs first
+            for domain in ids_to_keep:
+                if domain in self.graph.trimmed_domain_to_term and domain in domain_centroids:
+                    # Handle ids_to_replace logic here for ids_to_keep
+                    if ids_to_replace and domain in ids_to_replace:
+                        terms = ids_to_replace[domain].split(" ")
+                    else:
+                        terms = self.graph.trimmed_domain_to_term[domain].split(" ")
+
+                    # Apply words_to_omit, word length constraints, and max_words
+                    if words_to_omit:
+                        terms = [term for term in terms if term.lower() not in words_to_omit]
+                    terms = [
+                        term for term in terms if min_word_length <= len(term) <= max_word_length
+                    ]
+                    terms = terms[:max_words]
+
+                    # Check if the domain passes the word count condition
+                    if len(terms) >= min_words:
+                        filtered_domain_centroids[domain] = domain_centroids[domain]
+                        filtered_domain_terms[domain] = " ".join(terms)
+                        valid_indices.append(
+                            list(domain_centroids.keys()).index(domain)
+                        )  # Track the valid index
+
+        # Calculate remaining labels to plot after processing ids_to_keep
+        remaining_labels = (
+            max_labels - len(ids_to_keep) if ids_to_keep and max_labels else max_labels
+        )
+        # Process remaining domains to fill in additional labels, if there are slots left
+        if remaining_labels and remaining_labels > 0:
+            for idx, (domain, centroid) in enumerate(domain_centroids.items()):
+                if ids_to_keep and domain in ids_to_keep:
+                    continue  # Skip domains already handled by ids_to_keep
+
+                # Handle ids_to_replace logic first
+                if ids_to_replace and domain in ids_to_replace:
+                    terms = ids_to_replace[domain].split(" ")
+                else:
+                    terms = self.graph.trimmed_domain_to_term[domain].split(" ")
+
+                # Apply words_to_omit, word length constraints, and max_words
+                if words_to_omit:
+                    terms = [term for term in terms if term.lower() not in words_to_omit]
+
+                terms = [term for term in terms if min_word_length <= len(term) <= max_word_length]
+                terms = terms[:max_words]
+                # Check if the domain passes the word count condition
+                if len(terms) >= min_words:
+                    filtered_domain_centroids[domain] = centroid
+                    filtered_domain_terms[domain] = " ".join(terms)
+                    valid_indices.append(idx)  # Track the valid index
+
+                # Stop once we've reached the max_labels limit
+                if len(filtered_domain_centroids) >= max_labels:
+                    break
 
         # Calculate the bounding box around the network
         center, radius = _calculate_bounding_box(self.graph.node_coordinates, radius_margin=scale)
-        # Calculate the best positions for labels around the perimeter
+        # Calculate the best positions for labels
         best_label_positions = _calculate_best_label_positions(
             filtered_domain_centroids, center, radius, offset
         )
-        # Annotate the network with labels - valid_indices is used for fontcolor and arrow_color
+
+        # Annotate the network with labels
         for idx, (domain, pos) in zip(valid_indices, best_label_positions.items()):
             centroid = filtered_domain_centroids[domain]
             annotations = filtered_domain_terms[domain].split(" ")[:max_words]
@@ -677,12 +745,27 @@ class NetworkPlotter:
                 fontsize=fontsize,
                 fontname=font,
                 color=fontcolor[idx],
-                arrowprops=dict(arrowstyle="->", color=arrow_color[idx], linewidth=arrow_linewidth),
+                arrowprops=dict(
+                    arrowstyle=arrow_style, color=arrow_color[idx], linewidth=arrow_linewidth
+                ),
             )
+            # Overlay domain ID at the centroid if requested
+            if overlay_ids:
+                self.ax.text(
+                    centroid[0],
+                    centroid[1],
+                    domain,
+                    ha="center",
+                    va="center",
+                    fontsize=fontsize,
+                    fontname=font,
+                    color=fontcolor[idx],
+                    alpha=fontalpha,
+                )
 
     def plot_sublabel(
         self,
-        nodes: List,
+        nodes: Union[List, Tuple, np.ndarray],
         label: str,
         radial_position: float = 0.0,
         scale: float = 1.05,
@@ -692,13 +775,14 @@ class NetworkPlotter:
         fontcolor: Union[str, List, Tuple, np.ndarray] = "black",
         fontalpha: float = 1.0,
         arrow_linewidth: float = 1,
+        arrow_style: str = "->",
         arrow_color: Union[str, List, Tuple, np.ndarray] = "black",
         arrow_alpha: float = 1.0,
     ) -> None:
-        """Annotate the network graph with a single label for the given nodes, positioned at a specified radial angle.
+        """Annotate the network graph with a label for the given nodes, with one arrow pointing to each centroid of sublists of nodes.
 
         Args:
-            nodes (List[str]): List of node labels to be used for calculating the centroid.
+            nodes (list, tuple, or np.ndarray): List of node labels or list of lists of node labels.
             label (str): The label to be annotated on the network.
             radial_position (float, optional): Radial angle for positioning the label, in degrees (0-360). Defaults to 0.0.
             scale (float, optional): Scale factor for positioning the label around the perimeter. Defaults to 1.05.
@@ -708,24 +792,22 @@ class NetworkPlotter:
             fontcolor (str, list, tuple, or np.ndarray, optional): Color of the label text. Defaults to "black".
             fontalpha (float, optional): Transparency level for the font color. Defaults to 1.0.
             arrow_linewidth (float, optional): Line width of the arrow pointing to the centroid. Defaults to 1.
+            arrow_style (str, optional): Style of the arrows pointing to the centroid. Defaults to "->".
             arrow_color (str, list, tuple, or np.ndarray, optional): Color of the arrow. Defaults to "black".
             arrow_alpha (float, optional): Transparency level for the arrow color. Defaults to 1.0.
         """
-        # Don't log sublabel parameters as they are specific to individual annotations
-        # Map node labels to IDs
-        node_ids = [
-            self.graph.node_label_to_id_map.get(node)
-            for node in nodes
-            if node in self.graph.node_label_to_id_map
-        ]
-        if not node_ids or len(node_ids) == 1:
-            raise ValueError("No nodes found in the network graph or insufficient nodes to plot.")
-
-        # Convert fontcolor and arrow_color to RGBA using the _to_rgba helper function
-        fontcolor = _to_rgba(fontcolor, fontalpha)
-        arrow_color = _to_rgba(arrow_color, arrow_alpha)
-        # Calculate the centroid of the provided nodes
-        centroid = self._calculate_domain_centroid(node_ids)
+        # Check if nodes is a list of lists or a flat list
+        if any(isinstance(item, (list, tuple, np.ndarray)) for item in nodes):
+            # If it's a list of lists, iterate over sublists
+            node_groups = nodes
+        else:
+            # If it's a flat list of nodes, treat it as a single group
+            node_groups = [nodes]
+
+        # Convert fontcolor and arrow_color to RGBA
+        fontcolor_rgba = _to_rgba(fontcolor, fontalpha)
+        arrow_color_rgba = _to_rgba(arrow_color, arrow_alpha)
+
         # Calculate the bounding box around the network
         center, radius = _calculate_bounding_box(self.graph.node_coordinates, radius_margin=scale)
         # Convert radial position to radians, adjusting for a 90-degree rotation
@@ -735,19 +817,36 @@ class NetworkPlotter:
             center[1] + (radius + offset) * np.sin(radial_radians),
         )
 
-        # Annotate the network with the label
-        self.ax.annotate(
-            label,
-            xy=centroid,
-            xytext=label_position,
-            textcoords="data",
-            ha="center",
-            va="center",
-            fontsize=fontsize,
-            fontname=font,
-            color=fontcolor,
-            arrowprops=dict(arrowstyle="->", color=arrow_color, linewidth=arrow_linewidth),
-        )
+        # Iterate over each group of nodes (either sublists or flat list)
+        for sublist in node_groups:
+            # Map node labels to IDs
+            node_ids = [
+                self.graph.node_label_to_id_map.get(node)
+                for node in sublist
+                if node in self.graph.node_label_to_id_map
+            ]
+            if not node_ids or len(node_ids) == 1:
+                raise ValueError(
+                    "No nodes found in the network graph or insufficient nodes to plot."
+                )
+
+            # Calculate the centroid of the provided nodes in this sublist
+            centroid = self._calculate_domain_centroid(node_ids)
+            # Annotate the network with the label and an arrow pointing to each centroid
+            self.ax.annotate(
+                label,
+                xy=centroid,
+                xytext=label_position,
+                textcoords="data",
+                ha="center",
+                va="center",
+                fontsize=fontsize,
+                fontname=font,
+                color=fontcolor_rgba,
+                arrowprops=dict(
+                    arrowstyle=arrow_style, color=arrow_color_rgba, linewidth=arrow_linewidth
+                ),
+            )
 
     def _calculate_domain_centroid(self, nodes: List) -> tuple:
         """Calculate the most centrally located node in .

{risk_network-0.0.6b5.dist-info → risk_network-0.0.6b7.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: risk-network
-Version: 0.0.6b5
+Version: 0.0.6b7
 Summary: A Python package for biological network analysis
 Author: Ira Horecka
 Author-email: Ira Horecka <ira89@icloud.com>

{risk_network-0.0.6b5.dist-info → risk_network-0.0.6b7.dist-info}/RECORD

@@ -1,4 +1,4 @@
-risk/__init__.py,sha256=jf5xP5gj27WAK2wVj_hGCCzypgykcOCBS7791xT2wDA,112
+risk/__init__.py,sha256=DLDQBVlM5oYOp-S9i1GDq-rRwaNv1dutx241xcHbK3w,112
 risk/constants.py,sha256=XInRaH78Slnw_sWgAsBFbUHkyA0h0jL0DKGuQNbOvjM,550
 risk/risk.py,sha256=PONl5tzN5DSVUf4MgczfOvzGV-5JoAOLTQ6YWl10mZ8,20697
 risk/annotations/__init__.py,sha256=vUpVvMRE5if01Ic8QY6M2Ae3EFGJHdugEe9PdEkAW4Y,138
@@ -15,7 +15,7 @@ risk/network/__init__.py,sha256=iEPeJdZfqp0toxtbElryB8jbz9_t_k4QQ3iDvKE8C_0,126
 risk/network/geometry.py,sha256=H1yGVVqgbfpzBzJwEheDLfvGLSA284jGQQTn612L4Vc,6759
 risk/network/graph.py,sha256=scPFQIJjioup1FjQLyxNrAB17RmskY9MmvoFHrMlqNI,13135
 risk/network/io.py,sha256=gG50kOknO-D3HkW1HsbHMkTMvjUtn3l4W4Jwd-rXNr8,21202
-risk/network/plot.py,sha256=j9e_9kV5VMMpsBwtIx_QqlUJnFHXIFlnO8RLWqNiEog,55852
+risk/network/plot.py,sha256=4zcFJWZgGrj7AG1crRuwGpzzjjHXjQ8Eh5VjlkOQblE,60747
 risk/stats/__init__.py,sha256=e-BE_Dr_jgiK6hKM-T-tlG4yvHnId8e5qjnM0pdwNVc,230
 risk/stats/fisher_exact.py,sha256=-bPwzu76-ob0HzrTV20mXUTot7v-MLuqFaAoab-QxPg,4966
 risk/stats/hypergeom.py,sha256=lrIFdhCWRjvM4apYw1MlOKqT_IY5OjtCwrjdtJdt6Tg,4954
@@ -23,8 +23,8 @@ risk/stats/stats.py,sha256=kvShov-94W6ffgDUTb522vB9hDJQSyTsYif_UIaFfSM,7059
 risk/stats/permutation/__init__.py,sha256=neJp7FENC-zg_CGOXqv-iIvz1r5XUKI9Ruxhmq7kDOI,105
 risk/stats/permutation/permutation.py,sha256=qLWdwxEY6nmkYPxpM8HLDcd2mbqYv9Qr7CKtJvhLqIM,9220
 risk/stats/permutation/test_functions.py,sha256=HuDIM-V1jkkfE1rlaIqrWWBSKZt3dQ1f-YEDjWpnLSE,2343
-risk_network-0.0.6b5.dist-info/LICENSE,sha256=jOtLnuWt7d5Hsx6XXB2QxzrSe2sWWh3NgMfFRetluQM,35147
-risk_network-0.0.6b5.dist-info/METADATA,sha256=CNH8nImHfKqJCbvwEApq9r4qIaf2tV8HRU179Jj6njU,43142
-risk_network-0.0.6b5.dist-info/WHEEL,sha256=cVxcB9AmuTcXqmwrtPhNK88dr7IR_b6qagTj0UvIEbY,91
-risk_network-0.0.6b5.dist-info/top_level.txt,sha256=NX7C2PFKTvC1JhVKv14DFlFAIFnKc6Lpsu1ZfxvQwVw,5
-risk_network-0.0.6b5.dist-info/RECORD,,
+risk_network-0.0.6b7.dist-info/LICENSE,sha256=jOtLnuWt7d5Hsx6XXB2QxzrSe2sWWh3NgMfFRetluQM,35147
+risk_network-0.0.6b7.dist-info/METADATA,sha256=yiCOKKWr1cByfyrssz1g0LLSYLfvUr7XziphQPe2IkA,43142
+risk_network-0.0.6b7.dist-info/WHEEL,sha256=cVxcB9AmuTcXqmwrtPhNK88dr7IR_b6qagTj0UvIEbY,91
+risk_network-0.0.6b7.dist-info/top_level.txt,sha256=NX7C2PFKTvC1JhVKv14DFlFAIFnKc6Lpsu1ZfxvQwVw,5
+risk_network-0.0.6b7.dist-info/RECORD,,