multi-weighted-graph 0.3.0__tar.gz

multi_weighted_graph-0.3.0/.gitignore

@@ -0,0 +1,44 @@
+# Python bytecode
+__pycache__/
+*.py[cod]
+*$py.class
+
+# Virtual environments
+.venv/
+venv/
+env/
+ENV/
+
+# Distribution / packaging
+build/
+dist/
+*.egg-info/
+
+# Test / coverage
+.pytest_cache/
+.coverage
+.coverage.*
+htmlcov/
+.tox/
+.nox/
+
+# Type checkers
+.mypy_cache/
+.pyright/
+.ruff_cache/
+
+# Jupyter
+.ipynb_checkpoints/
+
+# IDEs / editors
+.vscode/
+.idea/
+
+# OS files
+.DS_Store
+Thumbs.db
+
+# Local environment / secrets
+.env
+.env.*
+!.env.example

multi_weighted_graph-0.3.0/PKG-INFO

@@ -0,0 +1,96 @@
+Metadata-Version: 2.5
+Name: multi_weighted_graph
+Version: 0.3.0
+Summary: A data type representing a graph in which edges can be associated to more weights.
+Project-URL: Homepage, https://github.com/Gabri432/multi_weighted_graph
+Project-URL: Issues, https://github.com/Gabri432/multi_weighted_graph/issues
+Author-email: Gabriele Gatti <gabrielegatti432@gmail.com>
+Maintainer-email: Gabriele Gatti <gabrielegatti432@gmail.com>
+License: Apache License
+License-File: license
+Classifier: Intended Audience :: Education
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3.14
+Classifier: Topic :: Education
+Requires-Python: >=3.14.3
+Provides-Extra: dev
+Requires-Dist: pytest>=9.1.1; extra == 'dev'
+Description-Content-Type: text/markdown
+
+# MultiWeightedGraph
+
+- A class representing graphs having multiple weights associated to each edge.
+
+## Project structure
+```
+- multi_weighted_graph (root)
+    - license
+    - README.md
+    - .gitignore
+    - pyproject.toml
+    - src/multi_weighted_graph (folder)
+        - __init__.py
+        - _core.py
+        - _utils.py
+        - py.typed
+    - tests (folder)
+        - test_core.py
+```
+
+## Tech stack
+
+- Python 3.14.3
+- pytest 9.1.1
+
+## How to use it
+- To run tests run the command:
+```
+pytest
+```
+
+- Import the class and start using it:
+```py
+from multi_weighted_graph import MultiWeightedGraph
+
+my_graph = MultiWeightedGraph("My New Graph", 2)
+my_graph.add_edge("a", "b", [4, 2])
+my_graph.add_edge("b", "c", [3, 2])
+my_graph.add_edge("c", "d", [2, 2])
+my_graph.add_edge("a", "d", [1, 3])
+my_graph.add_edge("e", "f", [3, 5])
+my_graph.remove_edge("e", "f")
+
+print(my_graph.minimal_spanning_tree())
+print(my_graph.matrix_of_distances())
+print(my_graph.matrix_of_distances_from_source("a"))
+```
+
+- Calculate the minimal spanning tree:
+```py
+>>> print(my_graph.minimal_spanning_tree()) 
+[GraphEdge('a', 'd', [1, 2]), GraphEdge('c', 'd', [2, 2]), GraphEdge('b', 'c', [3, 2])]
+
+>>> print(my_graph.minimal_spanning_tree(1)) # building the minimal spanning tree using the second weight associated to edges
+[GraphEdge('a', 'b', [4, 2]), GraphEdge('b', 'c', [3, 2]), GraphEdge('c', 'd', [2, 2])]
+
+```
+
+- Calculate the matrix of distances between each vertex:
+```py
+>>> print(my_graph.matrix_of_distances())
+[[0, 4, 3, 1], [4, 0, 3, 5], [3, 3, 0, 2], [1, 5, 2, 0]]
+```
+
+- Calculate the matrix of distances from a vertex to all the others
+```py
+>>> print(my_graph.matrix_of_distances_from_source("a", 0)) # distance from vertex "a" to all the others, using first weight associated to edges
+[0, 4, 3, 1]
+```
+
+
+## Notes
+
+- The intended use of this project is for personal and/or educational purposes.
+- The project is under the Apache License, that you can see from [here](https://github.com/Gabri432/multi_weighted_graph/blob/main/license)
+

multi_weighted_graph-0.3.0/README.md

@@ -0,0 +1,76 @@
+# MultiWeightedGraph
+
+- A class representing graphs having multiple weights associated to each edge.
+
+## Project structure
+```
+- multi_weighted_graph (root)
+    - license
+    - README.md
+    - .gitignore
+    - pyproject.toml
+    - src/multi_weighted_graph (folder)
+        - __init__.py
+        - _core.py
+        - _utils.py
+        - py.typed
+    - tests (folder)
+        - test_core.py
+```
+
+## Tech stack
+
+- Python 3.14.3
+- pytest 9.1.1
+
+## How to use it
+- To run tests run the command:
+```
+pytest
+```
+
+- Import the class and start using it:
+```py
+from multi_weighted_graph import MultiWeightedGraph
+
+my_graph = MultiWeightedGraph("My New Graph", 2)
+my_graph.add_edge("a", "b", [4, 2])
+my_graph.add_edge("b", "c", [3, 2])
+my_graph.add_edge("c", "d", [2, 2])
+my_graph.add_edge("a", "d", [1, 3])
+my_graph.add_edge("e", "f", [3, 5])
+my_graph.remove_edge("e", "f")
+
+print(my_graph.minimal_spanning_tree())
+print(my_graph.matrix_of_distances())
+print(my_graph.matrix_of_distances_from_source("a"))
+```
+
+- Calculate the minimal spanning tree:
+```py
+>>> print(my_graph.minimal_spanning_tree()) 
+[GraphEdge('a', 'd', [1, 2]), GraphEdge('c', 'd', [2, 2]), GraphEdge('b', 'c', [3, 2])]
+
+>>> print(my_graph.minimal_spanning_tree(1)) # building the minimal spanning tree using the second weight associated to edges
+[GraphEdge('a', 'b', [4, 2]), GraphEdge('b', 'c', [3, 2]), GraphEdge('c', 'd', [2, 2])]
+
+```
+
+- Calculate the matrix of distances between each vertex:
+```py
+>>> print(my_graph.matrix_of_distances())
+[[0, 4, 3, 1], [4, 0, 3, 5], [3, 3, 0, 2], [1, 5, 2, 0]]
+```
+
+- Calculate the matrix of distances from a vertex to all the others
+```py
+>>> print(my_graph.matrix_of_distances_from_source("a", 0)) # distance from vertex "a" to all the others, using first weight associated to edges
+[0, 4, 3, 1]
+```
+
+
+## Notes
+
+- The intended use of this project is for personal and/or educational purposes.
+- The project is under the Apache License, that you can see from [here](https://github.com/Gabri432/multi_weighted_graph/blob/main/license)
+

multi_weighted_graph-0.3.0/license

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 Gabriele Gatti
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

multi_weighted_graph-0.3.0/pyproject.toml

@@ -0,0 +1,39 @@
+[build-system]
+requires = ["hatchling >= 1.26"]
+build-backend = "hatchling.build"
+
+[project]
+name = "multi_weighted_graph"
+version = "0.3.0"
+description = "A data type representing a graph in which edges can be associated to more weights."
+readme = "README.md"
+requires-python = ">=3.14.3"
+license = {text = "Apache License"}
+authors = [
+    {name = "Gabriele Gatti", email = "gabrielegatti432@gmail.com"},
+]
+maintainers = [
+  { name="Gabriele Gatti", email="gabrielegatti432@gmail.com" },
+]
+classifiers = [
+    "Operating System :: OS Independent",
+    "License :: OSI Approved :: Apache Software License",
+    "Programming Language :: Python :: 3.14",
+    "Intended Audience :: Education",
+    "Topic :: Education"
+]
+
+[project.urls]
+Homepage = "https://github.com/Gabri432/multi_weighted_graph"
+Issues = "https://github.com/Gabri432/multi_weighted_graph/issues"
+
+[project.optional-dependencies]
+dev = [
+    "pytest>=9.1.1",
+]
+
+[tool.hatch.build.targets.wheel]
+where = ["src/multi_weighted_graph"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]

multi_weighted_graph-0.3.0/src/multi_weighted_graph/__init__.py

@@ -0,0 +1,3 @@
+from ._core import MultiWeightedGraph
+
+__all__ = ["MultiWeightedGraph"]

multi_weighted_graph-0.3.0/src/multi_weighted_graph/_core.py

@@ -0,0 +1,223 @@
+class MultiWeightedGraph:
+    '''An instance of class MultiWeightedGraph represents a graph in which each edge is associated to one or more weights.'''
+    class GraphEdge:
+        def __init__(self, vertex_a: str, vertex_b: str, weights: list[float]) -> None:
+            self.vertex_a = vertex_a
+            self.vertex_b = vertex_b
+            self.weights = weights
+    
+        def __str__(self) -> str:
+            return "(" + self.vertex_a + ")- "+ str(self.weights) + " -(" + self.vertex_b +")"
+            
+        def __repr__(self) -> str:
+            return f"GraphEdge({self.vertex_a!r}, {self.vertex_b!r}, {self.weights!r})"
+
+    class __Partition__:
+        def __init__(self, name: str) -> None:
+            self.name = name
+            self.elements = set(name)
+
+        def __find__(self, name: str) -> bool:
+            return self.elements.__contains__(name)
+
+        def __str__(self) -> str:
+            return "{"+ self.elements.__str__() +"}"
+                    
+        def __repr__(self) -> str:
+            return f"Partition(name={self.name}, elements={self.elements})"
+
+        def __union__(self, elements: set[str], new_name: str) -> None:
+            self.elements = self.elements.union(elements)
+            self.name = new_name
+
+        def __eq__(self, value: object) -> bool:
+            if not isinstance(value, MultiWeightedGraph.__Partition__):
+                return False
+
+            return value.name == self.name
+
+        def __hash__(self) -> int:
+            return hash(self.name)
+
+    class __Vertex__:
+        def __init__(self, vertex: str, distance_from_source: float) -> None:
+            self.vertex = vertex
+            self.distance_from_source = distance_from_source
+
+        def __str__(self) -> str:
+            return "{"+ self.vertex +" : " + str(self.distance_from_source)+"}"
+                    
+        def __repr__(self) -> str:
+            return f"Vertex(name={self.vertex}, distance_from_source={self.distance_from_source})"
+
+    class __VertexNeighbours__:
+        def __init__(self, vertex: str, neighbours: list[MultiWeightedGraph.__Vertex__]):
+            self.vertex = vertex
+            self.neighbourhood = neighbours
+
+        def __str__(self) -> str:
+            return "{"+ self.vertex +" : " + str(self.neighbourhood)+"}"
+                    
+        def __repr__(self) -> str:
+            return f"Vertex(name={self.vertex}, neighbours={self.neighbourhood})"
+    
+    def __init__(self, name: str = "My new multi-weighted graph", number_of_weights_per_edge: int = 1) -> None:
+        self.name = name
+        self.weights_per_edge = number_of_weights_per_edge
+        self.edges: list[MultiWeightedGraph.GraphEdge] = []
+        self.vertices: list[str] = []
+
+    def __str__(self) -> str:
+        return self.name
+
+    def __repr__(self) -> str:
+        return f"MultiWeightedGraph({self.name!r}, {self.weights_per_edge})"
+
+    def add_edge(self, first_vertex_name: str, second_vertex_name: str, weights: list[float]) -> None:
+        '''Adds an edge to the graph by specifying the name of the vertices, as well as a list of weights to associate to such edge'''
+        edge = self.GraphEdge(first_vertex_name, second_vertex_name, weights)
+        self.edges.append(edge)
+        if (self.vertices.__contains__(first_vertex_name) == False): 
+            self.vertices.append(first_vertex_name)
+        if (self.vertices.__contains__(second_vertex_name) == False):
+            self.vertices.append(second_vertex_name)
+
+    def remove_edge(self, first_vertex_name: str, second_vertex_name: str) -> None:
+        '''Removes an edge from the graph by specifying its two vertices.'''
+        for edge in self.edges:
+            condition1 = edge.vertex_a == first_vertex_name and edge.vertex_b == second_vertex_name
+            condition2 = edge.vertex_a == second_vertex_name and edge.vertex_b == first_vertex_name
+            if condition1:
+                self.edges.remove(edge)
+            elif condition2:
+                self.edges.remove(edge)
+
+    def minimal_spanning_tree(self, weights_to_select: int) -> list[MultiWeightedGraph.GraphEdge]:
+        '''Calculate the minimal spanning tree based on the weight selected for each edge.'''
+        ordered_edges = sorted(self.edges, key=lambda edge:(edge.weights[weights_to_select]))
+        current_tree: list[MultiWeightedGraph.GraphEdge] = []
+        partition: list[MultiWeightedGraph.__Partition__] = []
+        for edge in ordered_edges:
+            part_a = self.__Partition__(edge.vertex_a)
+            part_b = self.__Partition__(edge.vertex_b)
+            if partition.__contains__(part_a) == False:
+                partition.append(part_a)
+            if partition.__contains__(part_b) == False:
+                partition.append(part_b)
+            if not self.__same_partition__(partition, edge.vertex_a, edge.vertex_b):
+                partition_of_a = self.__find_partition__(partition, edge.vertex_a)
+                partition_of_b = self.__find_partition__(partition, edge.vertex_b)
+                partition.remove(partition_of_a)
+                partition.remove(partition_of_b)
+                partition_of_a.__union__(partition_of_b.elements, part_a.name)
+                partition.append(partition_of_a)
+                current_tree.append(edge)
+        return current_tree
+
+    def __same_partition__(self, partition: list[MultiWeightedGraph.__Partition__], vertex_a: str, vertex_b) -> bool:
+        for sub_partition in partition:
+            if sub_partition.__find__(vertex_a) and sub_partition.__find__(vertex_b):
+                return True
+        return False
+
+    def __find_partition__(self, partition: list[MultiWeightedGraph.__Partition__], name: str) -> MultiWeightedGraph.__Partition__:
+        for sub_partition in partition:
+            if sub_partition.name == name or sub_partition.elements.__contains__(name):
+                return sub_partition
+        return MultiWeightedGraph.__Partition__("")
+
+    def matrix_of_distances(self, weight_to_select: int = 0) -> list[list[float]]:
+        '''Calculates the matrix of distances between vertices based on the weight selected for each edge.'''
+        n = len(self.vertices)
+        v_to_idx = {v: i for i, v in enumerate(self.vertices)}
+        inf = float("inf")
+        dist = [[inf] * n for _ in range(n)]
+        for i in range(n):
+            dist[i][i] = 0
+
+        for edge in self.edges:
+            dist[v_to_idx[edge.vertex_a]][v_to_idx[edge.vertex_b]] = edge.weights[weight_to_select]
+            dist[v_to_idx[edge.vertex_b]][v_to_idx[edge.vertex_a]] = edge.weights[weight_to_select]
+
+        for k in range(n):
+            for i in range(n):
+                for j in range(n):
+                    if dist[i][j] > dist[i][k] + dist[k][j]:
+                        dist[i][j] = dist[i][k] + dist[k][j]
+        return dist
+
+    def matrix_of_distances_from_source(self, source: str, weight_to_select: int = 0) -> list[float]:
+        '''Calculates the matrix of distances between vertices from a specific vertex (source) based on the weight selected for each edge.'''
+        graph = self.__create_adjacency_lists__(weight_to_select)
+        n = len(self.vertices)
+        explored = [False for _ in range(n)]
+        dist_from_source = self.__initialize_distance_vector__(source, weight_to_select)
+        v_to_idx = {v: i for i, v in enumerate(self.vertices)}
+        idx_to_v = {i: v for i, v in enumerate(self.vertices)}
+        a = (v_to_idx.get(source))
+        if a != None:
+            explored[a] = True
+        for _, v in enumerate(self.vertices):
+            if v != source:
+                index_min = self.__get_min_distance_vertex_index__(explored, dist_from_source)
+                adjacent_list: list[MultiWeightedGraph.__Vertex__] = []
+                vertex_of_min_distance = idx_to_v.get(index_min)
+                if vertex_of_min_distance != None:
+                    adjacent_list = self.__get_specific_adjacent_list__(vertex_of_min_distance, graph)
+                for vert in adjacent_list:
+                    index_of_adj_vertex = v_to_idx.get(vert.vertex)
+                    if index_of_adj_vertex != None and explored[index_of_adj_vertex]:
+                        continue
+                    if index_of_adj_vertex != None and dist_from_source[index_of_adj_vertex] > dist_from_source[index_min] + vert.distance_from_source:
+                        dist_from_source[index_of_adj_vertex] = dist_from_source[index_min] + vert.distance_from_source
+                explored[index_min] = True
+        return dist_from_source
+
+    def __create_adjacency_lists__(self, weight_to_select: int = 0) -> list[MultiWeightedGraph.__VertexNeighbours__]:
+        main_list: list[MultiWeightedGraph.__VertexNeighbours__] = []
+        for vertex in self.vertices:
+            adj: list[MultiWeightedGraph.__Vertex__] = []
+            for edge in self.edges:
+                if edge.vertex_a == vertex:
+                    new_vertex = MultiWeightedGraph.__Vertex__(edge.vertex_b, edge.weights[weight_to_select])
+                    adj.append(new_vertex)
+                elif edge.vertex_b == vertex:
+                    new_vertex = MultiWeightedGraph.__Vertex__(edge.vertex_a, edge.weights[weight_to_select])
+                    adj.append(new_vertex)
+            vertex_neighbourhood = MultiWeightedGraph.__VertexNeighbours__(vertex, adj)
+            main_list.append(vertex_neighbourhood)
+        return main_list
+    
+    def __get_specific_adjacent_list__(self, vertex: str, graph: list[MultiWeightedGraph.__VertexNeighbours__]) -> list[MultiWeightedGraph.__Vertex__]:
+        for v_ne in graph:
+            if v_ne.vertex == vertex:
+                return v_ne.neighbourhood
+        return []
+
+    def __initialize_distance_vector__(self, vertex: str, weight_to_select: int = 0) -> list[float]:
+        n = len(self.vertices)
+        v_to_idx = {v: i for i, v in enumerate(self.vertices)}
+        inf = float("inf")
+        dist_from_source = [inf * n for _ in range(n)]
+        for i in range(n):
+            if i == v_to_idx.get(vertex):
+                dist_from_source[i] = 0
+            else:
+                dist_from_source[i] = inf
+        for edge in self.edges:
+            a = v_to_idx.get(edge.vertex_a)
+            b = v_to_idx.get(edge.vertex_b)
+            if edge.vertex_a == vertex and b != None:
+                dist_from_source[b] = edge.weights[weight_to_select]
+            elif edge.vertex_b == vertex and a != None:
+                dist_from_source[a] = edge.weights[weight_to_select]
+        return dist_from_source
+
+    def __get_min_distance_vertex_index__(self, explored_vertices: list, distances_from_source: list[float]) -> int:
+        min_dist = float("inf")
+        index = 0
+        for i, dist in enumerate(distances_from_source):
+            if dist < min_dist and explored_vertices[i] == False:
+                min_dist = dist
+                index = i
+        return index

multi_weighted_graph-0.3.0/tests/test_core.py

@@ -0,0 +1,79 @@
+from multi_weighted_graph import MultiWeightedGraph
+
+
+def test_add_edges():
+    my_graph = MultiWeightedGraph()
+    my_graph.add_edge("a", "b", [2])
+    assert len(my_graph.edges) == 1
+
+def test_remove_edges():
+    my_graph = MultiWeightedGraph()
+    my_graph.add_edge("a", "b", [2])
+    my_graph.add_edge("c", "d", [2])
+    my_graph.remove_edge("a", "b")
+    assert len(my_graph.edges) == 1
+
+def test_minimal_spanning_tree_1():
+    my_graph = MultiWeightedGraph()
+    my_graph.add_edge("a", "b", [2])
+    my_graph.add_edge("c", "d", [2])
+    my_graph.add_edge("a", "d", [2])
+    my_graph.add_edge("a", "c", [3])
+    spanning_tree = my_graph.minimal_spanning_tree(0)
+    total_weight = 0
+    for edge in spanning_tree:
+        total_weight += edge.weights[0]
+    assert total_weight == 6
+
+def test_minimal_spanning_tree_2():
+    my_graph = MultiWeightedGraph("", 2)
+    my_graph.add_edge("a", "b", [4, 2])
+    my_graph.add_edge("b", "c", [3, 2])
+    my_graph.add_edge("c", "d", [2, 2])
+    my_graph.add_edge("a", "d", [1, 2])
+    spanning_tree_first_weight = my_graph.minimal_spanning_tree(0)
+    spanning_tree_second_weight = my_graph.minimal_spanning_tree(1)
+    total_weight_1 = 0
+    total_weight_2 = 0
+    for edge in spanning_tree_first_weight:
+        total_weight_1 += edge.weights[0]
+    for edge in spanning_tree_second_weight:
+            total_weight_2 += edge.weights[1]
+    assert total_weight_1 == total_weight_2
+
+def test_matrix_of_distances():
+    my_graph = MultiWeightedGraph("", 2)
+    my_graph.add_edge("a", "b", [4, 2])
+    my_graph.add_edge("b", "c", [3, 2])
+    my_graph.add_edge("c", "d", [2, 2])
+    my_graph.add_edge("a", "d", [1, 2])
+    v_to_idx = {v: i for i, v in enumerate(my_graph.vertices)}
+    matrix_0 = my_graph.matrix_of_distances(0)
+    matrix_1 = my_graph.matrix_of_distances(1)
+    b = v_to_idx.get("b")
+    d = v_to_idx.get("d")
+    if b != None and d != None:
+        assert matrix_0[b][d] == 5
+        assert matrix_1[d][b] == 4
+
+def test_matrix_of_distances_from_source():
+    my_graph = MultiWeightedGraph("", 2)
+    my_graph.add_edge("a", "b", [4, 2])
+    my_graph.add_edge("b", "c", [3, 2])
+    my_graph.add_edge("c", "d", [2, 2])
+    my_graph.add_edge("a", "d", [1, 2])
+    v_to_idx = {v: i for i, v in enumerate(my_graph.vertices)}
+    vector_a = my_graph.matrix_of_distances_from_source("a", 0)
+    vector_c = my_graph.matrix_of_distances_from_source("c", 1)
+    vector_b = my_graph.matrix_of_distances_from_source("b", 0)
+    vector_d = my_graph.matrix_of_distances_from_source("d", 0)
+    a = v_to_idx.get("a")
+    b = v_to_idx.get("b")
+    c = v_to_idx.get("c")
+    d = v_to_idx.get("d")
+    print(v_to_idx)
+    if a != None and c != None and b != None and d != None:
+        assert vector_a[c] == 3
+        assert vector_c[a] == 4
+        assert vector_b[d] == 5
+        assert vector_d[b] == 5