kececilayout 0.4.3__py3-none-any.whl → 0.4.5__py3-none-any.whl

kececilayout/__init__.py

@@ -10,7 +10,7 @@ import inspect
 import warnings
 
 # Paket sürüm numarası
-__version__ = "0.4.3"
+__version__ = "0.4.5"
 
 # =============================================================================
 # OTOMATİK İÇE AKTARMA VE __all__ OLUŞTURMA
@@ -141,3 +141,5 @@ def old_function_placeholder():
 
 
 
+
+

kececilayout/_version.py

@@ -1,14 +1,9 @@
 # _version.py
 
-__version__ = "0.4.3"
+__version__ = "0.4.5"
 __license__ = "MIT"
 __description__ = "A deterministic node placement algorithm used in graph visualization. In this layout, nodes are arranged sequentially along a defined primary axis. Each subsequent node is then alternately offset along a secondary, perpendicular axis, typically moving to one side of the primary axis and then the other. Often, the magnitude of this secondary offset increases as nodes progress along the primary axis, creating a characteristic zig-zag or serpentine pattern."
 __author__ = "Mehmet Keçeci"
 __url__ = "https://github.com/WhiteSymmetry/kececilayout"
 __docs__ = "https://github.com/WhiteSymmetry/kececilayout"  # Opsiyonel: Dokümantasyon linki
 __dependencies__ = ["python>=3.10"]  # Diğer bağımlılıkları da ekleyebilirsiniz
-
-
-
-
-

