sql-dag-flow 0.6.0__tar.gz → 0.6.1__tar.gz

{sql_dag_flow-0.6.0/src/sql_dag_flow.egg-info → sql_dag_flow-0.6.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: sql-dag-flow
-Version: 0.6.0
+Version: 0.6.1
 Summary: A sophisticated SQL lineage visualization tool for Medallion Architectures.
 Author-email: Flavio Sandoval <dsandovalflavio@gmail.com>
 License: MIT

{sql_dag_flow-0.6.0 → sql_dag_flow-0.6.1}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "sql-dag-flow"
-version = "0.6.0"
+version = "0.6.1"
 description = "A sophisticated SQL lineage visualization tool for Medallion Architectures."
 readme = "README.md"
 requires-python = ">=3.8"

{sql_dag_flow-0.6.0 → sql_dag_flow-0.6.1}/src/sql_dag_flow/main.py

@@ -60,11 +60,22 @@ def get_graph(dialect: str = "bigquery", discovery: bool = False, expanded_nodes
     if not os.path.exists(CURRENT_DIRECTORY):
         return {"nodes": [], "edges": [], "cycles": [], "error": "Directory not found"}
         
-    exp_nodes_list = [n.strip() for n in expanded_nodes.split(",")] if expanded_nodes else []
+    # Parse expanded_nodes as dict {node_id: mode}
+    exp_nodes_dict = {}
+    if expanded_nodes:
+        for item in expanded_nodes.split(","):
+            item = item.strip()
+            if not item:
+                continue
+            parts = item.rsplit(":", 1)
+            if len(parts) == 2 and parts[1] in ("all", "external", "cte"):
+                exp_nodes_dict[parts[0]] = parts[1]
+            else:
+                exp_nodes_dict[item] = "all"
     visible_list = [n.strip() for n in visible_node_ids.split(",")] if visible_node_ids else None
     try:
         tables = _cached_parse(CURRENT_DIRECTORY, None, dialect, visible_node_ids=visible_list)
-        nodes, edges, cycles = build_graph(tables, discovery_mode=discovery, expanded_nodes=exp_nodes_list, discovery_filter=discovery_filter)
+        nodes, edges, cycles = build_graph(tables, discovery_mode=discovery, expanded_nodes=exp_nodes_dict, discovery_filter=discovery_filter)
         return {"nodes": nodes, "edges": edges, "cycles": cycles}
     except Exception as e:
         import traceback
@@ -121,7 +132,10 @@ def get_filtered_graph(data: dict = Body(...)):
     subfolders = data.get("subfolders")
     dialect = data.get("dialect", "bigquery")
     discovery = data.get("discovery", False)
-    expanded_nodes = data.get("expanded_nodes", [])
+    expanded_nodes = data.get("expanded_nodes", {})
+    # Normalize: if frontend sends a list (legacy), convert to dict
+    if isinstance(expanded_nodes, list):
+        expanded_nodes = {n: 'all' for n in expanded_nodes}
     visible_node_ids = data.get("visible_node_ids", None)
     discovery_filter = data.get("discovery_filter", "all")
     

{sql_dag_flow-0.6.0 → sql_dag_flow-0.6.1}/src/sql_dag_flow/parser.py

@@ -830,9 +830,12 @@ def build_graph(tables, discovery_mode=False, expanded_nodes=None, discovery_fil
     Constructs nodes and edges for React Flow.
     If discovery_mode is True, creates 'ghost' nodes for dependencies 
     that are not found in the parsed tables.
-    Also creates ghost nodes for any node whose ID is in expanded_nodes list.
+    expanded_nodes: dict {node_id: 'all'|'external'|'cte'} or list (legacy, treated as 'all').
     discovery_filter: 'all' | 'external' | 'cte' — controls which ghost types to show.
     """
+    # Normalize legacy list format to dict
+    if isinstance(expanded_nodes, list):
+        expanded_nodes = {n: 'all' for n in expanded_nodes}
     nodes = []
     edges = []
     
@@ -891,7 +894,8 @@ def build_graph(tables, discovery_mode=False, expanded_nodes=None, discovery_fil
                          cte_name = ":".join(parts[2:])
                          cte_internal_deps = tables[source_id].get("cte_deps", {}).get(cte_name, {})
                          
-                         if (discovery_mode and discovery_filter in ('all', 'cte')) or (expanded_nodes and source_id in expanded_nodes):
+                         expand_mode = expanded_nodes.get(source_id, None) if expanded_nodes else None
+                         if (discovery_mode and discovery_filter in ('all', 'cte')) or (expand_mode and expand_mode in ('all', 'cte')):
                              # Discovery Mode or Expanded: Create CTE ghost node with incoming edges
                              cte_id = dep
                              
@@ -986,7 +990,8 @@ def build_graph(tables, discovery_mode=False, expanded_nodes=None, discovery_fil
                      continue
 
                  # Handle missing external nodes (discovery mode or expanded node only)
-                 if ((discovery_mode and discovery_filter in ('all', 'external')) or (expanded_nodes and source_id in expanded_nodes)) and not target_id:
+                 expand_mode_ext = expanded_nodes.get(source_id, None) if expanded_nodes else None
+                 if ((discovery_mode and discovery_filter in ('all', 'external')) or (expand_mode_ext and expand_mode_ext in ('all', 'external'))) and not target_id:
                          # Create a unique ID for the missing node
                          # Use the full dependency name as the ID
                          ghost_id = dep