kececilayout 0.4.5__tar.gz → 0.4.6__tar.gz

{kececilayout-0.4.5/kececilayout.egg-info → kececilayout-0.4.6}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: kececilayout
-Version: 0.4.5
+Version: 0.4.6
 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

{kececilayout-0.4.5 → kececilayout-0.4.6}/kececilayout/__init__.py

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

{kececilayout-0.4.5 → kececilayout-0.4.6}/kececilayout/_version.py

@@ -1,6 +1,6 @@
 # _version.py
 
-__version__ = "0.4.5"
+__version__ = "0.4.6"
 __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"

{kececilayout-0.4.5 → kececilayout-0.4.6}/kececilayout/kececi_layout.py

@@ -3,8 +3,8 @@
 """
 kececilayout.py
 
-Bu modül, çeşitli Python graf kütüphaneleri için sıralı-zigzag ("Keçeci Layout")
-ve gelişmiş görselleştirme stilleri sağlar.
+This module provides sequential-zigzag ("Keçeci Layout") and advanced visualization styles for various Python graph libraries.
+Bu modül, çeşitli Python graf kütüphaneleri için sıralı-zigzag ("Keçeci Layout") ve gelişmiş görselleştirme stilleri sağlar.
 """
 
 import graphillion as gg
@@ -1111,11 +1111,28 @@ def to_networkx(graph):
     """Converts any supported graph type to a NetworkX graph."""
     if isinstance(graph, nx.Graph):
         return graph.copy()
+    
     nx_graph = nx.Graph()
+    
+    # PyZX graph support
+    try:
+        import pyzx as zx
+        if hasattr(graph, 'vertices') and hasattr(graph, 'edges'):
+            # PyZX graph olduğunu varsay
+            for v in graph.vertices():
+                nx_graph.add_node(v)
+            for edge in graph.edges():
+                if len(edge) == 2:
+                    nx_graph.add_edge(edge[0], edge[1])
+            return nx_graph
+    except ImportError:
+        pass
+    
+    # Diğer graph kütüphaneleri...
     if rx and isinstance(graph, (rx.PyGraph, rx.PyDiGraph)):
         nx_graph.add_nodes_from(graph.node_indices())
         nx_graph.add_edges_from(graph.edge_list())
-    elif ig and isinstance(graph, ig.Graph):
+    elif ig and hasattr(ig, 'Graph') and isinstance(graph, ig.Graph):
         nx_graph.add_nodes_from(v.index for v in graph.vs)
         nx_graph.add_edges_from(graph.get_edgelist())
     elif nk and isinstance(graph, nk.graph.Graph):
@@ -1123,16 +1140,16 @@ def to_networkx(graph):
         nx_graph.add_edges_from(graph.iterEdges())
     elif gg and isinstance(graph, gg.GraphSet):
         edges = graph.universe()
-        max_node_id = max(set(itertools.chain.from_iterable(edges))) if edges else 0
+        max_node_id = find_max_node_id(edges)
         if max_node_id > 0:
             nx_graph.add_nodes_from(range(1, max_node_id + 1))
             nx_graph.add_edges_from(edges)
     else:
         # This block is rarely reached as _get_nodes_from_graph would fail first
-        raise TypeError(f"Unsupported graph type {type(graph)} could not be converted to NetworkX.")
         #raise TypeError(f"Desteklenmeyen graf tipi {type(graph)} NetworkX'e dönüştürülemedi.")
-    return nx_graph
+        raise TypeError(f"Unsupported graph type {type(graph)} could not be converted to NetworkX.")
 
+    return nx_graph
 
 def _kececi_layout_3d_helix(nx_graph):
     """Internal function: Arranges nodes in a helix along the Z-axis."""
@@ -1319,7 +1336,7 @@ def _draw_internal(nx_graph, ax, style, **kwargs):
         ax.set_title("Keçeci Layout: 3D Helix")
         ax.set_axis_off()
         ax.view_init(elev=20, azim=-60)
-"""        
+"""
 def _draw_internal(nx_graph, ax, style, **kwargs):
     #Internal router that handles the different drawing styles.
     layout_params = {
@@ -1443,7 +1460,3 @@ if __name__ == '__main__':
     plt.show()
 
 
-
-
-
-

{kececilayout-0.4.5 → kececilayout-0.4.6/kececilayout.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: kececilayout
-Version: 0.4.5
+Version: 0.4.6
 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

{kececilayout-0.4.5 → kececilayout-0.4.6}/pyproject.toml

@@ -1,12 +1,12 @@
 # pyproject.toml
 
 [build-system]
-requires = ["setuptools>=61.0", "wheel"]
+requires = ["setuptools>=77.0"]
 build-backend = "setuptools.build_meta"
 
 [project]
 name = "kececilayout"
-version = "0.4.5"
+version = "0.4.6"
 
 # Diğer proje bilgileri (isteğe bağlı ama tavsiye edilir)
 authors = [
@@ -45,8 +45,28 @@ test = [
     "graphillion",
 ]
 
+[dependency-groups]
+dev = [{include-group = "test"}]
+test = ["pytest"]
+
+[tool.pytest.ini_options]
+log_level = "INFO"
+xfail_strict = true
+addopts = ["-ra", "--strict-config", "--strict-markers"]
+filterwarnings = ["error"]
+minversion = "6.0"
+testpaths = [
+    "tests",
+    "integration",
+]
+
+[tool.readthedocs]
+version = 2
+build.image = "stable"
+python.version = "3.11"
+configuration = "docs/conf.py"  # Build konfigürasyonu belirtin
+
 [project.urls]
 "Homepage" = "https://github.com/WhiteSymmetry/kececilayout"
 "Bug Tracker" = "https://github.com/WhiteSymmetry/kececilayout/issues"
 
-

{kececilayout-0.4.5 → kececilayout-0.4.6}/setup.py

@@ -24,7 +24,6 @@ def get_version():
 
 setup(
     name="kececilayout",
-    #version="0.2.9",
     version=get_version(),
     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.",
     long_description=long_description,
@@ -56,3 +55,4 @@ setup(
 
 
 
+