Create app.py

app.py

@@ -0,0 +1,92 @@
+import streamlit as st
+import networkx as nx
+from pyvis.network import Network
+import pickle
+import math
+
+# Load the graph from a pickle file
+@st.cache_resource
+def load_graph():
+    with open('drumeo_multi_student_graph_labels.pkl', 'rb') as f:
+        return pickle.load(f)
+
+def dynamic_visualize_graph(graph, start_node, layers=3, top_k=5):
+    net = Network(notebook=False, width="100%", height="600px", directed=True)
+    net.set_options("""
+    var options = {
+      "physics": {
+        "barnesHut": {
+          "gravitationalConstant": -20000,
+          "centralGravity": 0.6
+        } 
+      }
+      }
+      """)
+
+
+
+    visited_nodes = set()
+    current_nodes = [int(start_node)]  # Convert start_node to int
+    # Add the starting node, color it red, and include a tooltip
+    start_title = graph.nodes[int(start_node)].get('title', 'No title available')  # Get the title attribute
+    if isinstance(start_title, float) and math.isnan(start_title):  # Check if the title is NaN
+        start_title = "No title available"
+    net.add_node(int(start_node), label=str(start_node), color="red", title=start_title)
+    visited_nodes.add(int(start_node))
+
+    for layer in range(layers):
+        next_nodes = []
+        for node in current_nodes:
+            neighbors = sorted(
+                [(int(neighbor), data['weight']) for neighbor, data in graph[node].items()],
+                key=lambda x: x[1],
+                reverse=True
+            )[:top_k]  # Get top_k neighbors for this node
+
+            for neighbor, weight in neighbors:
+                if neighbor not in visited_nodes:
+                    neighbor_title = graph.nodes[neighbor].get('title', 'No title available')
+                    if isinstance(neighbor_title, float) and math.isnan(neighbor_title):  # Check if the title is NaN
+                        neighbor_title = "No title available"
+                    if not isinstance(neighbor_title, str):
+                        neighbor_title = str(neighbor_title)  # Ensure it's converted to a string
+                    net.add_node(neighbor, label=str(neighbor), title=neighbor_title)
+
+                net.add_edge(node, neighbor, label=f"w:{weight}")  # Add the edge regardless of visited status
+                visited_nodes.add(neighbor)
+                next_nodes.append(neighbor)  # Always add to next_nodes for further expansion
+
+        current_nodes = next_nodes  # Move to the next layer
+
+    # Generate the final visualization
+    html_content = net.generate_html()
+    st.components.v1.html(html_content, height=600, scrolling=False)
+
+
+# Streamlit interface
+st.title("Interactive Graph Expansion with Tooltips")
+
+# Load the graph
+G = load_graph()
+
+import random
+# Randomly sample a starting node
+# Initialize session state for the starting node
+if "start_node" not in st.session_state:
+    st.session_state.start_node = random.choice(list(G.nodes))  # Randomly select a node once
+
+# Input: Starting node
+start_node = st.number_input(
+    "Enter the starting node ID:",
+    value=st.session_state.start_node,
+    step=1
+)
+layers = st.slider("Depth to explore:", 1, 6, value=3)
+top_k = st.slider("Branching factor (per node):", 1, 6, value=3)
+
+# Trigger the visualization
+if st.button("Expand Graph"):
+    if start_node in G:
+        dynamic_visualize_graph(G, start_node, layers=layers, top_k=top_k)
+    else:
+        st.error("The starting node is not in the graph!")