pygraphds 0.1.2__tar.gz → 0.1.3__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: pygraphds
3
- Version: 0.1.2
3
+ Version: 0.1.3
4
4
  Summary: Beginner-friendly graph data structures and operations
5
5
  Author: Dr. Mohamed B.
6
6
  License-Expression: MIT
@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
4
4
 
5
5
  [project]
6
6
  name = "pygraphds"
7
- version = "0.1.2"
7
+ version = "0.1.3"
8
8
  description = "Beginner-friendly graph data structures and operations"
9
9
  readme = "README.md"
10
10
  requires-python = ">=3.9"
@@ -1,3 +1,3 @@
1
1
  """Package version, shared by the public and class-level version attributes."""
2
2
 
3
- __version__ = "0.1.2"
3
+ __version__ = "0.1.3"
@@ -335,7 +335,8 @@ class Graph:
335
335
 
336
336
  ``crossing`` chooses the mark where differently directed edge strokes
337
337
  meet: ``"x"`` (default), ``"+"``, or ``""`` for a blank. Nodes are
338
- placed in a five-column grid; edge strokes are drawn behind labels.
338
+ placed in a compact grid with at most five columns; edge strokes are
339
+ drawn behind labels.
339
340
  """
340
341
  if crossing != "" and crossing != "+" and crossing != "x":
341
342
  raise ValueError('crossing must be "", "+", or "x"')
@@ -352,7 +353,7 @@ class Graph:
352
353
  )
353
354
  labels[name] = "[" + visible_name + "]"
354
355
  widest_label = max(len(label) for label in labels.values())
355
- column_count = min(5, len(names))
356
+ column_count = min(5, math.ceil(len(names) / 2))
356
357
  column_spacing = max(8, widest_label + 3)
357
358
  row_spacing = 4
358
359
  positions: dict[str, list[int]] = {}
@@ -381,10 +382,7 @@ class Graph:
381
382
  else:
382
383
  stroke = "/"
383
384
 
384
- if dx != 0 and dy != 0:
385
- step_count = abs(dy)
386
- else:
387
- step_count = max(abs(dx), abs(dy))
385
+ step_count = max(abs(dx), abs(dy))
388
386
  for step in range(1, step_count):
389
387
  x = round(x1 + dx * step / step_count)
390
388
  y = round(y1 + dy * step / step_count)
@@ -476,7 +474,7 @@ class Graph:
476
474
  name,
477
475
  ha="center",
478
476
  va="center",
479
- fontsize=9,
477
+ fontsize=11.25,
480
478
  color="#172554",
481
479
  zorder=3,
482
480
  )
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: pygraphds
3
- Version: 0.1.2
3
+ Version: 0.1.3
4
4
  Summary: Beginner-friendly graph data structures and operations
5
5
  Author: Dr. Mohamed B.
6
6
  License-Expression: MIT
File without changes
File without changes
File without changes
File without changes