{kececilayout-0.4.3.dist-info → kececilayout-0.4.5.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: kececilayout
-Version: 0.4.3
+Version: 0.4.5
 Summary: Çeşitli graf kütüphaneleri için sıralı-zigzag yerleşimleri sağlayan bir Python paketi.
 Home-page: https://github.com/WhiteSymmetry/kececilayout
 Author: Mehmet Keçeci
@@ -48,7 +48,7 @@ Requires-Dist: pytest; extra == "test"
 Requires-Dist: pytest-cov; extra == "test"
 Requires-Dist: pytest-mock; extra == "test"
 Requires-Dist: ruff; extra == "test"
-Requires-Dist: igraph; extra == "test"
+Requires-Dist: python-igraph; extra == "test"
 Requires-Dist: python-louvain; extra == "test"
 Requires-Dist: rustworkx; extra == "test"
 Requires-Dist: networkit; extra == "test"
@@ -140,11 +140,11 @@ import matplotlib.pyplot as plt
 import kececilayout as kl
 
 G = nx.path_graph(10)
-pos = kl.kececi_layout_v4(
+pos = kl.kececi_layout(
     G,
     primary_spacing=1.0,
     secondary_spacing=0.5,
-    primary_direction='top-down',
+    primary_direction='top_down',
     secondary_start='right'
 )
 
@@ -162,14 +162,51 @@ plt.show()
 ```python
 import igraph as ig
 import matplotlib.pyplot as plt
-from kececilayout import kececi_layout_v4_igraph
+import kececilayout as kl
 
 G = ig.Graph.Ring(10, circular=False)
-pos_list = kececi_layout_v4_igraph(G, primary_direction='left-to-right', secondary_start='up')
+
+# Get the positions using kececi_layout with proper conversion
+try:
+    # Method 1: Direct conversion
+    pos = kl.kececi_layout(G, primary_direction='left-to-right', secondary_start='up')
+    
+    # If pos is not iterable, it might be returning an error code
+    if not hasattr(pos, '__iter__'):
+        raise TypeError("kececi_layout returned non-iterable object")
+        
+except (TypeError, AttributeError) as e:
+    print(f"Direct approach failed: {e}")
+    print("Using NetworkX conversion method...")
+    
+    # Method 2: Convert to NetworkX first
+    import networkx as nx
+    nx_graph = nx.Graph()
+    nx_graph.add_nodes_from(range(G.vcount()))
+    nx_graph.add_edges_from(G.get_edgelist())
+    
+    pos = kl.kececi_layout(nx_graph, primary_direction='left-to-right', secondary_start='up')
+
+# Ensure we have proper coordinates
+if isinstance(pos, dict):
+    # Convert dictionary to list
+    pos_list = [pos[i] for i in range(G.vcount())]
+else:
+    # Assume it's already a list of coordinates
+    pos_list = pos
+
 layout = ig.Layout(pos_list)
 
 fig, ax = plt.subplots(figsize=(8, 6))
-ig.plot(G, target=ax, layout=layout, vertex_label=[f"N{i}" for i in range(10)])
+ig.plot(G, 
+        target=ax, 
+        layout=layout, 
+        vertex_label=[f"N{i}" for i in range(G.vcount())],
+        vertex_size=30,
+        edge_width=2,
+        margin=50)
+
+ax.set_title("Keçeci Layout with igraph")
 ax.set_aspect('equal')
 plt.show()
 ```
@@ -179,13 +216,94 @@ plt.show()
 #### Example with RustworkX
 
 ```python
+import matplotlib.pyplot as plt
+from matplotlib.collections import LineCollection # Efficient edge drawing
+import math
 import rustworkx as rx
 import kececilayout as kl
-import matplotlib.pyplot as plt
+import random
+
+
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
+
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph
+
+# === Rustworkx Example ===
+try:
+    import rustworkx as rx
+    print("\n--- Rustworkx Example ---")
+
+    # Generate graph (Path graph)
+    G_rx = rx.generators.path_graph(N_NODES)
+    print(f"Rustworkx graph generated: {G_rx.num_nodes()} nodes, {G_rx.num_edges()} edges")
+
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function from the imported module
+    pos_rx = kl.kececi_layout_v4(G_rx, **LAYOUT_PARAMS)
+    # print("Rustworkx positions:", pos_rx) # Debug print if needed
+
+    # Plot using Matplotlib directly (Rustworkx doesn't have a built-in draw)
+    print("Plotting graph using Matplotlib...")
+    plt.figure(figsize=(6, 8))
+    ax = plt.gca() # Get current axes
+
+    node_indices_rx = G_rx.node_indices() # Get node indices [0, 1, ...]
+
+    # Check if all nodes have positions
+    if not all(idx in pos_rx for idx in node_indices_rx):
+         print("ERROR: Rustworkx positions dictionary does not cover all nodes!")
+         # Decide how to handle: exit, plot partial, etc.
+    else:
+        # Draw nodes
+        x_coords_rx = [pos_rx[i][0] for i in node_indices_rx]
+        y_coords_rx = [pos_rx[i][1] for i in node_indices_rx]
+        ax.scatter(x_coords_rx, y_coords_rx, s=700, c='#88CCEE', zorder=2, label='Nodes') # Skyblue color
+
+        # Draw labels
+        for i in node_indices_rx:
+            ax.text(pos_rx[i][0], pos_rx[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)
 
-G = rx.generators.path_graph(10)
-pos = kl.kececi_layout_v4(G, primary_direction='bottom-up')
-# Use matplotlib for drawing (see full example in repo)
+        # Draw edges using LineCollection for efficiency
+        edge_lines = []
+        for u, v in G_rx.edge_list(): # Get list of edges (node index pairs)
+            if u in pos_rx and v in pos_rx:
+                # Segment format: [(x1, y1), (x2, y2)]
+                edge_lines.append([pos_rx[u], pos_rx[v]])
+            else:
+                print(f"Warning: Position not found for edge ({u},{v}) in Rustworkx graph.")
+
+        if edge_lines:
+            lc = LineCollection(edge_lines, colors='gray', linewidths=1.0, zorder=1, label='Edges')
+            ax.add_collection(lc) # Add edges to the plot axes
+
+    plt.title(f"Rustworkx ({N_NODES} Nodes) with Keçeci Layout (Matplotlib)") # Plot title
+    plt.xlabel("X Coordinate") # X-axis label
+    plt.ylabel("Y Coordinate") # Y-axis label
+    plt.axis('equal')       # Ensure equal aspect ratio
+    plt.grid(False)         # Ensure grid is off
+    plt.show()              # Display the plot
+
+except ImportError:
+    print("Rustworkx is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the Rustworkx example: {e}")
+    import traceback
+    traceback.print_exc()
+
+print("\n--- Rustworkx Example Finished ---")
 ```
 
 ![Rustworkx Example](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/rx-1.png?raw=true)
@@ -193,15 +311,100 @@ pos = kl.kececi_layout_v4(G, primary_direction='bottom-up')
 #### Example with Networkit
 
 ```python
+import matplotlib.pyplot as plt
+from matplotlib.collections import LineCollection # Efficient edge drawing
+import math
 import networkit as nk
 import kececilayout as kl
-import matplotlib.pyplot as plt
+import random
+
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
+
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph
+
+# === Networkit Example ===
+try:
+    import networkit as nk
+    print("\n--- Networkit Example ---")
+
+    # Generate graph (Path graph, manually)
+    G_nk = nk.graph.Graph(N_NODES, weighted=False, directed=False) # Generate empty graph container
+    print("Empty Networkit graph generated.")
+    # Add nodes first (Networkit often requires this)
+    for i in range(N_NODES):
+        if not G_nk.hasNode(i): # Check if node already exists (good practice)
+             G_nk.addNode()
+    print(f"{G_nk.numberOfNodes()} nodes added.")
+    # Add edges
+    for i in range(N_NODES - 1):
+        G_nk.addEdge(i, i+1) # Add edges 0-1, 1-2, ...
+    print(f"Networkit graph constructed: {G_nk.numberOfNodes()} nodes, {G_nk.numberOfEdges()} edges")
+
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function from the imported module
+    pos_nk = kl.kececi_layout_v4(G_nk, **LAYOUT_PARAMS)
+    # print("Networkit positions:", pos_nk) # Debug print if needed
+
+    # Plot using Matplotlib directly (Networkit doesn't have a simple built-in draw)
+    print("Plotting graph using Matplotlib...")
+    plt.figure(figsize=(6, 8))
+    ax = plt.gca() # Get current axes
+
+    node_indices_nk = sorted(list(G_nk.iterNodes())) # Get node indices [0, 1, ...]
 
-G = nk.graph.Graph(10)
-for i in range(9):
-    G.addEdge(i, i+1)
-pos = kl.kececi_layout_v4(G)
-# Draw with matplotlib
+    # Check if all nodes have positions
+    if not all(idx in pos_nk for idx in node_indices_nk):
+         print("ERROR: Networkit positions dictionary does not cover all nodes!")
+    else:
+        # Draw nodes
+        x_coords_nk = [pos_nk[i][0] for i in node_indices_nk]
+        y_coords_nk = [pos_nk[i][1] for i in node_indices_nk]
+        ax.scatter(x_coords_nk, y_coords_nk, s=700, c='coral', zorder=2, label='Nodes')
+
+        # Draw labels
+        for i in node_indices_nk:
+            ax.text(pos_nk[i][0], pos_nk[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)
+
+        # Draw edges using LineCollection
+        edge_lines_nk = []
+        for u, v in G_nk.iterEdges(): # Iterate through edges
+            if u in pos_nk and v in pos_nk:
+                 edge_lines_nk.append([pos_nk[u], pos_nk[v]])
+            else:
+                 print(f"Warning: Position not found for edge ({u},{v}) in Networkit graph.")
+
+        if edge_lines_nk:
+             lc_nk = LineCollection(edge_lines_nk, colors='gray', linewidths=1.0, zorder=1, label='Edges')
+             ax.add_collection(lc_nk)
+
+    plt.title(f"Networkit ({N_NODES} Nodes) with Keçeci Layout (Matplotlib)") # Plot title
+    plt.xlabel("X Coordinate") # X-axis label
+    plt.ylabel("Y Coordinate") # Y-axis label
+    plt.axis('equal')       # Ensure equal aspect ratio
+    plt.grid(False)         # Ensure grid is off
+    plt.show()              # Display the plot
+
+except ImportError:
+    print("Networkit is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the Networkit example: {e}")
+    import traceback
+    traceback.print_exc()
+
+print("\n--- Networkit Example Finished ---")
 ```
 
 ![Networkit Example](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/nk-1.png?raw=true)
@@ -209,15 +412,105 @@ pos = kl.kececi_layout_v4(G)
 #### Example with Graphillion
 
 ```python
+import matplotlib.pyplot as plt
+from matplotlib.collections import LineCollection # Efficient edge drawing
+import math
+import itertools # Graphillion might implicitly need itertools if find_max_node_id uses it internally
 import graphillion as gg
 import kececilayout as kl
-import matplotlib.pyplot as plt
+import random
+
+
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
+
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph (will be 1 to N_NODES)
+
+# === Graphillion Example ===
+try:
+    import graphillion as gg
+    print("\n--- Graphillion Example ---")
+
+    # Define the universe of possible edges (Path graph, 1-based indexing common)
+    universe = []
+    # Edges (1,2), (2,3), ..., (N_NODES-1, N_NODES)
+    for i in range(1, N_NODES):
+        universe.append((i, i + 1))
+    gg.GraphSet.set_universe(universe)
+    max_node_gg = N_NODES # We know the max node ID for this simple case
+    print(f"Graphillion universe defined: {len(universe)} edges, max node ID {max_node_gg}")
+
+    # Generate a GraphSet object (can be empty, layout function uses the universe)
+    # The layout function provided seems to derive nodes from the universe edges.
+    gs = gg.GraphSet()
+
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function; it should handle the Graphillion GraphSet object
+    # and likely use 1-based indexing based on the universe.
+    pos_gg = kl.kececi_layout_v4(gs, **LAYOUT_PARAMS)
+    # print("Graphillion positions:", pos_gg) # Debug print if needed
+
+    # Plot using Matplotlib directly (Graphillion has no plotting)
+    print("Plotting graph using Matplotlib...")
+    plt.figure(figsize=(6, 8))
+    ax = plt.gca() # Get current axes
+
+    # Node indices are expected to be 1, 2, ... N_NODES from the universe
+    node_indices_gg = sorted(pos_gg.keys())
+
+    # Check if all expected nodes (1 to N_NODES) have positions
+    expected_nodes = set(range(1, N_NODES + 1))
+    if not expected_nodes.issubset(set(node_indices_gg)):
+         print(f"ERROR: Graphillion positions missing expected nodes. Found: {node_indices_gg}, Expected: {list(expected_nodes)}")
+    else:
+        # Draw nodes
+        x_coords_gg = [pos_gg[i][0] for i in node_indices_gg]
+        y_coords_gg = [pos_gg[i][1] for i in node_indices_gg]
+        ax.scatter(x_coords_gg, y_coords_gg, s=700, c='gold', zorder=2, label='Nodes')
+
+        # Draw labels (using the 1-based indices)
+        for i in node_indices_gg:
+            ax.text(pos_gg[i][0], pos_gg[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)
+
+        # Draw edges using LineCollection (from the defined universe)
+        edge_lines_gg = []
+        for u, v in universe: # Use the universe edges
+            if u in pos_gg and v in pos_gg:
+                 edge_lines_gg.append([pos_gg[u], pos_gg[v]])
+            else:
+                 print(f"Warning: Position not found for universe edge ({u},{v}) in Graphillion.")
+
+        if edge_lines_gg:
+            lc_gg = LineCollection(edge_lines_gg, colors='gray', linewidths=1.0, zorder=1, label='Edges')
+            ax.add_collection(lc_gg)
+
+    plt.title(f"Graphillion ({N_NODES} Nodes) with Keçeci Layout (Matplotlib)") # Plot title
+    plt.xlabel("X Coordinate") # X-axis label
+    plt.ylabel("Y Coordinate") # Y-axis label
+    plt.axis('equal')       # Ensure equal aspect ratio
+    plt.grid(False)         # Ensure grid is off
+    plt.show()              # Display the plot
+
+except ImportError:
+    print("Graphillion is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the Graphillion example: {e}")
+    import traceback
+    traceback.print_exc()
 
-universe = [(i, i+1) for i in range(1, 10)]
-gg.GraphSet.set_universe(universe)
-gs = gg.GraphSet()
-pos = kl.kececi_layout_v4(gs)
-# Draw with matplotlib
+print("\n--- Graphillion Example Finished ---")
 ```
 
 ![Graphillion Example](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/gg-1.png?raw=true)
@@ -271,131 +564,457 @@ If this library was useful in your research, please cite:
 }
 ```
 
----
+---
+
+## 🇹🇷 Türkçe
+
+### Keçeci Yerleşimi (Kececi Layout)
+
+**KececiLayout**, doğrusal veya ardışık yapıları görselleştirmek için tasarlanmış, karakteristik bir "zıgzag" veya "yılanvari" desen oluşturan deterministik bir graf yerleşim algoritmasıdır.
+
+*Graf görselleştirme için Keçeci yerleşim algoritmasının Python uygulaması.*
+
+---
+
+### Açıklama
+
+Bu algoritma, düğümleri birincil eksen boyunca sıralı olarak yerleştirir ve ikincil eksen boyunca dönüşümlü olarak kaydırır. Yol grafları, zincirler veya ilerlemeyi göstermek için özellikle kullanışlıdır.
+
+**Temel Özellikler:**
+*   **Doğrusal Odak:** Yollar, zincirler veya sıralı süreçler için idealdir.
+*   **Deterministik:** Aynı giriş için her zaman aynı çıktıyı üretir.
+*   **Çakışmayı Azaltma:** Düğümleri eksenler boyunca yayarak çakışmaları önler.
+*   **Parametrik:** `primary_spacing`, `secondary_spacing`, `primary_direction`, `secondary_start` gibi parametrelerle özelleştirilebilir.
+
+=> **v0.2.7**: Eğri, şeffaf, 3B ve `expanding=True` stilleri desteklenir.
+
+---
+
+### Kurulum
+
+```bash
+conda install bilgi::kececilayout -y
+pip install kececilayout
+```
+
+🔗 [PyPI](https://pypi.org/project/kececilayout/) | [Conda](https://anaconda.org/bilgi/kececilayout) | [GitHub](https://github.com/WhiteSymmetry/kececilayout)
+
+---
+
+### Kullanım
+
+#### NetworkX ile Örnek
+
+```python
+import networkx as nx
+import matplotlib.pyplot as plt
+import kececilayout as kl
+
+G = nx.path_graph(10)
+pos = kl.kececi_layout(
+    G,
+    primary_spacing=1.0,
+    secondary_spacing=0.5,
+    primary_direction='top_down',
+    secondary_start='right'
+)
+
+plt.figure(figsize=(6, 8))
+nx.draw(G, pos=pos, with_labels=True, node_color='skyblue', node_size=500)
+plt.title("Kececi Layout with NetworkX")
+plt.axis('equal')
+plt.show()
+```
+
+![NetworkX Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/nx-1.png?raw=true)
+
+#### iGraph ile Örnek
+
+```python
+import matplotlib.pyplot as plt
+import math
+import igraph as ig
+import kececilayout as kl
+
+
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
+
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph
+
+# === igraph Example ===
+try:
+    import igraph as ig
+    print("\n--- igraph Example ---")
+
+    # Generate graph (Path graph using Ring(circular=False))
+    G_ig = ig.Graph.Ring(N_NODES, directed=False, circular=False)
+    print(f"igraph graph generated: {G_ig.vcount()} vertices, {G_ig.ecount()} edges")
+
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function from the imported module
+    pos_ig = kl.kececi_layout_v4(G_ig, **LAYOUT_PARAMS)
+    # print("igraph positions (dict):", pos_ig) # Debug print if needed
+
+    # Convert positions dict to list ordered by vertex index for ig.plot
+    layout_list_ig = []
+    plot_possible = True
+    if pos_ig: # Check if dictionary is not empty
+        try:
+            # Generate list: [pos_ig[0], pos_ig[1], ..., pos_ig[N-1]]
+            layout_list_ig = [pos_ig[i] for i in range(G_ig.vcount())]
+            # print("igraph layout (list):", layout_list_ig) # Debug print if needed
+        except KeyError as e:
+             print(f"ERROR: Key {e} not found while creating position list for igraph.")
+             print("The layout function might not have returned positions for all vertices.")
+             plot_possible = False # Cannot plot if list is incomplete
+    else:
+        print("ERROR: Keçeci Layout returned empty positions for igraph.")
+        plot_possible = False
+
+    # Plot using igraph's plotting capabilities
+    print("Plotting graph using igraph.plot...")
+    fig, ax = plt.subplots(figsize=(6, 8)) # Generate matplotlib figure and axes
+
+    if plot_possible:
+        ig.plot(G_ig,
+                target=ax,           # Draw on the matplotlib axes
+                layout=layout_list_ig, # Use the ORDERED LIST of coordinates
+                vertex_label=[str(i) for i in range(G_ig.vcount())], # Labels 0, 1,...
+                vertex_color='lightgreen',
+                vertex_size=30,      # Note: igraph vertex_size scale differs
+                edge_color='gray')
+    else:
+         ax.text(0.5, 0.5, "Plotting failed:\nMissing or incomplete layout positions.",
+                 ha='center', va='center', color='red', fontsize=12) # Error message on plot
+
+    ax.set_title(f"igraph ({N_NODES} Nodes) with Keçeci Layout") # Plot title
+    ax.set_aspect('equal', adjustable='box') # Ensure equal aspect ratio
+    # ax.grid(False) # Ensure grid is off
+    plt.show()              # Display the plot
+
+except ImportError:
+    print("python-igraph is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the igraph example: {e}")
+    import traceback
+    traceback.print_exc()
+
+print("\n--- igraph Example Finished ---")
+```
+
+![iGraph Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/ig-1.png?raw=true)
+
+#### RustworkX ile Örnek
+
+```python
+import matplotlib.pyplot as plt
+from matplotlib.collections import LineCollection # Efficient edge drawing
+import math
+import rustworkx as rx
+import kececilayout as kl
+import random
+
+
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
+
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph
+
+# === Rustworkx Example ===
+try:
+    import rustworkx as rx
+    print("\n--- Rustworkx Example ---")
+
+    # Generate graph (Path graph)
+    G_rx = rx.generators.path_graph(N_NODES)
+    print(f"Rustworkx graph generated: {G_rx.num_nodes()} nodes, {G_rx.num_edges()} edges")
+
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function from the imported module
+    pos_rx = kl.kececi_layout_v4(G_rx, **LAYOUT_PARAMS)
+    # print("Rustworkx positions:", pos_rx) # Debug print if needed
+
+    # Plot using Matplotlib directly (Rustworkx doesn't have a built-in draw)
+    print("Plotting graph using Matplotlib...")
+    plt.figure(figsize=(6, 8))
+    ax = plt.gca() # Get current axes
+
+    node_indices_rx = G_rx.node_indices() # Get node indices [0, 1, ...]
+
+    # Check if all nodes have positions
+    if not all(idx in pos_rx for idx in node_indices_rx):
+         print("ERROR: Rustworkx positions dictionary does not cover all nodes!")
+         # Decide how to handle: exit, plot partial, etc.
+    else:
+        # Draw nodes
+        x_coords_rx = [pos_rx[i][0] for i in node_indices_rx]
+        y_coords_rx = [pos_rx[i][1] for i in node_indices_rx]
+        ax.scatter(x_coords_rx, y_coords_rx, s=700, c='#88CCEE', zorder=2, label='Nodes') # Skyblue color
+
+        # Draw labels
+        for i in node_indices_rx:
+            ax.text(pos_rx[i][0], pos_rx[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)
+
+        # Draw edges using LineCollection for efficiency
+        edge_lines = []
+        for u, v in G_rx.edge_list(): # Get list of edges (node index pairs)
+            if u in pos_rx and v in pos_rx:
+                # Segment format: [(x1, y1), (x2, y2)]
+                edge_lines.append([pos_rx[u], pos_rx[v]])
+            else:
+                print(f"Warning: Position not found for edge ({u},{v}) in Rustworkx graph.")
+
+        if edge_lines:
+            lc = LineCollection(edge_lines, colors='gray', linewidths=1.0, zorder=1, label='Edges')
+            ax.add_collection(lc) # Add edges to the plot axes
+
+    plt.title(f"Rustworkx ({N_NODES} Nodes) with Keçeci Layout (Matplotlib)") # Plot title
+    plt.xlabel("X Coordinate") # X-axis label
+    plt.ylabel("Y Coordinate") # Y-axis label
+    plt.axis('equal')       # Ensure equal aspect ratio
+    plt.grid(False)         # Ensure grid is off
+    plt.show()              # Display the plot
 
-## 🇹🇷 Türkçe
+except ImportError:
+    print("Rustworkx is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the Rustworkx example: {e}")
+    import traceback
+    traceback.print_exc()
 
-### Keçeci Yerleşimi (Kececi Layout)
+print("\n--- Rustworkx Example Finished ---")
+```
 
-**KececiLayout**, doğrusal veya ardışık yapıları görselleştirmek için tasarlanmış, karakteristik bir "zıgzag" veya "yılanvari" desen oluşturan deterministik bir graf yerleşim algoritmasıdır.
+![RustworkX Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/rx-1.png?raw=true)
 
-*Graf görselleştirme için Keçeci yerleşim algoritmasının Python uygulaması.*
+#### Networkit ile Örnek
 
----
+```python
+import matplotlib.pyplot as plt
+from matplotlib.collections import LineCollection # Efficient edge drawing
+import math
+import networkit as nk
+import kececilayout as kl
+import random
 
-### Açıklama
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
 
-Bu algoritma, düğümleri birincil eksen boyunca sıralı olarak yerleştirir ve ikincil eksen boyunca dönüşümlü olarak kaydırır. Yol grafları, zincirler veya ilerlemeyi göstermek için özellikle kullanışlıdır.
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph
 
-**Temel Özellikler:**
-*   **Doğrusal Odak:** Yollar, zincirler veya sıralı süreçler için idealdir.
-*   **Deterministik:** Aynı giriş için her zaman aynı çıktıyı üretir.
-*   **Çakışmayı Azaltma:** Düğümleri eksenler boyunca yayarak çakışmaları önler.
-*   **Parametrik:** `primary_spacing`, `secondary_spacing`, `primary_direction`, `secondary_start` gibi parametrelerle özelleştirilebilir.
+# === Networkit Example ===
+try:
+    import networkit as nk
+    print("\n--- Networkit Example ---")
 
-=> **v0.2.7**: Eğri, şeffaf, 3B ve `expanding=True` stilleri desteklenir.
+    # Generate graph (Path graph, manually)
+    G_nk = nk.graph.Graph(N_NODES, weighted=False, directed=False) # Generate empty graph container
+    print("Empty Networkit graph generated.")
+    # Add nodes first (Networkit often requires this)
+    for i in range(N_NODES):
+        if not G_nk.hasNode(i): # Check if node already exists (good practice)
+             G_nk.addNode()
+    print(f"{G_nk.numberOfNodes()} nodes added.")
+    # Add edges
+    for i in range(N_NODES - 1):
+        G_nk.addEdge(i, i+1) # Add edges 0-1, 1-2, ...
+    print(f"Networkit graph constructed: {G_nk.numberOfNodes()} nodes, {G_nk.numberOfEdges()} edges")
 
----
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function from the imported module
+    pos_nk = kl.kececi_layout_v4(G_nk, **LAYOUT_PARAMS)
+    # print("Networkit positions:", pos_nk) # Debug print if needed
 
-### Kurulum
+    # Plot using Matplotlib directly (Networkit doesn't have a simple built-in draw)
+    print("Plotting graph using Matplotlib...")
+    plt.figure(figsize=(6, 8))
+    ax = plt.gca() # Get current axes
 
-```bash
-conda install bilgi::kececilayout -y
-pip install kececilayout
-```
+    node_indices_nk = sorted(list(G_nk.iterNodes())) # Get node indices [0, 1, ...]
 
-🔗 [PyPI](https://pypi.org/project/kececilayout/) | [Conda](https://anaconda.org/bilgi/kececilayout) | [GitHub](https://github.com/WhiteSymmetry/kececilayout)
+    # Check if all nodes have positions
+    if not all(idx in pos_nk for idx in node_indices_nk):
+         print("ERROR: Networkit positions dictionary does not cover all nodes!")
+    else:
+        # Draw nodes
+        x_coords_nk = [pos_nk[i][0] for i in node_indices_nk]
+        y_coords_nk = [pos_nk[i][1] for i in node_indices_nk]
+        ax.scatter(x_coords_nk, y_coords_nk, s=700, c='coral', zorder=2, label='Nodes')
 
----
+        # Draw labels
+        for i in node_indices_nk:
+            ax.text(pos_nk[i][0], pos_nk[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)
 
-### Kullanım
+        # Draw edges using LineCollection
+        edge_lines_nk = []
+        for u, v in G_nk.iterEdges(): # Iterate through edges
+            if u in pos_nk and v in pos_nk:
+                 edge_lines_nk.append([pos_nk[u], pos_nk[v]])
+            else:
+                 print(f"Warning: Position not found for edge ({u},{v}) in Networkit graph.")
 
-#### NetworkX ile Örnek
+        if edge_lines_nk:
+             lc_nk = LineCollection(edge_lines_nk, colors='gray', linewidths=1.0, zorder=1, label='Edges')
+             ax.add_collection(lc_nk)
 
-```python
-import networkx as nx
-import matplotlib.pyplot as plt
-import kececilayout as kl
+    plt.title(f"Networkit ({N_NODES} Nodes) with Keçeci Layout (Matplotlib)") # Plot title
+    plt.xlabel("X Coordinate") # X-axis label
+    plt.ylabel("Y Coordinate") # Y-axis label
+    plt.axis('equal')       # Ensure equal aspect ratio
+    plt.grid(False)         # Ensure grid is off
+    plt.show()              # Display the plot
 
-G = nx.path_graph(10)
-pos = kl.kececi_layout_v4(
-    G,
-    primary_spacing=1.0,
-    secondary_spacing=0.5,
-    primary_direction='top-down',
-    secondary_start='right'
-)
+except ImportError:
+    print("Networkit is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the Networkit example: {e}")
+    import traceback
+    traceback.print_exc()
 
-plt.figure(figsize=(6, 8))
-nx.draw(G, pos=pos, with_labels=True, node_color='skyblue', node_size=500)
-plt.title("Kececi Layout with NetworkX")
-plt.axis('equal')
-plt.show()
+print("\n--- Networkit Example Finished ---")
 ```
 
-![NetworkX Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/nx-1.png?raw=true)
+![Networkit Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/nk-1.png?raw=true)
 
-#### iGraph ile Örnek
+#### Graphillion ile Örnek
 
 ```python
-import igraph as ig
 import matplotlib.pyplot as plt
-from kececilayout import kececi_layout_v4_igraph
+from matplotlib.collections import LineCollection # Efficient edge drawing
+import math
+import itertools # Graphillion might implicitly need itertools if find_max_node_id uses it internally
+import graphillion as gg
+import kececilayout as kl
+import random
 
-G = ig.Graph.Ring(10, circular=False)
-pos_list = kececi_layout_v4_igraph(G, primary_direction='left-to-right', secondary_start='up')
-layout = ig.Layout(pos_list)
 
-fig, ax = plt.subplots(figsize=(8, 6))
-ig.plot(G, target=ax, layout=layout, vertex_label=[f"N{i}" for i in range(10)])
-ax.set_aspect('equal')
-plt.show()
-```
+try:
+    import kececilayout as kl
+except ImportError:
+    print("Error: 'kececi_layout.py' not found or could not be imported.")
+    print("Please ensure the file containing kececi_layout_v4 is accessible.")
+    exit()
 
-![iGraph Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/ig-1.png?raw=true)
+# --- General Layout Parameters ---
+LAYOUT_PARAMS = {
+    'primary_spacing': 1.0,
+    'secondary_spacing': 0.6, # Make the zigzag noticeable
+    'primary_direction': 'top_down',
+    'secondary_start': 'right'
+}
+N_NODES = 10 # Number of nodes in the example graph (will be 1 to N_NODES)
 
-#### RustworkX ile Örnek
+# === Graphillion Example ===
+try:
+    import graphillion as gg
+    print("\n--- Graphillion Example ---")
 
-```python
-import rustworkx as rx
-import kececilayout as kl
-import matplotlib.pyplot as plt
+    # Define the universe of possible edges (Path graph, 1-based indexing common)
+    universe = []
+    # Edges (1,2), (2,3), ..., (N_NODES-1, N_NODES)
+    for i in range(1, N_NODES):
+        universe.append((i, i + 1))
+    gg.GraphSet.set_universe(universe)
+    max_node_gg = N_NODES # We know the max node ID for this simple case
+    print(f"Graphillion universe defined: {len(universe)} edges, max node ID {max_node_gg}")
 
-G = rx.generators.path_graph(10)
-pos = kl.kececi_layout_v4(G, primary_direction='bottom-up')
-# Matplotlib ile çizim yapılabilir
-```
+    # Generate a GraphSet object (can be empty, layout function uses the universe)
+    # The layout function provided seems to derive nodes from the universe edges.
+    gs = gg.GraphSet()
 
-![RustworkX Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/rx-1.png?raw=true)
+    # Calculate layout
+    print("Calculating Keçeci Layout...")
+    # Call the layout function; it should handle the Graphillion GraphSet object
+    # and likely use 1-based indexing based on the universe.
+    pos_gg = kl.kececi_layout_v4(gs, **LAYOUT_PARAMS)
+    # print("Graphillion positions:", pos_gg) # Debug print if needed
 
-#### Networkit ile Örnek
+    # Plot using Matplotlib directly (Graphillion has no plotting)
+    print("Plotting graph using Matplotlib...")
+    plt.figure(figsize=(6, 8))
+    ax = plt.gca() # Get current axes
 
-```python
-import networkit as nk
-import kececilayout as kl
-import matplotlib.pyplot as plt
+    # Node indices are expected to be 1, 2, ... N_NODES from the universe
+    node_indices_gg = sorted(pos_gg.keys())
 
-G = nk.graph.Graph(10)
-for i in range(9):
-    G.addEdge(i, i+1)
-pos = kl.kececi_layout_v4(G)
-# Matplotlib ile çizim
-```
+    # Check if all expected nodes (1 to N_NODES) have positions
+    expected_nodes = set(range(1, N_NODES + 1))
+    if not expected_nodes.issubset(set(node_indices_gg)):
+         print(f"ERROR: Graphillion positions missing expected nodes. Found: {node_indices_gg}, Expected: {list(expected_nodes)}")
+    else:
+        # Draw nodes
+        x_coords_gg = [pos_gg[i][0] for i in node_indices_gg]
+        y_coords_gg = [pos_gg[i][1] for i in node_indices_gg]
+        ax.scatter(x_coords_gg, y_coords_gg, s=700, c='gold', zorder=2, label='Nodes')
 
-![Networkit Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/nk-1.png?raw=true)
+        # Draw labels (using the 1-based indices)
+        for i in node_indices_gg:
+            ax.text(pos_gg[i][0], pos_gg[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)
 
-#### Graphillion ile Örnek
+        # Draw edges using LineCollection (from the defined universe)
+        edge_lines_gg = []
+        for u, v in universe: # Use the universe edges
+            if u in pos_gg and v in pos_gg:
+                 edge_lines_gg.append([pos_gg[u], pos_gg[v]])
+            else:
+                 print(f"Warning: Position not found for universe edge ({u},{v}) in Graphillion.")
 
-```python
-import graphillion as gg
-import kececilayout as kl
-import matplotlib.pyplot as plt
+        if edge_lines_gg:
+            lc_gg = LineCollection(edge_lines_gg, colors='gray', linewidths=1.0, zorder=1, label='Edges')
+            ax.add_collection(lc_gg)
+
+    plt.title(f"Graphillion ({N_NODES} Nodes) with Keçeci Layout (Matplotlib)") # Plot title
+    plt.xlabel("X Coordinate") # X-axis label
+    plt.ylabel("Y Coordinate") # Y-axis label
+    plt.axis('equal')       # Ensure equal aspect ratio
+    plt.grid(False)         # Ensure grid is off
+    plt.show()              # Display the plot
+
+except ImportError:
+    print("Graphillion is not installed. Skipping this example.")
+except Exception as e:
+    print(f"An error occurred in the Graphillion example: {e}")
+    import traceback
+    traceback.print_exc()
 
-universe = [(i, i+1) for i in range(1, 10)]
-gg.GraphSet.set_universe(universe)
-gs = gg.GraphSet()
-pos = kl.kececi_layout_v4(gs)
-# Matplotlib ile çizim
+print("\n--- Graphillion Example Finished ---")
 ```
 
 ![Graphillion Örneği](https://github.com/WhiteSymmetry/kececilayout/blob/main/examples/gg-1.png?raw=true)
@@ -559,7 +1178,7 @@ A deterministic node placement algorithm used in graph visualization. In this la
 *   **Linear Focus:** Particularly useful for visualizing linear or sequential structures, such as paths, chains, or ordered processes.
 *   **Deterministic:** Produces the exact same layout for the same graph and parameters every time.
 *   **Overlap Reduction:** Helps prevent node collisions by spreading nodes out away from the primary axis.
-*   **Parametric:** Can be customized using parameters such as the primary direction (e.g., `top-down`), the starting side for the secondary offset (e.g., `start_right`), and the spacing along both axes (`primary_spacing`, `secondary_spacing`).
+*   **Parametric:** Can be customized using parameters such as the primary direction (e.g., `top_down`), the starting side for the secondary offset (e.g., `start_right`), and the spacing along both axes (`primary_spacing`, `secondary_spacing`).
 
 ---
 
@@ -573,7 +1192,7 @@ Graf görselleştirmede kullanılan deterministik bir düğüm yerleştirme algo
 *   **Doğrusal Odak:** Özellikle yollar (paths), zincirler veya sıralı süreçler gibi doğrusal veya ardışık yapıları görselleştirmek için kullanışlıdır.
 *   **Deterministik:** Aynı graf ve parametrelerle her zaman aynı sonucu üretir.
 *   **Çakışmayı Azaltma:** Düğümleri ana eksenden uzağa yayarak çakışmaları önlemeye yardımcı olur.
-*   **Parametrik:** Ana eksenin yönü (örn. `top-down`), ikincil kaydırmanın başlangıç yönü (örn. `start_right`) ve eksenler arası boşluklar (`primary_spacing`, `secondary_spacing`) gibi parametrelerle özelleştirilebilir.
+*   **Parametrik:** Ana eksenin yönü (örn. `top_down`), ikincil kaydırmanın başlangıç yönü (örn. `start_right`) ve eksenler arası boşluklar (`primary_spacing`, `secondary_spacing`) gibi parametrelerle özelleştirilebilir.
 
 ---
 
@@ -616,7 +1235,7 @@ G = nx.path_graph(10)
 pos = kl.kececi_layout_v4(G,
                            primary_spacing=1.0,
                            secondary_spacing=0.5,
-                           primary_direction='top-down',
+                           primary_direction='top_down',
                            secondary_start='right')
 
 # Draw the graph
@@ -645,7 +1264,7 @@ except ImportError:
 LAYOUT_PARAMS = {
     'primary_spacing': 1.0,
     'secondary_spacing': 0.6, # Make the zigzag noticeable
-    'primary_direction': 'top-down',
+    'primary_direction': 'top_down',
     'secondary_start': 'right'
 }
 N_NODES = 10 # Number of nodes in the example graph
@@ -750,7 +1369,7 @@ except ImportError:
 LAYOUT_PARAMS = {
     'primary_spacing': 1.0,
     'secondary_spacing': 0.6, # Make the zigzag noticeable
-    'primary_direction': 'top-down',
+    'primary_direction': 'top_down',
     'secondary_start': 'right'
 }
 N_NODES = 10 # Number of nodes in the example graph
@@ -843,7 +1462,7 @@ except ImportError:
 LAYOUT_PARAMS = {
     'primary_spacing': 1.0,
     'secondary_spacing': 0.6, # Make the zigzag noticeable
-    'primary_direction': 'top-down',
+    'primary_direction': 'top_down',
     'secondary_start': 'right'
 }
 N_NODES = 10 # Number of nodes in the example graph
@@ -939,7 +1558,7 @@ except ImportError:
 LAYOUT_PARAMS = {
     'primary_spacing': 1.0,
     'secondary_spacing': 0.6, # Make the zigzag noticeable
-    'primary_direction': 'top-down',
+    'primary_direction': 'top_down',
     'secondary_start': 'right'
 }
 N_NODES = 10 # Number of nodes in the example graph
@@ -1044,7 +1663,7 @@ except ImportError:
 LAYOUT_PARAMS = {
     'primary_spacing': 1.0,
     'secondary_spacing': 0.6, # Make the zigzag noticeable
-    'primary_direction': 'top-down',
+    'primary_direction': 'top_down',
     'secondary_start': 'right'
 }
 N_NODES = 10 # Number of nodes in the example graph (will be 1 to N_NODES)
@@ -1241,13 +1860,3 @@ Keçeci, Mehmet. "Kececilayout". Open Science Articles (OSAs), Zenodo, 2025. htt
 
 Keçeci, Mehmet. "Keçeci Layout". Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.15314328.
 ```
-
-
-
-
-
-
-
-
-
-

kececilayout-0.4.5.dist-info/RECORD

@@ -0,0 +1,8 @@
+kececilayout/__init__.py,sha256=J8gDPZhZ6EinF_2-jSaC6ZDJ8HyFZ3lgmHqILsAQFhA,4230
+kececilayout/_version.py,sha256=ag7QDMboOIiBZKouMZEt0w5P2Q6kBDW7IyQLv4YqTAE,813
+kececilayout/kececi_layout.py,sha256=KWPOvtPjzUbxzfDAAstBgvjoidtgGkixkfmoQNa7tgw,65990
+kececilayout-0.4.5.dist-info/licenses/LICENSE,sha256=NJZsJEbQuKzxn1mWPWCbRx8jRUqGS22thl8wwuRQJ9c,1071
+kececilayout-0.4.5.dist-info/METADATA,sha256=DUd0YVpaKenyD3nJ74729kWXziDAsLt0TsSyy33ljpg,73243
+kececilayout-0.4.5.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+kececilayout-0.4.5.dist-info/top_level.txt,sha256=OBzN_wm4q-iwSkeACF4E8ET_LFLJKBTldSH3D1jG2hA,13
+kececilayout-0.4.5.dist-info/RECORD,,

kececilayout-0.4.3.dist-info/RECORD

@@ -1,8 +0,0 @@
-kececilayout/__init__.py,sha256=ya1f1Hx9MbS04zu8jpjW_Lq82H-zIYu7R-NzLL2mx40,4226
-kececilayout/_version.py,sha256=fN2LSPj9YZtOf8U7dE1dA-uf9QAQ_GmUWm8UlLIsI7I,823
-kececilayout/kececi_layout.py,sha256=KWPOvtPjzUbxzfDAAstBgvjoidtgGkixkfmoQNa7tgw,65990
-kececilayout-0.4.3.dist-info/licenses/LICENSE,sha256=NJZsJEbQuKzxn1mWPWCbRx8jRUqGS22thl8wwuRQJ9c,1071
-kececilayout-0.4.3.dist-info/METADATA,sha256=O1Ei8SPX7kFv-MplHzbsI0OUfgPo6P2PatoQ0-xxTho,48622
-kececilayout-0.4.3.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-kececilayout-0.4.3.dist-info/top_level.txt,sha256=OBzN_wm4q-iwSkeACF4E8ET_LFLJKBTldSH3D1jG2hA,13
-kececilayout-0.4.3.dist-info/RECORD,,