| Name | kececilayout JSON |
| Version |
0.3.0
JSON |
| download |
| home_page | https://github.com/WhiteSymmetry/kececilayout |
| Summary | Çeşitli graf kütüphaneleri için sıralı-zigzag yerleşimleri sağlayan bir Python paketi. |
| upload_time | 2025-08-10 19:02:40 |
| maintainer | Mehmet Keçeci |
| docs_url | None |
| author | Mehmet Keçeci |
| requires_python | >=3.10 |
| license | MIT License
Copyright (c) 2025 Mehmet Keçeci
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
|
| keywords |
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
# KececiLayout
[](https://badge.fury.io/py/kececilayout)
[](https://opensource.org/licenses/MIT)
[](https://doi.org/10.5281/zenodo.15313946)
[](https://doi.org/10.5281/zenodo.15314328)
[](https://doi.org/10.5281/zenodo.15353535)
[](https://doi.org/10.48546/workflowhub.datafile.17.1)
[](https://anaconda.org/bilgi/kececilayout)
[](https://anaconda.org/bilgi/kececilayout)
[](https://anaconda.org/bilgi/kececilayout)
[](https://anaconda.org/bilgi/kececilayout)
[](https://opensource.org/)
[](https://kececilayout.readthedocs.io/en/latest)
[](https://www.bestpractices.dev/projects/10531)
[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/python_ci.yml)
[](https://codecov.io/gh/WhiteSymmetry/kececilayout)
[](https://terrarium.evidencepub.io/v2/gh/WhiteSymmetry/kececilayout/HEAD)
[](https://pepy.tech/projects/kececilayout)
[](CODE_OF_CONDUCT.md)
[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/ci-cd.yml)
[](https://github.com/astral-sh/ruff)
| **Documentation** | **Paper** |
|:-----------------:|:---------:|
| [](https://kececilayout.readthedocs.io/) | [](https://doi.org/10.5281/zenodo.15314328) |
---
## 🌐 English
### Kececi Layout (Keçeci Yerleşimi)
**KececiLayout** is a deterministic graph layout algorithm designed for visualizing linear or sequential structures with a characteristic "zig-zag" or "serpentine" pattern.
*Python implementation of the Keçeci layout algorithm for graph visualization.*
---
### Description
This algorithm arranges nodes sequentially along a primary axis and offsets them alternately along a secondary axis. It's particularly useful for path graphs, chains, or showing progression.
**Key Features:**
* **Linear Focus:** Ideal for visualizing paths, chains, or ordered processes.
* **Deterministic:** Produces identical results for the same input.
* **Overlap Reduction:** Prevents node collisions by spreading them across axes.
* **Parametric:** Fully customizable with parameters like `primary_spacing`, `secondary_spacing`, `primary_direction`, and `secondary_start`.
=> **v0.2.7**: Curved, transparent, 3D, and `expanding=True` styles supported.
---
### Installation
```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)
---
### Usage
#### Example with NetworkX
```python
import networkx as nx
import matplotlib.pyplot as plt
import kececilayout as kl
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'
)
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()
```
#### Example with iGraph
```python
import igraph as ig
import matplotlib.pyplot as plt
from kececilayout import kececi_layout_v4_igraph
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()
```
#### Example with RustworkX
```python
import rustworkx as rx
import kececilayout as kl
import matplotlib.pyplot as plt
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)
```
#### Example with Networkit
```python
import networkit as nk
import kececilayout as kl
import matplotlib.pyplot as plt
G = nk.graph.Graph(10)
for i in range(9):
G.addEdge(i, i+1)
pos = kl.kececi_layout_v4(G)
# Draw with matplotlib
```
#### Example with Graphillion
```python
import graphillion as gg
import kececilayout as kl
import matplotlib.pyplot as plt
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
```
---
### Supported Backends
- **NetworkX**
- **igraph**
- **Rustworkx**
- **Networkit**
- **Graphillion**
*Note: All backends are supported via unified `kececi_layout_v4` function.*
---
### Advanced Drawing Styles
Use `draw_kececi` for enhanced visualizations:
```python
kl.draw_kececi(G, style='curved') # Smooth curved edges
kl.draw_kececi(G, style='transparent') # Opacity based on edge length
kl.draw_kececi(G, style='3d') # 3D helix layout
```
---
### License
MIT License. See [LICENSE](LICENSE) for details.
---
### Citation
If this library was useful in your research, please cite:
```bibtex
@misc{kececi_2025_15313946,
author = {Keçeci, Mehmet},
title = {kececilayout},
month = may,
year = 2025,
publisher = {Zenodo},
version = {0.2.7},
doi = {10.5281/zenodo.15313946},
url = {https://doi.org/10.5281/zenodo.15313946}
}
```
---
## 🇹🇷 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_v4(
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()
```
#### iGraph ile Örnek
```python
import igraph as ig
import matplotlib.pyplot as plt
from kececilayout import kececi_layout_v4_igraph
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()
```
#### RustworkX ile Örnek
```python
import rustworkx as rx
import kececilayout as kl
import matplotlib.pyplot as plt
G = rx.generators.path_graph(10)
pos = kl.kececi_layout_v4(G, primary_direction='bottom-up')
# Matplotlib ile çizim yapılabilir
```
#### Networkit ile Örnek
```python
import networkit as nk
import kececilayout as kl
import matplotlib.pyplot as plt
G = nk.graph.Graph(10)
for i in range(9):
G.addEdge(i, i+1)
pos = kl.kececi_layout_v4(G)
# Matplotlib ile çizim
```
#### Graphillion ile Örnek
```python
import graphillion as gg
import kececilayout as kl
import matplotlib.pyplot as plt
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
```
---
### Desteklenen Kütüphaneler
- **NetworkX**
- **igraph**
- **Rustworkx**
- **Networkit**
- **Graphillion**
*Not: Tüm kütüphaneler `kececi_layout_v4` fonksiyonu ile desteklenir.*
---
### Gelişmiş Çizim Stilleri
`draw_kececi` ile gelişmiş görselleştirmeler:
```python
kl.draw_kececi(G, style='curved') # Eğri kenarlar
kl.draw_kececi(G, style='transparent') # Kenar uzunluğuna göre şeffaflık
kl.draw_kececi(G, style='3d') # 3B heliks yerleşimi
```
---
### Lisans
MIT Lisansı. Detaylar için [LICENSE](LICENSE) dosyasına bakın.
---
### Atıf
Araştırmanızda bu kütüphaneyi kullandıysanız, lütfen aşağıdaki gibi atıf yapın:
```bibtex
@misc{kececi_2025_15313946,
author = {Keçeci, Mehmet},
title = {kececilayout},
month = may,
year = 2025,
publisher = {Zenodo},
version = {0.2.7},
doi = {10.5281/zenodo.15313946},
url = {https://doi.org/10.5281/zenodo.15313946}
}
```
---
## 📚 Documentation
For full documentation, visit:
[**https://kececilayout.readthedocs.io**](https://kececilayout.readthedocs.io)
---
# KececiLayout
[](https://badge.fury.io/py/kececilayout)
[](https://opensource.org/licenses/MIT)
[](https://doi.org/10.5281/zenodo.15313946)
[](https://doi.org/10.5281/zenodo.15314328)
[](https://doi.org/10.5281/zenodo.15353535)
[](https://doi.org/10.48546/workflowhub.datafile.17.1)
[](https://anaconda.org/bilgi/kececilayout)
[](https://anaconda.org/bilgi/kececilayout)
[](https://anaconda.org/bilgi/kececilayout)
[](https://anaconda.org/bilgi/kececilayout)
[](https://opensource.org/)
[](https://kececilayout.readthedocs.io/en/latest)
[](https://www.bestpractices.dev/projects/10531)
[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/python_ci.yml)
[](https://codecov.io/gh/WhiteSymmetry/kececilayout)
[](https://kececilayout.readthedocs.io/en/latest/)
[](https://terrarium.evidencepub.io/v2/gh/WhiteSymmetry/kececilayout/HEAD)
[](https://badge.fury.io/py/kececilayout)
[](https://pepy.tech/projects/kececilayout)
[](CODE_OF_CONDUCT.md)
[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/ci-cd.yml)
[](https://github.com/astral-sh/ruff)
| **Documentation**| **Paper**|
|:----------------:|:--------:|
|[](https://whitesymmetry.github.io/kececilayout/)|[](https://doi.org/10.5281/zenodo.15314328)|
---
<p align="left">
<table>
<tr>
<td style="text-align: center;">PyPI</td>
<td style="text-align: center;">
<a href="https://pypi.org/project/kececilayout/">
<img src="https://badge.fury.io/py/kececilayout.svg" alt="PyPI version" height="18"/>
</a>
</td>
</tr>
<tr>
<td style="text-align: center;">Conda</td>
<td style="text-align: center;">
<a href="https://anaconda.org/bilgi/kececilayout">
<img src="https://anaconda.org/bilgi/kececilayout/badges/version.svg" alt="conda-forge version" height="18"/>
</a>
</td>
</tr>
<tr>
<td style="text-align: center;">DOI</td>
<td style="text-align: center;">
<a href="https://doi.org/10.5281/zenodo.15313946">
<img src="https://zenodo.org/badge/DOI/10.5281/zenodo.15313946.svg" alt="DOI" height="18"/>
</a>
</td>
</tr>
<tr>
<td style="text-align: center;">License: MIT</td>
<td style="text-align: center;">
<a href="https://opensource.org/licenses/MIT">
<img src="https://img.shields.io/badge/License-MIT-yellow.svg" alt="License" height="18"/>
</a>
</td>
</tr>
</table>
</p>
---
**Kececi Layout (Keçeci Yerleşimi)**: A deterministic graph layout algorithm designed for visualizing linear or sequential structures with a characteristic "zig-zag" or "serpentine" pattern.
*Python implementation of the Keçeci layout algorithm for graph visualization.*
---
## Description / Açıklama
This algorithm arranges nodes sequentially along a primary axis and offsets them alternately along a secondary axis. It's particularly useful for path graphs, chains, or showing progression.
*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.*
=> 0.2.6: Curved, transparent, 3d, expanding=True
---
### English Description
**Keçeci Layout:**
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.
**Key Characteristics:**
* **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`).
---
### Türkçe Tanımlama
**Keçeci Yerleşimi (Keçeci Layout):**
Graf görselleştirmede kullanılan deterministik bir düğüm yerleştirme algoritmasıdır. Bu yöntemde düğümler, belirlenen birincil (ana) eksen boyunca sıralı olarak yerleştirilir. Her bir sonraki düğüm, ana eksenin bir sağına bir soluna (veya bir üstüne bir altına) olmak üzere, ikincil eksen doğrultusunda dönüşümlü olarak kaydırılır. Genellikle, ana eksende ilerledikçe ikincil eksendeki kaydırma miktarı artar ve bu da karakteristik bir "zıgzag" veya "yılanvari" desen oluşturur.
**Temel Özellikleri:**
* **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.
---
## Installation / Kurulum
```bash
conda install bilgi::kececilayout -y
pip install kececilayout
```
https://anaconda.org/bilgi/kececilayout
https://pypi.org/project/KececiLayout/
https://github.com/WhiteSymmetry/kececilayout
https://zenodo.org/records/15313947
https://zenodo.org/records/15314329
---
## Usage / Kullanım
The layout function generally accepts a graph object and returns positions.
### Example with NetworkX
```python
import networkx as nx
import matplotlib.pyplot as plt
import kececilayout as kl # Assuming the main function is imported like this
import random
# Create a graph
G = nx.path_graph(10)
# Calculate layout positions using the generic function
# (Assuming kl.kececi_layout_v4 is the main/generic function)
pos = kl.kececi_layout_v4(G,
primary_spacing=1.0,
secondary_spacing=0.5,
primary_direction='top-down',
secondary_start='right')
# Draw the graph
plt.figure(figsize=(6, 8))
nx.draw(G, pos=pos, with_labels=True, node_color='skyblue', node_size=500, font_size=10)
plt.title("Keçeci Layout with NetworkX")
plt.axis('equal') # Ensure aspect ratio is equal
plt.show()
```
```python
import matplotlib.pyplot as plt
import math
import networkx as nx
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
# === NetworkX Example ===
try:
import networkx as nx
print("\n--- NetworkX Example ---")
# Generate graph (Path graph)
G_nx = nx.path_graph(N_NODES)
print(f"NetworkX graph generated: {G_nx.number_of_nodes()} nodes, {G_nx.number_of_edges()} edges")
# Calculate layout
print("Calculating Keçeci Layout...")
# Call the layout function from the imported module
pos_nx = kl.kececi_layout_v4(G_nx, **LAYOUT_PARAMS)
# print("NetworkX positions:", pos_nx) # Debug print if needed
# Plot
plt.figure(figsize=(6, 8)) # Suitable figure size for vertical layout
nx.draw(G_nx, # NetworkX graph object
pos=pos_nx, # Positions calculated by Kececi Layout
with_labels=True, # Show node labels (indices)
node_color='skyblue',# Node color
node_size=700, # Node size
font_size=10, # Label font size
edge_color='gray') # Edge color
plt.title(f"NetworkX ({N_NODES} Nodes) with Keçeci Layout") # Plot title
plt.xlabel("X Coordinate") # X-axis label
plt.ylabel("Y Coordinate") # Y-axis label
plt.axis('equal') # Ensure equal aspect ratio for correct spacing perception
# plt.grid(False) # Ensure grid is off
plt.show() # Display the plot
except ImportError:
print("NetworkX is not installed. Skipping this example.")
except Exception as e:
print(f"An error occurred in the NetworkX example: {e}")
import traceback
traceback.print_exc()
print("\n--- NetworkX Example Finished ---")
```
---
### Example with iGraph
```python
import igraph as ig
import matplotlib.pyplot as plt
# Assuming a specific function for igraph exists or the generic one handles it
from kececilayout import kececi_layout_v4_igraph # Adjust import if needed
import random
# Create a graph
G = ig.Graph.Ring(10, circular=False) # Path graph equivalent
for i in range(G.vcount()):
G.vs[i]["name"] = f"N{i}"
# Calculate layout positions (returns a list of coords)
pos_list = kececi_layout_v4_igraph(G,
primary_spacing=1.5,
secondary_spacing=1.0,
primary_direction='left-to-right',
secondary_start='up')
layout = ig.Layout(coords=pos_list)
# Draw the graph
fig, ax = plt.subplots(figsize=(8, 6))
ig.plot(
G,
target=ax,
layout=layout,
vertex_label=G.vs["name"],
vertex_color="lightblue",
vertex_size=30
)
ax.set_title("Keçeci Layout with iGraph")
ax.set_aspect('equal', adjustable='box')
plt.show()
```
```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 ---")
```
---
### 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 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
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 ---")
```
---
### 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 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, ...]
# 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 ---")
```
---
### 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 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()
print("\n--- Graphillion Example Finished ---")
```
---
## Supported Backends / Desteklenen Kütüphaneler
The layout functions are designed to work with graph objects from the following libraries:
* **NetworkX:** (`networkx.Graph`, `networkx.DiGraph`, etc.)
* **igraph:** (`igraph.Graph`)
* **Rustworkx:** (Requires appropriate conversion or adapter function)
* **Networkit:** (Requires appropriate conversion or adapter function)
* **Graphillion:** (Requires appropriate conversion or adapter function)
*Note: Direct support might vary. Check specific function documentation for compatibility details.*
---
## License / Lisans
This project is licensed under the MIT License. See the `LICENSE` file for details.
```
**Ek Notlar:**
* **Rozetler (Badges):** Başlangıçta PyPI ve Lisans rozetleri ekledim (yorum satırı içinde). Eğer projeniz PyPI'da yayınlandıysa veya bir CI/CD süreci varsa, ilgili rozetleri eklemek iyi bir pratiktir.
* **LICENSE Dosyası:** `LICENSE` bölümünde bir `LICENSE` dosyasına referans verdim. Projenizin kök dizininde MIT lisans metnini içeren bir `LICENSE` dosyası oluşturduğunuzdan emin olun.
* **İçe Aktarma Yolları:** Örneklerde `import kececilayout as kl` veya `from kececilayout import kececi_layout_v4_igraph` gibi varsayımsal içe aktarma yolları kullandım. Kendi paket yapınıza göre bunları ayarlamanız gerekebilir.
* **Fonksiyon Adları:** Örneklerde `kececi_layout_v4` ve `kececi_layout_v4_igraph` gibi fonksiyon adlarını kullandım. Gerçek fonksiyon adlarınız farklıysa bunları güncelleyin.
* **Görselleştirme:** Örneklere `matplotlib.pyplot` kullanarak temel görselleştirme adımlarını ekledim, bu da kullanıcıların sonucu nasıl görebileceğini gösterir. Eksen oranlarını eşitlemek (`axis('equal')` veya `set_aspect('equal')`) layout'un doğru görünmesi için önemlidir.
```
## Citation
If this library was useful to you in your research, please cite us. Following the [GitHub citation standards](https://docs.github.com/en/github/creating-cloning-and-archiving-repositories/creating-a-repository-on-github/about-citation-files), here is the recommended citation.
### BibTeX
```bibtex
@misc{kececi_2025_15313946,
author = {Keçeci, Mehmet},
title = {kececilayout},
month = may,
year = 2025,
publisher = {PyPI, Anaconda, Github, Zenodo},
version = {0.2.0},
doi = {10.5281/zenodo.15313946},
url = {https://doi.org/10.5281/zenodo.15313946},
}
@misc{kececi_2025_15314329,
author = {Keçeci, Mehmet},
title = {Keçeci Layout},
month = may,
year = 2025,
publisher = {Zenodo},
version = {1.0.0},
doi = {10.5281/zenodo.15314329},
url = {https://doi.org/10.5281/zenodo.15314329},
}
```
### APA
```
Keçeci, M. (2025). The Keçeci Layout: A Deterministic Visualisation Framework for the Structural Analysis of Ordered Systems in Chemistry and Environmental Science. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.16696713
Keçeci, M. (2025). The Keçeci Layout: A Deterministic, Order-Preserving Visualization Algorithm for Structured Systems. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.16526798
Keçeci, M. (2025). Keçeci Deterministic Zigzag Layout. WorkflowHub. https://doi.org/10.48546/workflowhub.document.31.1
Keçeci, M. (2025). Keçeci Zigzag Layout Algorithm. Authorea. https://doi.org/10.22541/au.175087581.16524538/v1
Keçeci, M. (2025). The Keçeci Layout: A Structural Approach for Interdisciplinary Scientific Analysis. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.15792684
Keçeci, M. (2025). When Nodes Have an Order: The Keçeci Layout for Structured System Visualization. HAL open science. https://hal.science/hal-05143155; https://doi.org/10.13140/RG.2.2.19098.76484
Keçeci, M. (2025). The Keçeci Layout: A Cross-Disciplinary Graphical Framework for Structural Analysis of Ordered Systems. Authorea. https://doi.org/10.22541/au.175156702.26421899/v1
Keçeci, M. (2025). Beyond Traditional Diagrams: The Keçeci Layout for Structural Thinking. Knowledge Commons. https://doi.org/10.17613/v4w94-ak572
Keçeci, M. (2025). The Keçeci Layout: A Structural Approach for Interdisciplinary Scientific Analysis. figshare. Journal contribution. https://doi.org/10.6084/m9.figshare.29468135
Keçeci, M. (2025, July 3). The Keçeci Layout: A Structural Approach for Interdisciplinary Scientific Analysis. OSF. https://doi.org/10.17605/OSF.IO/9HTG3
Keçeci, M. (2025). Beyond Topology: Deterministic and Order-Preserving Graph Visualization with the Keçeci Layout. WorkflowHub. https://doi.org/10.48546/workflowhub.document.34.4
Keçeci, M. (2025). A Graph-Theoretic Perspective on the Keçeci Layout: Structuring Cross-Disciplinary Inquiry. Preprints. https://doi.org/10.20944/preprints202507.0589.v1
Keçeci, M. (2025). Keçeci Layout. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.15314328
Keçeci, M. (2025). kececilayout [Data set]. WorkflowHub. https://doi.org/10.48546/workflowhub.datafile.17.1
Keçeci, M. (2025, May 1). Kececilayout. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.15313946
```
### Chicago
```
Keçeci, Mehmet. The Keçeci Layout: A Deterministic Visualisation Framework for the Structural Analysis of Ordered Systems in Chemistry and Environmental Science. Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.16696713
Keçeci, Mehmet. The Keçeci Layout: A Deterministic, Order-Preserving Visualization Algorithm for Structured Systems. Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.16526798
Keçeci, Mehmet. kececilayout [Data set]. WorkflowHub, 2025. https://doi.org/10.48546/workflowhub.datafile.17.1
Keçeci, Mehmet. "Kececilayout". Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.15313946.
Keçeci, Mehmet. "Keçeci Layout". Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.15314328.
```
Raw data
{
"_id": null,
"home_page": "https://github.com/WhiteSymmetry/kececilayout",
"name": "kececilayout",
"maintainer": "Mehmet Ke\u00e7eci",
"docs_url": null,
"requires_python": ">=3.10",
"maintainer_email": "bilginomi@yaani.com",
"keywords": null,
"author": "Mehmet Ke\u00e7eci",
"author_email": "Mehmet Ke\u00e7eci <mkececi@yaani.com>",
"download_url": "https://files.pythonhosted.org/packages/96/87/30b3284f81dce6e5c977e2a8864f675a3f91a70be7ffd58f2d6cd29719ed/kececilayout-0.3.0.tar.gz",
"platform": null,
"description": "# KececiLayout\n\n[](https://badge.fury.io/py/kececilayout)\n[](https://opensource.org/licenses/MIT)\n\n[](https://doi.org/10.5281/zenodo.15313946)\n[](https://doi.org/10.5281/zenodo.15314328)\n[](https://doi.org/10.5281/zenodo.15353535)\n\n[](https://doi.org/10.48546/workflowhub.datafile.17.1)\n\n[](https://anaconda.org/bilgi/kececilayout)\n[](https://anaconda.org/bilgi/kececilayout)\n[](https://anaconda.org/bilgi/kececilayout)\n[](https://anaconda.org/bilgi/kececilayout)\n\n[](https://opensource.org/)\n[](https://kececilayout.readthedocs.io/en/latest)\n\n[](https://www.bestpractices.dev/projects/10531)\n\n[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/python_ci.yml)\n[](https://codecov.io/gh/WhiteSymmetry/kececilayout)\n[](https://terrarium.evidencepub.io/v2/gh/WhiteSymmetry/kececilayout/HEAD)\n[](https://pepy.tech/projects/kececilayout)\n[](CODE_OF_CONDUCT.md)\n[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/ci-cd.yml)\n[](https://github.com/astral-sh/ruff)\n\n| **Documentation** | **Paper** |\n|:-----------------:|:---------:|\n| [](https://kececilayout.readthedocs.io/) | [](https://doi.org/10.5281/zenodo.15314328) |\n\n---\n\n## \ud83c\udf10 English\n\n### Kececi Layout (Ke\u00e7eci Yerle\u015fimi)\n\n**KececiLayout** is a deterministic graph layout algorithm designed for visualizing linear or sequential structures with a characteristic \"zig-zag\" or \"serpentine\" pattern.\n\n*Python implementation of the Ke\u00e7eci layout algorithm for graph visualization.*\n\n---\n\n### Description\n\nThis algorithm arranges nodes sequentially along a primary axis and offsets them alternately along a secondary axis. It's particularly useful for path graphs, chains, or showing progression.\n\n**Key Features:**\n* **Linear Focus:** Ideal for visualizing paths, chains, or ordered processes.\n* **Deterministic:** Produces identical results for the same input.\n* **Overlap Reduction:** Prevents node collisions by spreading them across axes.\n* **Parametric:** Fully customizable with parameters like `primary_spacing`, `secondary_spacing`, `primary_direction`, and `secondary_start`.\n\n=> **v0.2.7**: Curved, transparent, 3D, and `expanding=True` styles supported.\n\n---\n\n### Installation\n\n```bash\nconda install bilgi::kececilayout -y\npip install kececilayout\n```\n\n\ud83d\udd17 [PyPI](https://pypi.org/project/kececilayout/) | [Conda](https://anaconda.org/bilgi/kececilayout) | [GitHub](https://github.com/WhiteSymmetry/kececilayout)\n\n---\n\n### Usage\n\n#### Example with NetworkX\n\n```python\nimport networkx as nx\nimport matplotlib.pyplot as plt\nimport kececilayout as kl\n\nG = nx.path_graph(10)\npos = kl.kececi_layout_v4(\n G,\n primary_spacing=1.0,\n secondary_spacing=0.5,\n primary_direction='top-down',\n secondary_start='right'\n)\n\nplt.figure(figsize=(6, 8))\nnx.draw(G, pos=pos, with_labels=True, node_color='skyblue', node_size=500)\nplt.title(\"Kececi Layout with NetworkX\")\nplt.axis('equal')\nplt.show()\n```\n\n\n\n#### Example with iGraph\n\n```python\nimport igraph as ig\nimport matplotlib.pyplot as plt\nfrom kececilayout import kececi_layout_v4_igraph\n\nG = ig.Graph.Ring(10, circular=False)\npos_list = kececi_layout_v4_igraph(G, primary_direction='left-to-right', secondary_start='up')\nlayout = ig.Layout(pos_list)\n\nfig, ax = plt.subplots(figsize=(8, 6))\nig.plot(G, target=ax, layout=layout, vertex_label=[f\"N{i}\" for i in range(10)])\nax.set_aspect('equal')\nplt.show()\n```\n\n\n\n#### Example with RustworkX\n\n```python\nimport rustworkx as rx\nimport kececilayout as kl\nimport matplotlib.pyplot as plt\n\nG = rx.generators.path_graph(10)\npos = kl.kececi_layout_v4(G, primary_direction='bottom-up')\n# Use matplotlib for drawing (see full example in repo)\n```\n\n\n\n#### Example with Networkit\n\n```python\nimport networkit as nk\nimport kececilayout as kl\nimport matplotlib.pyplot as plt\n\nG = nk.graph.Graph(10)\nfor i in range(9):\n G.addEdge(i, i+1)\npos = kl.kececi_layout_v4(G)\n# Draw with matplotlib\n```\n\n\n\n#### Example with Graphillion\n\n```python\nimport graphillion as gg\nimport kececilayout as kl\nimport matplotlib.pyplot as plt\n\nuniverse = [(i, i+1) for i in range(1, 10)]\ngg.GraphSet.set_universe(universe)\ngs = gg.GraphSet()\npos = kl.kececi_layout_v4(gs)\n# Draw with matplotlib\n```\n\n\n\n---\n\n### Supported Backends\n\n- **NetworkX**\n- **igraph**\n- **Rustworkx**\n- **Networkit**\n- **Graphillion**\n\n*Note: All backends are supported via unified `kececi_layout_v4` function.*\n\n---\n\n### Advanced Drawing Styles\n\nUse `draw_kececi` for enhanced visualizations:\n\n```python\nkl.draw_kececi(G, style='curved') # Smooth curved edges\nkl.draw_kececi(G, style='transparent') # Opacity based on edge length\nkl.draw_kececi(G, style='3d') # 3D helix layout\n```\n\n---\n\n### License\n\nMIT License. See [LICENSE](LICENSE) for details.\n\n---\n\n### Citation\n\nIf this library was useful in your research, please cite:\n\n```bibtex\n@misc{kececi_2025_15313946,\n author = {Ke\u00e7eci, Mehmet},\n title = {kececilayout},\n month = may,\n year = 2025,\n publisher = {Zenodo},\n version = {0.2.7},\n doi = {10.5281/zenodo.15313946},\n url = {https://doi.org/10.5281/zenodo.15313946}\n}\n```\n\n---\n\n## \ud83c\uddf9\ud83c\uddf7 T\u00fcrk\u00e7e\n\n### Ke\u00e7eci Yerle\u015fimi (Kececi Layout)\n\n**KececiLayout**, do\u011frusal veya ard\u0131\u015f\u0131k yap\u0131lar\u0131 g\u00f6rselle\u015ftirmek i\u00e7in tasarlanm\u0131\u015f, karakteristik bir \"z\u0131gzag\" veya \"y\u0131lanvari\" desen olu\u015fturan deterministik bir graf yerle\u015fim algoritmas\u0131d\u0131r.\n\n*Graf g\u00f6rselle\u015ftirme i\u00e7in Ke\u00e7eci yerle\u015fim algoritmas\u0131n\u0131n Python uygulamas\u0131.*\n\n---\n\n### A\u00e7\u0131klama\n\nBu algoritma, d\u00fc\u011f\u00fcmleri birincil eksen boyunca s\u0131ral\u0131 olarak yerle\u015ftirir ve ikincil eksen boyunca d\u00f6n\u00fc\u015f\u00fcml\u00fc olarak kayd\u0131r\u0131r. Yol graflar\u0131, zincirler veya ilerlemeyi g\u00f6stermek i\u00e7in \u00f6zellikle kullan\u0131\u015fl\u0131d\u0131r.\n\n**Temel \u00d6zellikler:**\n* **Do\u011frusal Odak:** Yollar, zincirler veya s\u0131ral\u0131 s\u00fcre\u00e7ler i\u00e7in idealdir.\n* **Deterministik:** Ayn\u0131 giri\u015f i\u00e7in her zaman ayn\u0131 \u00e7\u0131kt\u0131y\u0131 \u00fcretir.\n* **\u00c7ak\u0131\u015fmay\u0131 Azaltma:** D\u00fc\u011f\u00fcmleri eksenler boyunca yayarak \u00e7ak\u0131\u015fmalar\u0131 \u00f6nler.\n* **Parametrik:** `primary_spacing`, `secondary_spacing`, `primary_direction`, `secondary_start` gibi parametrelerle \u00f6zelle\u015ftirilebilir.\n\n=> **v0.2.7**: E\u011fri, \u015feffaf, 3B ve `expanding=True` stilleri desteklenir.\n\n---\n\n### Kurulum\n\n```bash\nconda install bilgi::kececilayout -y\npip install kececilayout\n```\n\n\ud83d\udd17 [PyPI](https://pypi.org/project/kececilayout/) | [Conda](https://anaconda.org/bilgi/kececilayout) | [GitHub](https://github.com/WhiteSymmetry/kececilayout)\n\n---\n\n### Kullan\u0131m\n\n#### NetworkX ile \u00d6rnek\n\n```python\nimport networkx as nx\nimport matplotlib.pyplot as plt\nimport kececilayout as kl\n\nG = nx.path_graph(10)\npos = kl.kececi_layout_v4(\n G,\n primary_spacing=1.0,\n secondary_spacing=0.5,\n primary_direction='top-down',\n secondary_start='right'\n)\n\nplt.figure(figsize=(6, 8))\nnx.draw(G, pos=pos, with_labels=True, node_color='skyblue', node_size=500)\nplt.title(\"Kececi Layout with NetworkX\")\nplt.axis('equal')\nplt.show()\n```\n\n\n\n#### iGraph ile \u00d6rnek\n\n```python\nimport igraph as ig\nimport matplotlib.pyplot as plt\nfrom kececilayout import kececi_layout_v4_igraph\n\nG = ig.Graph.Ring(10, circular=False)\npos_list = kececi_layout_v4_igraph(G, primary_direction='left-to-right', secondary_start='up')\nlayout = ig.Layout(pos_list)\n\nfig, ax = plt.subplots(figsize=(8, 6))\nig.plot(G, target=ax, layout=layout, vertex_label=[f\"N{i}\" for i in range(10)])\nax.set_aspect('equal')\nplt.show()\n```\n\n\n\n#### RustworkX ile \u00d6rnek\n\n```python\nimport rustworkx as rx\nimport kececilayout as kl\nimport matplotlib.pyplot as plt\n\nG = rx.generators.path_graph(10)\npos = kl.kececi_layout_v4(G, primary_direction='bottom-up')\n# Matplotlib ile \u00e7izim yap\u0131labilir\n```\n\n\n\n#### Networkit ile \u00d6rnek\n\n```python\nimport networkit as nk\nimport kececilayout as kl\nimport matplotlib.pyplot as plt\n\nG = nk.graph.Graph(10)\nfor i in range(9):\n G.addEdge(i, i+1)\npos = kl.kececi_layout_v4(G)\n# Matplotlib ile \u00e7izim\n```\n\n\n\n#### Graphillion ile \u00d6rnek\n\n```python\nimport graphillion as gg\nimport kececilayout as kl\nimport matplotlib.pyplot as plt\n\nuniverse = [(i, i+1) for i in range(1, 10)]\ngg.GraphSet.set_universe(universe)\ngs = gg.GraphSet()\npos = kl.kececi_layout_v4(gs)\n# Matplotlib ile \u00e7izim\n```\n\n\n\n---\n\n### Desteklenen K\u00fct\u00fcphaneler\n\n- **NetworkX**\n- **igraph**\n- **Rustworkx**\n- **Networkit**\n- **Graphillion**\n\n*Not: T\u00fcm k\u00fct\u00fcphaneler `kececi_layout_v4` fonksiyonu ile desteklenir.*\n\n---\n\n### Geli\u015fmi\u015f \u00c7izim Stilleri\n\n`draw_kececi` ile geli\u015fmi\u015f g\u00f6rselle\u015ftirmeler:\n\n```python\nkl.draw_kececi(G, style='curved') # E\u011fri kenarlar\nkl.draw_kececi(G, style='transparent') # Kenar uzunlu\u011funa g\u00f6re \u015feffafl\u0131k\nkl.draw_kececi(G, style='3d') # 3B heliks yerle\u015fimi\n```\n\n---\n\n### Lisans\n\nMIT Lisans\u0131. Detaylar i\u00e7in [LICENSE](LICENSE) dosyas\u0131na bak\u0131n.\n\n---\n\n### At\u0131f\n\nAra\u015ft\u0131rman\u0131zda bu k\u00fct\u00fcphaneyi kulland\u0131ysan\u0131z, l\u00fctfen a\u015fa\u011f\u0131daki gibi at\u0131f yap\u0131n:\n\n```bibtex\n@misc{kececi_2025_15313946,\n author = {Ke\u00e7eci, Mehmet},\n title = {kececilayout},\n month = may,\n year = 2025,\n publisher = {Zenodo},\n version = {0.2.7},\n doi = {10.5281/zenodo.15313946},\n url = {https://doi.org/10.5281/zenodo.15313946}\n}\n```\n\n---\n\n## \ud83d\udcda Documentation\n\nFor full documentation, visit: \n[**https://kececilayout.readthedocs.io**](https://kececilayout.readthedocs.io)\n\n---\n# KececiLayout\n\n[](https://badge.fury.io/py/kececilayout)\n[](https://opensource.org/licenses/MIT)\n\n[](https://doi.org/10.5281/zenodo.15313946)\n[](https://doi.org/10.5281/zenodo.15314328)\n[](https://doi.org/10.5281/zenodo.15353535)\n\n[](https://doi.org/10.48546/workflowhub.datafile.17.1)\n\n[](https://anaconda.org/bilgi/kececilayout)\n[](https://anaconda.org/bilgi/kececilayout)\n[](https://anaconda.org/bilgi/kececilayout)\n[](https://anaconda.org/bilgi/kececilayout)\n\n[](https://opensource.org/)\n[](https://kececilayout.readthedocs.io/en/latest)\n\n[](https://www.bestpractices.dev/projects/10531)\n\n[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/python_ci.yml)\n[](https://codecov.io/gh/WhiteSymmetry/kececilayout)\n[](https://kececilayout.readthedocs.io/en/latest/)\n[](https://terrarium.evidencepub.io/v2/gh/WhiteSymmetry/kececilayout/HEAD)\n[](https://badge.fury.io/py/kececilayout)\n[](https://pepy.tech/projects/kececilayout)\n[](CODE_OF_CONDUCT.md) \n[](https://github.com/WhiteSymmetry/kececilayout/actions/workflows/ci-cd.yml)\n[](https://github.com/astral-sh/ruff)\n\n| **Documentation**| **Paper**|\n|:----------------:|:--------:|\n|[](https://whitesymmetry.github.io/kececilayout/)|[](https://doi.org/10.5281/zenodo.15314328)|\n\n---\n\n<p align=\"left\">\n <table>\n <tr>\n <td style=\"text-align: center;\">PyPI</td>\n <td style=\"text-align: center;\">\n <a href=\"https://pypi.org/project/kececilayout/\">\n <img src=\"https://badge.fury.io/py/kececilayout.svg\" alt=\"PyPI version\" height=\"18\"/>\n </a>\n </td>\n </tr>\n <tr>\n <td style=\"text-align: center;\">Conda</td>\n <td style=\"text-align: center;\">\n <a href=\"https://anaconda.org/bilgi/kececilayout\">\n <img src=\"https://anaconda.org/bilgi/kececilayout/badges/version.svg\" alt=\"conda-forge version\" height=\"18\"/>\n </a>\n </td>\n </tr>\n <tr>\n <td style=\"text-align: center;\">DOI</td>\n <td style=\"text-align: center;\">\n <a href=\"https://doi.org/10.5281/zenodo.15313946\">\n <img src=\"https://zenodo.org/badge/DOI/10.5281/zenodo.15313946.svg\" alt=\"DOI\" height=\"18\"/>\n </a>\n </td>\n </tr>\n <tr>\n <td style=\"text-align: center;\">License: MIT</td>\n <td style=\"text-align: center;\">\n <a href=\"https://opensource.org/licenses/MIT\">\n <img src=\"https://img.shields.io/badge/License-MIT-yellow.svg\" alt=\"License\" height=\"18\"/>\n </a>\n </td>\n </tr>\n </table>\n</p>\n \n---\n\n**Kececi Layout (Ke\u00e7eci Yerle\u015fimi)**: A deterministic graph layout algorithm designed for visualizing linear or sequential structures with a characteristic \"zig-zag\" or \"serpentine\" pattern.\n\n*Python implementation of the Ke\u00e7eci layout algorithm for graph visualization.*\n\n---\n\n## Description / A\u00e7\u0131klama\n\nThis algorithm arranges nodes sequentially along a primary axis and offsets them alternately along a secondary axis. It's particularly useful for path graphs, chains, or showing progression.\n\n*Bu algoritma, d\u00fc\u011f\u00fcmleri birincil eksen boyunca s\u0131ral\u0131 olarak yerle\u015ftirir ve ikincil eksen boyunca d\u00f6n\u00fc\u015f\u00fcml\u00fc olarak kayd\u0131r\u0131r. Yol graflar\u0131, zincirler veya ilerlemeyi g\u00f6stermek i\u00e7in \u00f6zellikle kullan\u0131\u015fl\u0131d\u0131r.*\n\n=> 0.2.6: Curved, transparent, 3d, expanding=True\n\n---\n\n### English Description\n\n**Ke\u00e7eci Layout:**\n\nA 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.\n\n**Key Characteristics:**\n* **Linear Focus:** Particularly useful for visualizing linear or sequential structures, such as paths, chains, or ordered processes.\n* **Deterministic:** Produces the exact same layout for the same graph and parameters every time.\n* **Overlap Reduction:** Helps prevent node collisions by spreading nodes out away from the primary axis.\n* **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`).\n\n---\n\n### T\u00fcrk\u00e7e Tan\u0131mlama\n\n**Ke\u00e7eci Yerle\u015fimi (Ke\u00e7eci Layout):**\n\nGraf g\u00f6rselle\u015ftirmede kullan\u0131lan deterministik bir d\u00fc\u011f\u00fcm yerle\u015ftirme algoritmas\u0131d\u0131r. Bu y\u00f6ntemde d\u00fc\u011f\u00fcmler, belirlenen birincil (ana) eksen boyunca s\u0131ral\u0131 olarak yerle\u015ftirilir. Her bir sonraki d\u00fc\u011f\u00fcm, ana eksenin bir sa\u011f\u0131na bir soluna (veya bir \u00fcst\u00fcne bir alt\u0131na) olmak \u00fczere, ikincil eksen do\u011frultusunda d\u00f6n\u00fc\u015f\u00fcml\u00fc olarak kayd\u0131r\u0131l\u0131r. Genellikle, ana eksende ilerledik\u00e7e ikincil eksendeki kayd\u0131rma miktar\u0131 artar ve bu da karakteristik bir \"z\u0131gzag\" veya \"y\u0131lanvari\" desen olu\u015fturur.\n\n**Temel \u00d6zellikleri:**\n* **Do\u011frusal Odak:** \u00d6zellikle yollar (paths), zincirler veya s\u0131ral\u0131 s\u00fcre\u00e7ler gibi do\u011frusal veya ard\u0131\u015f\u0131k yap\u0131lar\u0131 g\u00f6rselle\u015ftirmek i\u00e7in kullan\u0131\u015fl\u0131d\u0131r.\n* **Deterministik:** Ayn\u0131 graf ve parametrelerle her zaman ayn\u0131 sonucu \u00fcretir.\n* **\u00c7ak\u0131\u015fmay\u0131 Azaltma:** D\u00fc\u011f\u00fcmleri ana eksenden uza\u011fa yayarak \u00e7ak\u0131\u015fmalar\u0131 \u00f6nlemeye yard\u0131mc\u0131 olur.\n* **Parametrik:** Ana eksenin y\u00f6n\u00fc (\u00f6rn. `top-down`), ikincil kayd\u0131rman\u0131n ba\u015flang\u0131\u00e7 y\u00f6n\u00fc (\u00f6rn. `start_right`) ve eksenler aras\u0131 bo\u015fluklar (`primary_spacing`, `secondary_spacing`) gibi parametrelerle \u00f6zelle\u015ftirilebilir.\n\n---\n\n## Installation / Kurulum\n\n```bash\nconda install bilgi::kececilayout -y\n\npip install kececilayout\n```\nhttps://anaconda.org/bilgi/kececilayout\n\nhttps://pypi.org/project/KececiLayout/\n\nhttps://github.com/WhiteSymmetry/kececilayout\n\nhttps://zenodo.org/records/15313947\n\nhttps://zenodo.org/records/15314329\n\n---\n\n## Usage / Kullan\u0131m\n\nThe layout function generally accepts a graph object and returns positions.\n\n### Example with NetworkX\n\n```python\nimport networkx as nx\nimport matplotlib.pyplot as plt\nimport kececilayout as kl # Assuming the main function is imported like this\nimport random\n\n# Create a graph\nG = nx.path_graph(10)\n\n# Calculate layout positions using the generic function\n# (Assuming kl.kececi_layout_v4 is the main/generic function)\npos = kl.kececi_layout_v4(G,\n primary_spacing=1.0,\n secondary_spacing=0.5,\n primary_direction='top-down',\n secondary_start='right')\n\n# Draw the graph\nplt.figure(figsize=(6, 8))\nnx.draw(G, pos=pos, with_labels=True, node_color='skyblue', node_size=500, font_size=10)\nplt.title(\"Ke\u00e7eci Layout with NetworkX\")\nplt.axis('equal') # Ensure aspect ratio is equal\nplt.show()\n```\n\n```python\nimport matplotlib.pyplot as plt\nimport math\nimport networkx as nx\nimport kececilayout as kl\nimport random\n\ntry:\n import kececilayout as kl\nexcept ImportError:\n print(\"Error: 'kececi_layout.py' not found or could not be imported.\")\n print(\"Please ensure the file containing kececi_layout_v4 is accessible.\")\n exit()\n\n# --- General Layout Parameters ---\nLAYOUT_PARAMS = {\n 'primary_spacing': 1.0,\n 'secondary_spacing': 0.6, # Make the zigzag noticeable\n 'primary_direction': 'top-down',\n 'secondary_start': 'right'\n}\nN_NODES = 10 # Number of nodes in the example graph\n\n# === NetworkX Example ===\ntry:\n import networkx as nx\n print(\"\\n--- NetworkX Example ---\")\n\n # Generate graph (Path graph)\n G_nx = nx.path_graph(N_NODES)\n print(f\"NetworkX graph generated: {G_nx.number_of_nodes()} nodes, {G_nx.number_of_edges()} edges\")\n\n # Calculate layout\n print(\"Calculating Ke\u00e7eci Layout...\")\n # Call the layout function from the imported module\n pos_nx = kl.kececi_layout_v4(G_nx, **LAYOUT_PARAMS)\n # print(\"NetworkX positions:\", pos_nx) # Debug print if needed\n\n # Plot\n plt.figure(figsize=(6, 8)) # Suitable figure size for vertical layout\n nx.draw(G_nx, # NetworkX graph object\n pos=pos_nx, # Positions calculated by Kececi Layout\n with_labels=True, # Show node labels (indices)\n node_color='skyblue',# Node color\n node_size=700, # Node size\n font_size=10, # Label font size\n edge_color='gray') # Edge color\n\n plt.title(f\"NetworkX ({N_NODES} Nodes) with Ke\u00e7eci Layout\") # Plot title\n plt.xlabel(\"X Coordinate\") # X-axis label\n plt.ylabel(\"Y Coordinate\") # Y-axis label\n plt.axis('equal') # Ensure equal aspect ratio for correct spacing perception\n # plt.grid(False) # Ensure grid is off\n plt.show() # Display the plot\n\nexcept ImportError:\n print(\"NetworkX is not installed. Skipping this example.\")\nexcept Exception as e:\n print(f\"An error occurred in the NetworkX example: {e}\")\n import traceback\n traceback.print_exc()\n\nprint(\"\\n--- NetworkX Example Finished ---\")\n```\n\n\n\n---\n### Example with iGraph\n\n```python\nimport igraph as ig\nimport matplotlib.pyplot as plt\n# Assuming a specific function for igraph exists or the generic one handles it\nfrom kececilayout import kececi_layout_v4_igraph # Adjust import if needed\nimport random\n\n# Create a graph\nG = ig.Graph.Ring(10, circular=False) # Path graph equivalent\nfor i in range(G.vcount()):\n G.vs[i][\"name\"] = f\"N{i}\"\n\n# Calculate layout positions (returns a list of coords)\npos_list = kececi_layout_v4_igraph(G,\n primary_spacing=1.5,\n secondary_spacing=1.0,\n primary_direction='left-to-right',\n secondary_start='up')\nlayout = ig.Layout(coords=pos_list)\n\n# Draw the graph\nfig, ax = plt.subplots(figsize=(8, 6))\nig.plot(\n G,\n target=ax,\n layout=layout,\n vertex_label=G.vs[\"name\"],\n vertex_color=\"lightblue\",\n vertex_size=30\n)\nax.set_title(\"Ke\u00e7eci Layout with iGraph\")\nax.set_aspect('equal', adjustable='box')\nplt.show()\n```\n\n```python\nimport matplotlib.pyplot as plt\nimport math\nimport igraph as ig\nimport kececilayout as kl\n\n\ntry:\n import kececilayout as kl\nexcept ImportError:\n print(\"Error: 'kececi_layout.py' not found or could not be imported.\")\n print(\"Please ensure the file containing kececi_layout_v4 is accessible.\")\n exit()\n\n# --- General Layout Parameters ---\nLAYOUT_PARAMS = {\n 'primary_spacing': 1.0,\n 'secondary_spacing': 0.6, # Make the zigzag noticeable\n 'primary_direction': 'top-down',\n 'secondary_start': 'right'\n}\nN_NODES = 10 # Number of nodes in the example graph\n\n# === igraph Example ===\ntry:\n import igraph as ig\n print(\"\\n--- igraph Example ---\")\n\n # Generate graph (Path graph using Ring(circular=False))\n G_ig = ig.Graph.Ring(N_NODES, directed=False, circular=False)\n print(f\"igraph graph generated: {G_ig.vcount()} vertices, {G_ig.ecount()} edges\")\n\n # Calculate layout\n print(\"Calculating Ke\u00e7eci Layout...\")\n # Call the layout function from the imported module\n pos_ig = kl.kececi_layout_v4(G_ig, **LAYOUT_PARAMS)\n # print(\"igraph positions (dict):\", pos_ig) # Debug print if needed\n\n # Convert positions dict to list ordered by vertex index for ig.plot\n layout_list_ig = []\n plot_possible = True\n if pos_ig: # Check if dictionary is not empty\n try:\n # Generate list: [pos_ig[0], pos_ig[1], ..., pos_ig[N-1]]\n layout_list_ig = [pos_ig[i] for i in range(G_ig.vcount())]\n # print(\"igraph layout (list):\", layout_list_ig) # Debug print if needed\n except KeyError as e:\n print(f\"ERROR: Key {e} not found while creating position list for igraph.\")\n print(\"The layout function might not have returned positions for all vertices.\")\n plot_possible = False # Cannot plot if list is incomplete\n else:\n print(\"ERROR: Ke\u00e7eci Layout returned empty positions for igraph.\")\n plot_possible = False\n\n # Plot using igraph's plotting capabilities\n print(\"Plotting graph using igraph.plot...\")\n fig, ax = plt.subplots(figsize=(6, 8)) # Generate matplotlib figure and axes\n\n if plot_possible:\n ig.plot(G_ig,\n target=ax, # Draw on the matplotlib axes\n layout=layout_list_ig, # Use the ORDERED LIST of coordinates\n vertex_label=[str(i) for i in range(G_ig.vcount())], # Labels 0, 1,...\n vertex_color='lightgreen',\n vertex_size=30, # Note: igraph vertex_size scale differs\n edge_color='gray')\n else:\n ax.text(0.5, 0.5, \"Plotting failed:\\nMissing or incomplete layout positions.\",\n ha='center', va='center', color='red', fontsize=12) # Error message on plot\n\n ax.set_title(f\"igraph ({N_NODES} Nodes) with Ke\u00e7eci Layout\") # Plot title\n ax.set_aspect('equal', adjustable='box') # Ensure equal aspect ratio\n # ax.grid(False) # Ensure grid is off\n plt.show() # Display the plot\n\nexcept ImportError:\n print(\"python-igraph is not installed. Skipping this example.\")\nexcept Exception as e:\n print(f\"An error occurred in the igraph example: {e}\")\n import traceback\n traceback.print_exc()\n\nprint(\"\\n--- igraph Example Finished ---\")\n```\n\n\n\n---\n\n### Example with RustworkX\n\n```python\nimport matplotlib.pyplot as plt\nfrom matplotlib.collections import LineCollection # Efficient edge drawing\nimport math\nimport rustworkx as rx\nimport kececilayout as kl\nimport random\n\n\ntry:\n import kececilayout as kl\nexcept ImportError:\n print(\"Error: 'kececi_layout.py' not found or could not be imported.\")\n print(\"Please ensure the file containing kececi_layout_v4 is accessible.\")\n exit()\n\n# --- General Layout Parameters ---\nLAYOUT_PARAMS = {\n 'primary_spacing': 1.0,\n 'secondary_spacing': 0.6, # Make the zigzag noticeable\n 'primary_direction': 'top-down',\n 'secondary_start': 'right'\n}\nN_NODES = 10 # Number of nodes in the example graph\n\n# === Rustworkx Example ===\ntry:\n import rustworkx as rx\n print(\"\\n--- Rustworkx Example ---\")\n\n # Generate graph (Path graph)\n G_rx = rx.generators.path_graph(N_NODES)\n print(f\"Rustworkx graph generated: {G_rx.num_nodes()} nodes, {G_rx.num_edges()} edges\")\n\n # Calculate layout\n print(\"Calculating Ke\u00e7eci Layout...\")\n # Call the layout function from the imported module\n pos_rx = kl.kececi_layout_v4(G_rx, **LAYOUT_PARAMS)\n # print(\"Rustworkx positions:\", pos_rx) # Debug print if needed\n\n # Plot using Matplotlib directly (Rustworkx doesn't have a built-in draw)\n print(\"Plotting graph using Matplotlib...\")\n plt.figure(figsize=(6, 8))\n ax = plt.gca() # Get current axes\n\n node_indices_rx = G_rx.node_indices() # Get node indices [0, 1, ...]\n\n # Check if all nodes have positions\n if not all(idx in pos_rx for idx in node_indices_rx):\n print(\"ERROR: Rustworkx positions dictionary does not cover all nodes!\")\n # Decide how to handle: exit, plot partial, etc.\n else:\n # Draw nodes\n x_coords_rx = [pos_rx[i][0] for i in node_indices_rx]\n y_coords_rx = [pos_rx[i][1] for i in node_indices_rx]\n ax.scatter(x_coords_rx, y_coords_rx, s=700, c='#88CCEE', zorder=2, label='Nodes') # Skyblue color\n\n # Draw labels\n for i in node_indices_rx:\n ax.text(pos_rx[i][0], pos_rx[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)\n\n # Draw edges using LineCollection for efficiency\n edge_lines = []\n for u, v in G_rx.edge_list(): # Get list of edges (node index pairs)\n if u in pos_rx and v in pos_rx:\n # Segment format: [(x1, y1), (x2, y2)]\n edge_lines.append([pos_rx[u], pos_rx[v]])\n else:\n print(f\"Warning: Position not found for edge ({u},{v}) in Rustworkx graph.\")\n\n if edge_lines:\n lc = LineCollection(edge_lines, colors='gray', linewidths=1.0, zorder=1, label='Edges')\n ax.add_collection(lc) # Add edges to the plot axes\n\n plt.title(f\"Rustworkx ({N_NODES} Nodes) with Ke\u00e7eci Layout (Matplotlib)\") # Plot title\n plt.xlabel(\"X Coordinate\") # X-axis label\n plt.ylabel(\"Y Coordinate\") # Y-axis label\n plt.axis('equal') # Ensure equal aspect ratio\n # plt.grid(False) # Ensure grid is off\n plt.show() # Display the plot\n\nexcept ImportError:\n print(\"Rustworkx is not installed. Skipping this example.\")\nexcept Exception as e:\n print(f\"An error occurred in the Rustworkx example: {e}\")\n import traceback\n traceback.print_exc()\n\nprint(\"\\n--- Rustworkx Example Finished ---\")\n```\n\n\n\n---\n\n### Example with Networkit\n\n```python\nimport matplotlib.pyplot as plt\nfrom matplotlib.collections import LineCollection # Efficient edge drawing\nimport math\nimport networkit as nk\nimport kececilayout as kl\nimport random\n\ntry:\n import kececilayout as kl\nexcept ImportError:\n print(\"Error: 'kececi_layout.py' not found or could not be imported.\")\n print(\"Please ensure the file containing kececi_layout_v4 is accessible.\")\n exit()\n\n# --- General Layout Parameters ---\nLAYOUT_PARAMS = {\n 'primary_spacing': 1.0,\n 'secondary_spacing': 0.6, # Make the zigzag noticeable\n 'primary_direction': 'top-down',\n 'secondary_start': 'right'\n}\nN_NODES = 10 # Number of nodes in the example graph\n\n# === Networkit Example ===\ntry:\n import networkit as nk\n print(\"\\n--- Networkit Example ---\")\n\n # Generate graph (Path graph, manually)\n G_nk = nk.graph.Graph(N_NODES, weighted=False, directed=False) # Generate empty graph container\n print(\"Empty Networkit graph generated.\")\n # Add nodes first (Networkit often requires this)\n for i in range(N_NODES):\n if not G_nk.hasNode(i): # Check if node already exists (good practice)\n G_nk.addNode()\n print(f\"{G_nk.numberOfNodes()} nodes added.\")\n # Add edges\n for i in range(N_NODES - 1):\n G_nk.addEdge(i, i+1) # Add edges 0-1, 1-2, ...\n print(f\"Networkit graph constructed: {G_nk.numberOfNodes()} nodes, {G_nk.numberOfEdges()} edges\")\n\n # Calculate layout\n print(\"Calculating Ke\u00e7eci Layout...\")\n # Call the layout function from the imported module\n pos_nk = kl.kececi_layout_v4(G_nk, **LAYOUT_PARAMS)\n # print(\"Networkit positions:\", pos_nk) # Debug print if needed\n\n # Plot using Matplotlib directly (Networkit doesn't have a simple built-in draw)\n print(\"Plotting graph using Matplotlib...\")\n plt.figure(figsize=(6, 8))\n ax = plt.gca() # Get current axes\n\n node_indices_nk = sorted(list(G_nk.iterNodes())) # Get node indices [0, 1, ...]\n\n # Check if all nodes have positions\n if not all(idx in pos_nk for idx in node_indices_nk):\n print(\"ERROR: Networkit positions dictionary does not cover all nodes!\")\n else:\n # Draw nodes\n x_coords_nk = [pos_nk[i][0] for i in node_indices_nk]\n y_coords_nk = [pos_nk[i][1] for i in node_indices_nk]\n ax.scatter(x_coords_nk, y_coords_nk, s=700, c='coral', zorder=2, label='Nodes')\n\n # Draw labels\n for i in node_indices_nk:\n ax.text(pos_nk[i][0], pos_nk[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)\n\n # Draw edges using LineCollection\n edge_lines_nk = []\n for u, v in G_nk.iterEdges(): # Iterate through edges\n if u in pos_nk and v in pos_nk:\n edge_lines_nk.append([pos_nk[u], pos_nk[v]])\n else:\n print(f\"Warning: Position not found for edge ({u},{v}) in Networkit graph.\")\n\n if edge_lines_nk:\n lc_nk = LineCollection(edge_lines_nk, colors='gray', linewidths=1.0, zorder=1, label='Edges')\n ax.add_collection(lc_nk)\n\n plt.title(f\"Networkit ({N_NODES} Nodes) with Ke\u00e7eci Layout (Matplotlib)\") # Plot title\n plt.xlabel(\"X Coordinate\") # X-axis label\n plt.ylabel(\"Y Coordinate\") # Y-axis label\n plt.axis('equal') # Ensure equal aspect ratio\n # plt.grid(False) # Ensure grid is off\n plt.show() # Display the plot\n\nexcept ImportError:\n print(\"Networkit is not installed. Skipping this example.\")\nexcept Exception as e:\n print(f\"An error occurred in the Networkit example: {e}\")\n import traceback\n traceback.print_exc()\n\nprint(\"\\n--- Networkit Example Finished ---\")\n```\n\n\n\n---\n\n### Example with Graphillion\n\n```python\nimport matplotlib.pyplot as plt\nfrom matplotlib.collections import LineCollection # Efficient edge drawing\nimport math\nimport itertools # Graphillion might implicitly need itertools if find_max_node_id uses it internally\nimport graphillion as gg\nimport kececilayout as kl\nimport random\n\n\ntry:\n import kececilayout as kl\nexcept ImportError:\n print(\"Error: 'kececi_layout.py' not found or could not be imported.\")\n print(\"Please ensure the file containing kececi_layout_v4 is accessible.\")\n exit()\n\n# --- General Layout Parameters ---\nLAYOUT_PARAMS = {\n 'primary_spacing': 1.0,\n 'secondary_spacing': 0.6, # Make the zigzag noticeable\n 'primary_direction': 'top-down',\n 'secondary_start': 'right'\n}\nN_NODES = 10 # Number of nodes in the example graph (will be 1 to N_NODES)\n\n# === Graphillion Example ===\ntry:\n import graphillion as gg\n print(\"\\n--- Graphillion Example ---\")\n\n # Define the universe of possible edges (Path graph, 1-based indexing common)\n universe = []\n # Edges (1,2), (2,3), ..., (N_NODES-1, N_NODES)\n for i in range(1, N_NODES):\n universe.append((i, i + 1))\n gg.GraphSet.set_universe(universe)\n max_node_gg = N_NODES # We know the max node ID for this simple case\n print(f\"Graphillion universe defined: {len(universe)} edges, max node ID {max_node_gg}\")\n\n # Generate a GraphSet object (can be empty, layout function uses the universe)\n # The layout function provided seems to derive nodes from the universe edges.\n gs = gg.GraphSet()\n\n # Calculate layout\n print(\"Calculating Ke\u00e7eci Layout...\")\n # Call the layout function; it should handle the Graphillion GraphSet object\n # and likely use 1-based indexing based on the universe.\n pos_gg = kl.kececi_layout_v4(gs, **LAYOUT_PARAMS)\n # print(\"Graphillion positions:\", pos_gg) # Debug print if needed\n\n # Plot using Matplotlib directly (Graphillion has no plotting)\n print(\"Plotting graph using Matplotlib...\")\n plt.figure(figsize=(6, 8))\n ax = plt.gca() # Get current axes\n\n # Node indices are expected to be 1, 2, ... N_NODES from the universe\n node_indices_gg = sorted(pos_gg.keys())\n\n # Check if all expected nodes (1 to N_NODES) have positions\n expected_nodes = set(range(1, N_NODES + 1))\n if not expected_nodes.issubset(set(node_indices_gg)):\n print(f\"ERROR: Graphillion positions missing expected nodes. Found: {node_indices_gg}, Expected: {list(expected_nodes)}\")\n else:\n # Draw nodes\n x_coords_gg = [pos_gg[i][0] for i in node_indices_gg]\n y_coords_gg = [pos_gg[i][1] for i in node_indices_gg]\n ax.scatter(x_coords_gg, y_coords_gg, s=700, c='gold', zorder=2, label='Nodes')\n\n # Draw labels (using the 1-based indices)\n for i in node_indices_gg:\n ax.text(pos_gg[i][0], pos_gg[i][1], str(i), ha='center', va='center', fontsize=10, zorder=3)\n\n # Draw edges using LineCollection (from the defined universe)\n edge_lines_gg = []\n for u, v in universe: # Use the universe edges\n if u in pos_gg and v in pos_gg:\n edge_lines_gg.append([pos_gg[u], pos_gg[v]])\n else:\n print(f\"Warning: Position not found for universe edge ({u},{v}) in Graphillion.\")\n\n if edge_lines_gg:\n lc_gg = LineCollection(edge_lines_gg, colors='gray', linewidths=1.0, zorder=1, label='Edges')\n ax.add_collection(lc_gg)\n\n plt.title(f\"Graphillion ({N_NODES} Nodes) with Ke\u00e7eci Layout (Matplotlib)\") # Plot title\n plt.xlabel(\"X Coordinate\") # X-axis label\n plt.ylabel(\"Y Coordinate\") # Y-axis label\n plt.axis('equal') # Ensure equal aspect ratio\n # plt.grid(False) # Ensure grid is off\n plt.show() # Display the plot\n\nexcept ImportError:\n print(\"Graphillion is not installed. Skipping this example.\")\nexcept Exception as e:\n print(f\"An error occurred in the Graphillion example: {e}\")\n import traceback\n traceback.print_exc()\n\nprint(\"\\n--- Graphillion Example Finished ---\")\n```\n\n\n\n---\n\n## Supported Backends / Desteklenen K\u00fct\u00fcphaneler\n\nThe layout functions are designed to work with graph objects from the following libraries:\n\n* **NetworkX:** (`networkx.Graph`, `networkx.DiGraph`, etc.)\n* **igraph:** (`igraph.Graph`)\n* **Rustworkx:** (Requires appropriate conversion or adapter function)\n* **Networkit:** (Requires appropriate conversion or adapter function)\n* **Graphillion:** (Requires appropriate conversion or adapter function)\n\n*Note: Direct support might vary. Check specific function documentation for compatibility details.*\n\n---\n\n## License / Lisans\n\nThis project is licensed under the MIT License. See the `LICENSE` file for details.\n\n```\n\n**Ek Notlar:**\n\n* **Rozetler (Badges):** Ba\u015flang\u0131\u00e7ta PyPI ve Lisans rozetleri ekledim (yorum sat\u0131r\u0131 i\u00e7inde). E\u011fer projeniz PyPI'da yay\u0131nland\u0131ysa veya bir CI/CD s\u00fcreci varsa, ilgili rozetleri eklemek iyi bir pratiktir.\n* **LICENSE Dosyas\u0131:** `LICENSE` b\u00f6l\u00fcm\u00fcnde bir `LICENSE` dosyas\u0131na referans verdim. Projenizin k\u00f6k dizininde MIT lisans metnini i\u00e7eren bir `LICENSE` dosyas\u0131 olu\u015fturdu\u011funuzdan emin olun.\n* **\u0130\u00e7e Aktarma Yollar\u0131:** \u00d6rneklerde `import kececilayout as kl` veya `from kececilayout import kececi_layout_v4_igraph` gibi varsay\u0131msal i\u00e7e aktarma yollar\u0131 kulland\u0131m. Kendi paket yap\u0131n\u0131za g\u00f6re bunlar\u0131 ayarlaman\u0131z gerekebilir.\n* **Fonksiyon Adlar\u0131:** \u00d6rneklerde `kececi_layout_v4` ve `kececi_layout_v4_igraph` gibi fonksiyon adlar\u0131n\u0131 kulland\u0131m. Ger\u00e7ek fonksiyon adlar\u0131n\u0131z farkl\u0131ysa bunlar\u0131 g\u00fcncelleyin.\n* **G\u00f6rselle\u015ftirme:** \u00d6rneklere `matplotlib.pyplot` kullanarak temel g\u00f6rselle\u015ftirme ad\u0131mlar\u0131n\u0131 ekledim, bu da kullan\u0131c\u0131lar\u0131n sonucu nas\u0131l g\u00f6rebilece\u011fini g\u00f6sterir. Eksen oranlar\u0131n\u0131 e\u015fitlemek (`axis('equal')` veya `set_aspect('equal')`) layout'un do\u011fru g\u00f6r\u00fcnmesi i\u00e7in \u00f6nemlidir.\n```\n\n## Citation\n\nIf this library was useful to you in your research, please cite us. Following the [GitHub citation standards](https://docs.github.com/en/github/creating-cloning-and-archiving-repositories/creating-a-repository-on-github/about-citation-files), here is the recommended citation.\n\n### BibTeX\n\n```bibtex\n@misc{kececi_2025_15313946,\n author = {Ke\u00e7eci, Mehmet},\n title = {kececilayout},\n month = may,\n year = 2025,\n publisher = {PyPI, Anaconda, Github, Zenodo},\n version = {0.2.0},\n doi = {10.5281/zenodo.15313946},\n url = {https://doi.org/10.5281/zenodo.15313946},\n}\n\n@misc{kececi_2025_15314329,\n author = {Ke\u00e7eci, Mehmet},\n title = {Ke\u00e7eci Layout},\n month = may,\n year = 2025,\n publisher = {Zenodo},\n version = {1.0.0},\n doi = {10.5281/zenodo.15314329},\n url = {https://doi.org/10.5281/zenodo.15314329},\n}\n```\n### APA\n\n```\n\nKe\u00e7eci, M. (2025). The Ke\u00e7eci Layout: A Deterministic Visualisation Framework for the Structural Analysis of Ordered Systems in Chemistry and Environmental Science. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.16696713\n\nKe\u00e7eci, M. (2025). The Ke\u00e7eci Layout: A Deterministic, Order-Preserving Visualization Algorithm for Structured Systems. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.16526798\n\nKe\u00e7eci, M. (2025). Ke\u00e7eci Deterministic Zigzag Layout. WorkflowHub. https://doi.org/10.48546/workflowhub.document.31.1\n\nKe\u00e7eci, M. (2025). Ke\u00e7eci Zigzag Layout Algorithm. Authorea. https://doi.org/10.22541/au.175087581.16524538/v1\n\nKe\u00e7eci, M. (2025). The Ke\u00e7eci Layout: A Structural Approach for Interdisciplinary Scientific Analysis. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.15792684\n\nKe\u00e7eci, M. (2025). When Nodes Have an Order: The Ke\u00e7eci Layout for Structured System Visualization. HAL open science. https://hal.science/hal-05143155; https://doi.org/10.13140/RG.2.2.19098.76484\n\nKe\u00e7eci, M. (2025). The Ke\u00e7eci Layout: A Cross-Disciplinary Graphical Framework for Structural Analysis of Ordered Systems. Authorea. https://doi.org/10.22541/au.175156702.26421899/v1\n\nKe\u00e7eci, M. (2025). Beyond Traditional Diagrams: The Ke\u00e7eci Layout for Structural Thinking. Knowledge Commons. https://doi.org/10.17613/v4w94-ak572\n\nKe\u00e7eci, M. (2025). The Ke\u00e7eci Layout: A Structural Approach for Interdisciplinary Scientific Analysis. figshare. Journal contribution. https://doi.org/10.6084/m9.figshare.29468135\n\nKe\u00e7eci, M. (2025, July 3). The Ke\u00e7eci Layout: A Structural Approach for Interdisciplinary Scientific Analysis. OSF. https://doi.org/10.17605/OSF.IO/9HTG3\n\nKe\u00e7eci, M. (2025). Beyond Topology: Deterministic and Order-Preserving Graph Visualization with the Ke\u00e7eci Layout. WorkflowHub. https://doi.org/10.48546/workflowhub.document.34.4\n\nKe\u00e7eci, M. (2025). A Graph-Theoretic Perspective on the Ke\u00e7eci Layout: Structuring Cross-Disciplinary Inquiry. Preprints. https://doi.org/10.20944/preprints202507.0589.v1\n\nKe\u00e7eci, M. (2025). Ke\u00e7eci Layout. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.15314328\n\nKe\u00e7eci, M. (2025). kececilayout [Data set]. WorkflowHub. https://doi.org/10.48546/workflowhub.datafile.17.1\n\nKe\u00e7eci, M. (2025, May 1). Kececilayout. Open Science Articles (OSAs), Zenodo. https://doi.org/10.5281/zenodo.15313946\n\n```\n\n### Chicago\n\n```\n\nKe\u00e7eci, Mehmet. The Ke\u00e7eci Layout: A Deterministic Visualisation Framework for the Structural Analysis of Ordered Systems in Chemistry and Environmental Science. Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.16696713\n\nKe\u00e7eci, Mehmet. The Ke\u00e7eci Layout: A Deterministic, Order-Preserving Visualization Algorithm for Structured Systems. Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.16526798\n\nKe\u00e7eci, Mehmet. kececilayout [Data set]. WorkflowHub, 2025. https://doi.org/10.48546/workflowhub.datafile.17.1\n\nKe\u00e7eci, Mehmet. \"Kececilayout\". Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.15313946.\n\nKe\u00e7eci, Mehmet. \"Ke\u00e7eci Layout\". Open Science Articles (OSAs), Zenodo, 2025. https://doi.org/10.5281/zenodo.15314328.\n```\n\n\n\n\n\n\n",
"bugtrack_url": null,
"license": "MIT License\n \n Copyright (c) 2025 Mehmet Ke\u00e7eci\n \n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n \n The above copyright notice and this permission notice shall be included in all\n copies or substantial portions of the Software.\n \n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n SOFTWARE.\n ",
"summary": "\u00c7e\u015fitli graf k\u00fct\u00fcphaneleri i\u00e7in s\u0131ral\u0131-zigzag yerle\u015fimleri sa\u011flayan bir Python paketi.",
"version": "0.3.0",
"project_urls": {
"Bug Tracker": "https://github.com/WhiteSymmetry/kececilayout/issues",
"Homepage": "https://github.com/WhiteSymmetry/kececilayout"
},
"split_keywords": [],
"urls": [
{
"comment_text": null,
"digests": {
"blake2b_256": "e6261d0cd0afdac29bb93ac6ea7cecd2ed8fd598c772e841f139317008e53c55",
"md5": "e4cdb97348fd4458be66e90c28d94da4",
"sha256": "7a52e6f273964c59aa6eaa3bdca3c7da8178dd81a9ed532b780512dd8c2349da"
},
"downloads": -1,
"filename": "kececilayout-0.3.0-py3-none-any.whl",
"has_sig": false,
"md5_digest": "e4cdb97348fd4458be66e90c28d94da4",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.10",
"size": 23255,
"upload_time": "2025-08-10T19:02:38",
"upload_time_iso_8601": "2025-08-10T19:02:38.875393Z",
"url": "https://files.pythonhosted.org/packages/e6/26/1d0cd0afdac29bb93ac6ea7cecd2ed8fd598c772e841f139317008e53c55/kececilayout-0.3.0-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": null,
"digests": {
"blake2b_256": "968730b3284f81dce6e5c977e2a8864f675a3f91a70be7ffd58f2d6cd29719ed",
"md5": "33520785612e3da09eabd38c6165b148",
"sha256": "eea887a53944fd8868e05f4b27da4e00b1d5d83c02055af393d0218beafd0e1a"
},
"downloads": -1,
"filename": "kececilayout-0.3.0.tar.gz",
"has_sig": false,
"md5_digest": "33520785612e3da09eabd38c6165b148",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.10",
"size": 45475,
"upload_time": "2025-08-10T19:02:40",
"upload_time_iso_8601": "2025-08-10T19:02:40.388224Z",
"url": "https://files.pythonhosted.org/packages/96/87/30b3284f81dce6e5c977e2a8864f675a3f91a70be7ffd58f2d6cd29719ed/kececilayout-0.3.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2025-08-10 19:02:40",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "WhiteSymmetry",
"github_project": "kececilayout",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"requirements": [],
"lcname": "kececilayout"
}
