Changes of the Raku package "Graph".

2026-08-02 0.1.2
    - Optimization: Faster vertex-component for paths longer than 1.
        - Using Dijkstra's algorithm instead of Floyd-Warshall.
        - Betting on the number of the input vertices to be relatively small.
    - Implemented the methods is-loop-free and is-path.

2026-08-02 0.1.1
    - Implemented the methods edge-weight-unitize and vertex-component.
    - Currently, vertex-component is very slow for paths longer than 1.
        - Because of its use of the vey slow method distance-matrix.

2026-06-04 0.1.0
    - Implemented CLI script for graph creation.
    - Renamed the Graph class attribute "adjacency-list" to "adjacency-map".
    - The Graph class has its own Graph.json method.
    - Better scale of the vertex coordinates of k-partite graphs.

2026-06-03 0.0.39
    - Implemented complete multi-partite graphs.
        - Graph::Complete.new([k1, k2, ...])

2026-05-28 0.0.38
    - Graph::Relation can be initialized with vertex coordinates.
    - Implemented the methods distance and distance-matrix.

2026-05-24 0.0.37
    - Implemented Graph::Leaper.
        - Graph::Leaper is generalization of Graph::KnightTour.
    - Fix:More straightforward and correct subgraph derivation based on edges.

2026-01-18 0.0.36
    - Implemented Butterfly graph construction.
            - Related documentation examples in "Named-graphs-gallery.ipynb".
    - Minor fix of Harary graph construction.

2026-01-17 0.0.35
    - Implemented Harary graph construction.
        - Related documentation examples in "Named-graphs-gallery.ipynb".

2025-12-29 0.0.34
    - Fix: the tolerance for rounding in Graph::HexagonalGrid was too small.
        - It is used to turn the cell points into (unique) graph vertexes.
    - Fix/refactor: graph cloning also clones the vertex coordinates.

2025-12-27 0.0.33
    - Implemented relation graph, "Graph::Relation".

2025-12-23 0.0.32
    - Bug fix -- proper subgraph making with vertices that do not have edges.

2025-12-19 0.0.31
    - Bug fixes:
        - Proper handling of vertexes with no edges by .index-graph()
        - More consistent (and concise) creators .new(...).