PyPyNum 1.7.0__py3-none-any.whl → 1.8.1__py3-none-any.whl

{PyPyNum-1.7.0.dist-info → PyPyNum-1.8.1.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.7.0
+Version: 1.8.1
 Summary: A multifunctional mathematical calculation package written in pure Python programming language [Python>=3.5]
 Home-page: https://www.gitee.com/PythonSJL/PyPyNum
 Author: Shen Jiayi
@@ -668,6 +668,7 @@ License:
         For more information on this, and how to apply and follow the GNU AGPL, see
         <http://www.gnu.org/licenses/>.
         
+Keywords: math,数学,mathematics,数学计算,numerical,数值,computation,计算,scientific,科学,algebra,代数,calculus,微积分,statistics,统计,linear-algebra,线性代数,optimization,优化,numerical-analysis,数值分析,matrix,矩阵,vector,向量,tensor,张量,numerics,数值计算,library,库,tools,工具,utils,实用程序,algorithms,算法,software,软件,package,包,methods,方法,data-science,数据科学,machine-learning,机器学习,computational,计算的,operations,操作,functions,函数,processing,处理,programming,编程,simulation,仿真,visualization,可视化,physics,物理
 Requires-Python: >=3.5
 Description-Content-Type: text/markdown
 
@@ -691,7 +692,7 @@ Description-Content-Type: text/markdown
 [![Downloads](https://static.pepy.tech/badge/pypynum/month)](https://pepy.tech/project/pypynum)
 [![Downloads](https://static.pepy.tech/badge/pypynum/week)](https://pepy.tech/project/pypynum)
 
-## Version -> 1.7.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
+## Version -> 1.8.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -740,54 +741,11 @@ Python interpreter and run it!)
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-新增代码行数：
-约八百行
+eig函数修复了计算错误并改名为eigen
 
-New code lines:
-approximately 800 lines
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-部分函数再次优化，性能提高一倍。
-
-Partial functions were optimized
-again, resulting in a doubling
-of performance.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增的好玩功能举例。
-
-Examples of newly added fun
-features.
-
-新增的有序集合包含绝大多数内置集合的运算
-，并且另有几个新函数。请注意它不是从内置
-集合继承的。
-
-The newly added ordered set
-contains the majority of
-built-in set operations, and
-there are also several new
-functions. Please note that it
-does not inherit from the
-built-in set.
-
-新增的无穷迭代器支持迭代多种数列，默认的
-空字符串即为自增数列。目前支持的数列有等
-差数列、等比数列、斐波那契数列与卡特兰数
-列。
-
-The newly added infinite
-iterator supports iterating
-multiple sequences, and the
-default empty string is the self
-increasing sequence. The
-currently supported sequences
-include arithmetic sequences,
-proportional sequences,
-Fibonacci sequences, and Catalan
-sequences.
+The eig function fixed
+calculation errors and changed
+its name to eigen
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
@@ -796,34 +754,13 @@ sequences.
 <<<The ellipsis in the following structure represents the original part>>>
 
 PyPyNum
-    ★ Tree [Various trees]
-        CLASSES
-            MultiTree
-            MultiTreeNode
-    ★ maths [Mathematical functions]
-        FUNCTIONS
-            ...
-            totient(n: int) -> int
-            mod_order(a: int, n: int, b: int) -> int
-            primitive_root(a: int, single: bool = False) -> Union[int, list]
-            normalize(data: arr, target: num = 1) -> arr
-            average(data, weights, expected=False)
-            exgcd(a: int, b: int) -> tuple
-            crt(n: arr, a: arr) -> int
-    ★ sequence [Various sequences]
+    ★ Matrix [Matrix calculation]
         FUNCTIONS
-            farey(n: int) -> list
             ...
-    ★ tools [Other useful tools]
-        FUNCTIONS
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
             ...
-            primality(n: int, iter_num: int = 10) -> bool
-            generate_primes(limit: int) -> list
-            prime_factors(integer: int, dictionary: bool = False, pollard_rho: bool = True) -> Union[list, dict]
-    ★ utils [Other useful tools]
-        CLASSES
-            InfIterator
-            OrderedSet
 ```
 
 ### 运行用时测试
@@ -893,6 +830,14 @@ PyPyNum
             Triangle
         FUNCTIONS
             distance(g1, g2, error: int | float = 0) -> float
+    ★ Graph [Graph theory]
+        CLASSES
+            BaseGraph
+                BaseWeGraph
+                    WeDiGraph
+                    WeUnGraph
+                DiGraph
+                UnGraph
     ★ Group [Group theory]
         CLASSES
             Group
@@ -930,14 +875,16 @@ PyPyNum
         CLASSES
             Matrix
         FUNCTIONS
-            eig(matrix)
-            identity(n)
-            lu(matrix)
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            identity(n: int) -> pypynum.Matrix.Matrix
+            lu(matrix: pypynum.Matrix.Matrix) -> tuple
             mat(data)
-            qr(matrix)
+            qr(matrix: pypynum.Matrix.Matrix) -> tuple
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
             same(rows, cols, value=0)
-            svd(matrix)
-            tril_indices(n, k=0, m=None)
+            svd(matrix: pypynum.Matrix.Matrix) -> tuple
+            tril_indices(n: int, k: int = 0, m: int = None) -> tuple
             zeros(_dimensions)
             zeros_like(_nested_list)
     ★ NeuralN [A simple neural network model]
@@ -1121,6 +1068,9 @@ PyPyNum
             average(data, weights, expected=False)
             exgcd(a: int, b: int) -> tuple
             crt(n: arr, a: arr) -> int
+            isqrt(x: int) -> int
+            is_possibly_square(n: int) -> bool
+            is_square(n: int) -> bool
     ★ numbers [Conversion of various numbers]
         FUNCTIONS
             float2fraction(number: float, mixed: bool = False, error: float = 1e-15) -> tuple
@@ -1138,6 +1088,11 @@ PyPyNum
             unary(function, right: real = 5, left: real = -5, top: real = 5, bottom: real = -5, complexity: real = 5...
             binary(function, right: real = 5, left: real = -5, top: real = 5, bottom: real = -5, complexity: real = 5...
             c_unary(function, start: real, end: real, interval: real = 5, projection: str = "ri", right: real = 5...
+    ★ polynomial [Polynomial object]
+        CLASSES
+            Polynomial
+        FUNCTIONS
+            poly(terms=None)
     ★ probability [Probability function]
         FUNCTIONS
             binomial(sample_size: int, successes: int, success_probability: Union[int, float]) -> float
@@ -1176,6 +1131,7 @@ PyPyNum
             primality(n: int, iter_num: int = 10) -> bool
             generate_primes(limit: int) -> list
             prime_factors(integer: int, dictionary: bool = False, pollard_rho: bool = True) -> Union[list, dict]
+            magic_square(n)
     ★ utils [Other useful tools]
         CLASSES
             InfIterator
@@ -1344,7 +1300,7 @@ print(v1.angles())
 6.62607015e-34
 1.618033988749895
 3.141592653589793
-1000000000000.0
+1000000000000
 
 >>> p = [1, -2, -3, 4]
 >>> m = [
@@ -1358,7 +1314,9 @@ print(v1.angles())
 >>> print(equations.polynomial_equation(p))
 >>> print(equations.linear_equation(*m))
 
-[(-1.5615528128088307-6.5209667308287455e-24j)   (2.5615528128088294+4.456233626665941e-24j)   (1.0000000000000007+3.241554513744382e-25j)]
+[[(-1.5615528128088307-6.5209667308287455e-24j)                                             0                                             0]
+ [                                            0   (2.5615528128088294+4.456233626665941e-24j)                                             0]
+ [                                            0                                             0   (1.0000000000000007+3.241554513744382e-25j)]]
 [ 1.6666666666666667 -0.6666666666666666 -0.4444444444444444]
 
 >>> print(maths.cot(constants.pi / 3))
@@ -1453,10 +1411,10 @@ print(v1.angles())
 >>> print(random.randint(0, 9, [2, 3, 4]))
 >>> print(random.uniform(0, 9, [2, 3, 4]))
 
-[[[0.4334341920363395, 0.055711784711422116, -1.0235500373980284, 0.30031229336738374], [-0.2650367914670356, 0.5513398538865067, -0.9735921328831166, 0.41345578602104827], [-0.11598957920080871, -0.9044539791933183, 1.6448227575237069, -0.26304156924843813]], [[0.27363898507271256, -0.5897181011789576, 1.5120937498473583, 2.1302709742844694], [1.9743293887616236, 0.4117207260898469, 0.5809554193110543, -1.8456249006764007], [1.274481044612177, -0.30645083457981553, -1.3285606156236818, 0.33473439037886943]]]
-[[[0.5269441534226782, 0.36498666932667356, 0.7363066388832684, 0.5878544826035406], [0.5684721009896431, 0.9009577979323332, 0.036288112799501615, 0.18351641818419884], [0.24258369409385339, 0.09354340906140202, 0.4856203412285762, 0.783031677244552]], [[0.8777465681935882, 0.6406910705155251, 0.10275292827025073, 0.01295823682977526], [0.3898500974345528, 0.6216248983423127, 0.3179425906177036, 0.012870877167621808], [0.2660481991211192, 0.09872041627158801, 0.3681944568198672, 0.494087114885137]]]
-[[[5, 9, 5, 6], [6, 7, 6, 1], [1, 3, 2, 4]], [[5, 8, 8, 3], [3, 2, 3, 9], [3, 0, 7, 1]]]
-[[[8.610851610963957, 1.3747433091161905, 1.3831050577679438, 4.715182178697273], [0.8765517657148284, 4.809554825684029, 2.7557819856736137, 5.938765584746821], [6.088739464744903, 4.627722536295625, 0.6116370455995369, 5.875683438664389]], [[7.7228845997304845, 5.428461366109726, 8.02712172516869, 5.9319006090345425], [5.726626482636939, 7.978329508380601, 1.114307478513796, 6.236721706167868], [1.4123245528031072, 5.327811122183013, 7.324213082306745, 1.5016363011868927]]]
+[[[1.524086835643172, -0.20868457467847845, 0.5240261503975477, -0.6439838767682032], [-1.091904210196648, -0.20567633973733265, 1.374424576574523, 0.6563097903476932], [0.2171635934136032, 1.0821030876490199, -0.8410496800310051, -0.8321549344577578]], [[0.5306996954571072, -0.4441704154154241, 1.0481960055260355, 0.39805451821848287], [-0.4006858882593715, -0.06238294764009237, -1.1536673264483728, -0.8063185246185602], [0.3029117113345387, -0.32570360518676644, 0.6608320231980702, 1.7415150171137153]]]
+[[[0.3736243541521843, 0.8599079983285199, 0.4260061864869946, 0.8441437619796597], [0.8955986631978392, 0.7570336992646656, 0.6706841989644684, 0.328634366074538], [0.4371430562585502, 0.9576395263025738, 0.2380278778546957, 0.806813631306664]], [[0.18549375381453237, 0.5749941389233029, 0.7009767023241946, 0.30017399397762223], [0.6661914823434657, 0.7802291606608635, 0.6847755352217044, 0.2661053533652564], [0.07937643994416943, 0.5452043474222034, 0.8026792060861194, 0.07776400257578953]]]
+[[[9, 0, 9, 0], [2, 6, 3, 4], [5, 8, 4, 7]], [[7, 7, 6, 3], [5, 5, 5, 8], [3, 4, 6, 6]]]
+[[[5.049093842782947, 1.3880585421884204, 8.533634113864629, 3.550264239771317], [3.3311351975225176, 5.131771033264564, 0.9570872044431911, 5.165536082759862], [1.2035779060925538, 8.292998518472567, 8.014641974770818, 6.251632912237915]], [[6.411677800595937, 5.365937405245105, 8.70943859614565, 4.348757668525482], [7.827612569569748, 1.3718742546020972, 0.5252489627763138, 2.065015517785291], [4.620664668451086, 2.604569735623819, 5.548107842615733, 7.60342292447815]]]
 
 >>> print(regression.linear_regression(list(range(5)), [2, 4, 6, 7, 8]))
 >>> print(regression.parabolic_regression(list(range(5)), [2, 4, 6, 7, 8]))

{PyPyNum-1.7.0.dist-info → PyPyNum-1.8.1.dist-info}/RECORD

@@ -1,36 +1,39 @@
 pypynum/Array.py,sha256=MLGvkYC9V7fGAR3g1Xykt_-hJYDC8mE47ji8dBcqFhk,6632
 pypynum/FourierT.py,sha256=AtG0tESykzEs4gDsXhcizW7qhQnmw0gjcWcXefBqzhs,1401
 pypynum/Geometry.py,sha256=bJCuif-wHO-t7oHFEE7ntzIdQwzUEbT3mcKgmBV6Wps,13982
+pypynum/Graph.py,sha256=m9iTCNYRCZmAexDzwJ8Y6J7v1aweT-6TZkqh4fOtZDE,10131
 pypynum/Group.py,sha256=m39OZNRoG9b3p_7sS1u50A0rJl0aYqYPVvnttkYQ_gw,2944
 pypynum/Logic.py,sha256=IJAv59ECHU0HmG9lYCAQ_puqeL6Zor3-IDIVH48KBWE,11000
-pypynum/Matrix.py,sha256=Z2k0bl_VpnaWB3QZjokR9CR7-kDaYIKUjKITWTYGa98,11024
+pypynum/Matrix.py,sha256=vjkz-m90aWDIv2vzXBriyb4vwaZv8tsPYZzPUeUh-Vk,18050
 pypynum/NeuralN.py,sha256=iSOvC9JW1h4AFGokGGOTkKie5hAYN_YT9H4f3apI9b8,3275
+pypynum/PyPyNum.png,sha256=t96tJPWfHxT8kcXm_qZI2z5W36TgOqjCU9qdgbmlFws,11623
 pypynum/Quaternion.py,sha256=E7ajc4sDJyOuQQIwKPhUEHgiaeeR5BEzFZHhJMxvbok,8007
+pypynum/README.md,sha256=eouG6yg8No8iooz_5cLZqS-pR0eMzgtbLBassoqspVE,42891
 pypynum/Symbolics.py,sha256=Nfo0DEch7LII53ye1wZAdIfd3IAOKbECnZQMSk_cmCs,2898
 pypynum/Tensor.py,sha256=SJzGRNwHZzOgEabt47scccb-plA25-6s01SFyHd6lJo,3801
-pypynum/Tree.py,sha256=7zqhVRdDu9u5lBQLM99AmfwIe0mgkfofj-VcHGguQGc,2816
+pypynum/Tree.py,sha256=MUT9LErZ3ER_cbiga-nOaZC7Hln8jEV8tRca2dRPWmY,2827
 pypynum/Vector.py,sha256=eiFCY6H35pMvvDX7NpLux_bSfLI8rK8JHkaRxv7pOW8,3552
-pypynum/__init__.py,sha256=X6ENdfAc5xxaFMNRMbT2JAx4VCPEa6W4nLkDdNASUsM,1782
-pypynum/__temporary.py,sha256=OAs7it7xjDovgAmKLcj-9Pqp0228SSon3OZx0ih_h4I,5860
+pypynum/__init__.py,sha256=wjl8Vtz9hWI7UP-Hh2JggiLf1FR0VMusXUyG2CGfzAg,1843
 pypynum/chars.py,sha256=VcK9w0i73FMCzc-9aIibjdHqyMsofJXdoBq0d8L7Vr0,1001
 pypynum/cipher.py,sha256=J5PZl8Xt71LuX29eSBu4cybNK6Z3rhA9og_YzD0YJfU,1002
 pypynum/constants.py,sha256=s2P1K8HH2nqoA6_YOVf6TKRl1Ozjf79GmCmLN9YbWxI,843
-pypynum/equations.py,sha256=_4xIXr7A56qBXKzJXyb91L4h09H7TDVNrcufy-XxkaI,744
+pypynum/equations.py,sha256=Bn1_VjwMnnvzT0mHYI0eAARRqIHuc3IpOfYvzojTPx0,713
 pypynum/errors.py,sha256=11-Au4aV8H5ExaDuMtu5iuGvpRaJP8gW7XbGNRmefSI,173
 pypynum/file.py,sha256=rqrPdcX0NOEPM8s40-ymgPKsTn0HKABW-VEh1OtPnsk,3188
-pypynum/maths.py,sha256=GgEbFMGKim6ZwPwrFpwIIfhD5rDHsprIbR7mijoTWvc,24753
+pypynum/maths.py,sha256=Nf_1k1VpKDFWUJQlwB40ljML6xHcW9INlAtstJi3Uc0,26637
 pypynum/numbers.py,sha256=WOxwwAN3yHakN4eHcVNn35qsfDcgw3UPSblv4woWyDE,6028
-pypynum/plotting.py,sha256=YQg9sO_nuLSaAKQuSpebWVvbu-ns2A7JOrHch6r0FQ0,8326
+pypynum/plotting.py,sha256=xoaG6KVoKTu2Zax2FXk3_bHkiu5LguGi_siNi1FLE98,8463
+pypynum/polynomial.py,sha256=psFukA31Ed4U7hZHcCGWCpYMi8tanTsZl-pUdklikfg,5998
 pypynum/probability.py,sha256=kZLCfZb2q_y1CVbozSZj9xQ8Dw3il5WcAojX0jsNyXw,2130
 pypynum/random.py,sha256=vfTtyH5yOSKJoSI_-NT_Tg8wC-ZXT0wt34f87oaSpJY,4610
 pypynum/regression.py,sha256=D9J9lM23HiyY4eE8vHKaHoiwuvD1RYhkVNO0jQ4yml4,2118
 pypynum/sequence.py,sha256=7NSZm_p_B00KFj5XZrtSm2FXhsowxs0qg_Q_P4pAA8o,7194
 pypynum/test.py,sha256=Bksa7HZaywKBbLaCw2R5kGRFj6eKzkkJ7BdJBgIB3uM,8428
 pypynum/this.py,sha256=8Swp75xE5g6436NCVDfYUVwUzUcQFPLcCNFWQWY5eGQ,2129
-pypynum/tools.py,sha256=Ki33faUpijydG1AKqh3R6qmU4EFky_35p-ZsdUZPxJM,9823
+pypynum/tools.py,sha256=jqmzsRi2INRlnI4hb4IbpMKHlvEww3ZKO9y6DxrJUbA,12697
 pypynum/types.py,sha256=CVWPZo_ACr_QGH5gAOhoG3jK35peiqipu3PH8ScEYHE,181
 pypynum/utils.py,sha256=V1k-JFHLr_VGUVqwOeAVH9Ju7AHQVEoVgYA7M-dPsLw,9881
-PyPyNum-1.7.0.dist-info/METADATA,sha256=ji2R_OijTBE2tNPK1GN5EVoTo4H6VNrbewnoVwtUCik,84411
-PyPyNum-1.7.0.dist-info/WHEEL,sha256=2wepM1nk4DS4eFpYrW1TTqPcoGNfHhhO_i5m4cOimbo,92
-PyPyNum-1.7.0.dist-info/top_level.txt,sha256=4wW_Xb4bRglmiMsdPAe9f75MkXhNpuN88H17g_Cr5u8,8
-PyPyNum-1.7.0.dist-info/RECORD,,
+PyPyNum-1.8.1.dist-info/METADATA,sha256=y9fXQuOCwcMcXjemYXpTwz5vPiQKTACt3l_9w-nhjxA,84338
+PyPyNum-1.8.1.dist-info/WHEEL,sha256=2wepM1nk4DS4eFpYrW1TTqPcoGNfHhhO_i5m4cOimbo,92
+PyPyNum-1.8.1.dist-info/top_level.txt,sha256=4wW_Xb4bRglmiMsdPAe9f75MkXhNpuN88H17g_Cr5u8,8
+PyPyNum-1.8.1.dist-info/RECORD,,

pypynum/Graph.py

@@ -0,0 +1,270 @@
+class BaseGraph:
+    def __init__(self):
+        self.graph = {}
+
+    def __repr__(self):
+        return "{}({})".format(self.__class__.__name__, sorted(self.graph.items()))
+
+    def add_vertex(self, vertex):
+        if vertex not in self.graph:
+            self.graph[vertex] = []
+
+    def remove_vertex(self, vertex):
+        if vertex in self.graph:
+            neighbors = self.graph[vertex]
+            del self.graph[vertex]
+            for neighbor in neighbors:
+                self.graph[neighbor].remove(vertex)
+
+    def has_vertex(self, vertex):
+        return vertex in self.graph
+
+    def has_edge(self, vertex1, vertex2):
+        return vertex1 in self.graph and vertex2 in self.graph[vertex1]
+
+    def get_edges(self, vertex):
+        return self.graph.get(vertex, {})
+
+    def all_vertices(self):
+        return sorted(set(list(self.graph) + sum([list(self.graph[vertex]) for vertex in self.graph], [])))
+
+    def all_edges(self):
+        edges = []
+        for vertex, neighbours in self.graph.items():
+            for neighbour in neighbours:
+                edges.append((vertex, neighbour))
+        return sorted(edges)
+
+    def to_adjacency_matrix(self):
+        vertices = self.all_vertices()
+        num_vertices = len(vertices)
+        matrix = [[0] * num_vertices for _ in range(num_vertices)]
+        if isinstance(self, BaseWeGraph):
+            for u in self.graph:
+                for v in self.graph[u].items():
+                    try:
+                        v, w = v
+                        matrix_index_u = vertices.index(u)
+                        matrix_index_v = vertices.index(v)
+                        matrix[matrix_index_u][matrix_index_v] = w
+                    except ValueError:
+                        continue
+        else:
+            for u in self.graph:
+                for v in self.graph[u]:
+                    try:
+                        matrix_index_u = vertices.index(u)
+                        matrix_index_v = vertices.index(v)
+                        matrix[matrix_index_u][matrix_index_v] = 1
+                    except ValueError:
+                        continue
+        return [[self.__class__.__name__] + vertices] + [[vertex] + row for vertex, row in zip(vertices, matrix)]
+
+    def dfs(self, start_vertex, visited=None):
+        if visited is None:
+            visited = set()
+        visited.add(start_vertex)
+        search_list = [start_vertex]
+        if start_vertex not in self.graph:
+            return [start_vertex]
+        for neighbour in self.graph[start_vertex]:
+            if neighbour not in visited:
+                search_list.extend(self.dfs(neighbour, visited))
+        return search_list
+
+    def bfs(self, start_vertex):
+        visited = {start_vertex}
+        queue = [start_vertex]
+        search_list = [start_vertex]
+        while queue:
+            vertex = queue.pop(0)
+            if vertex in self.graph:
+                for neighbour in self.graph[vertex]:
+                    if neighbour not in visited:
+                        visited.add(neighbour)
+                        queue.append(neighbour)
+                        search_list.append(neighbour)
+        return search_list
+
+    def is_connected(self):
+        visited = set()
+        queue = []
+        for node in self.graph:
+            if node not in visited:
+                visited.add(node)
+                queue.append(node)
+                break
+        while queue:
+            node = queue.pop(0)
+            for neighbor in self.graph[node]:
+                if neighbor not in visited:
+                    visited.add(neighbor)
+                    queue.append(neighbor)
+        return len(visited) == len(self.graph)
+
+    def is_complete(self):
+        num_nodes = len(self.graph)
+        return all([len(self.graph[node]) == num_nodes - 1 for node in self.graph])
+
+
+class DiGraph(BaseGraph):
+    def add_edge(self, vertex1, vertex2):
+        if vertex1 in self.graph:
+            self.graph[vertex1].append(vertex2)
+        else:
+            self.graph[vertex1] = [vertex2]
+
+    def remove_edge(self, vertex1, vertex2):
+        if vertex1 in self.graph and vertex2 in self.graph[vertex1]:
+            self.graph[vertex1].remove(vertex2)
+            if not self.graph[vertex1]:
+                del self.graph[vertex1]
+
+    def __str__(self):
+        edges = []
+        for vertex, neighbours in self.graph.items():
+            for neighbour in neighbours:
+                edges.append("{} -> {}".format(vertex, neighbour))
+        return "\n".join(sorted(edges))
+
+
+class UnGraph(BaseGraph):
+    def add_edge(self, vertex1, vertex2):
+        if vertex1 in self.graph:
+            self.graph[vertex1].append(vertex2)
+        else:
+            self.graph[vertex1] = [vertex2]
+        if vertex2 in self.graph:
+            self.graph[vertex2].append(vertex1)
+        else:
+            self.graph[vertex2] = [vertex1]
+
+    def remove_edge(self, vertex1, vertex2):
+        if vertex1 in self.graph and vertex2 in self.graph:
+            if vertex2 in self.graph[vertex1]:
+                self.graph[vertex1].remove(vertex2)
+            if vertex1 in self.graph[vertex2]:
+                self.graph[vertex2].remove(vertex1)
+            if not self.graph[vertex1]:
+                del self.graph[vertex1]
+            if not self.graph[vertex2]:
+                del self.graph[vertex2]
+
+    def __str__(self):
+        edges = []
+        for vertex, neighbours in self.graph.items():
+            for neighbour in neighbours:
+                edges.append("{} -- {}".format(vertex, neighbour))
+        return "\n".join(sorted(edges))
+
+
+class BaseWeGraph(BaseGraph):
+    def add_edge(self, vertex1, vertex2, weight=0):
+        raise NotImplementedError
+
+    def remove_edge(self, vertex1, vertex2):
+        raise NotImplementedError
+
+    def add_vertex(self, vertex):
+        if vertex not in self.graph:
+            self.graph[vertex] = {}
+
+    def remove_vertex(self, vertex):
+        if vertex in self.graph:
+            neighbors = self.graph[vertex]
+            del self.graph[vertex]
+            for neighbor in neighbors:
+                self.remove_edge(neighbor, vertex)
+
+    def get_edge_weight(self, vertex1, vertex2):
+        if self.has_edge(vertex1, vertex2):
+            return self.graph[vertex1][vertex2]
+
+    def get_in_degree_weight_sum(self, vertex):
+        return sum([self.get_edge_weight(neighbor, vertex)
+                    for neighbor in self.graph if vertex in self.graph[neighbor]])
+
+    def get_out_degree_weight_sum(self, vertex):
+        return sum([self.get_edge_weight(vertex, neighbor) for neighbor in self.graph.get(vertex, {})])
+
+    def dijkstra(self, start):
+        distances = {vertex: float("inf") for vertex in self.graph}
+        distances[start] = 0
+        queue = [(0, start)]
+        visited = set()
+        while queue:
+            current_distance, current_vertex = min(queue, key=lambda x: x[0])
+            if current_vertex in visited:
+                queue.remove((current_distance, current_vertex))
+                continue
+            visited.add(current_vertex)
+            queue.remove((current_distance, current_vertex))
+            if current_distance > distances[current_vertex] or current_vertex not in self.graph:
+                continue
+            for neighbor, weight in self.graph[current_vertex].items():
+                distance = current_distance + weight
+                if neighbor in distances:
+                    if distance < distances[neighbor]:
+                        distances[neighbor] = distance
+                        queue.append((distance, neighbor))
+                else:
+                    distances[neighbor] = distance
+                    queue.append((distance, neighbor))
+        return distances
+
+    def reconstruct_path(self, start, end, distances):
+        current = end
+        path = [current]
+        while current != start:
+            for neighbor, weight in self.get_edges(current).items():
+                if distances[current] == distances[neighbor] + weight:
+                    current = neighbor
+                    path.append(current)
+                    break
+        return path[::-1]
+
+
+class WeDiGraph(BaseWeGraph):
+    def add_edge(self, vertex1, vertex2, weight=0):
+        if vertex1 not in self.graph:
+            self.graph[vertex1] = {}
+        self.graph[vertex1][vertex2] = weight
+
+    def remove_edge(self, vertex1, vertex2):
+        if vertex1 in self.graph and vertex2 in self.graph[vertex1]:
+            del self.graph[vertex1][vertex2]
+            if not self.graph[vertex1]:
+                del self.graph[vertex1]
+
+    def __str__(self):
+        edges = []
+        for vertex, neighbours in self.graph.items():
+            for neighbour, weight in neighbours.items():
+                edges.append("{} -[{}]> {}".format(vertex, weight, neighbour))
+        return "\n".join(sorted(edges))
+
+
+class WeUnGraph(BaseWeGraph):
+    def add_edge(self, vertex1, vertex2, weight=0):
+        if vertex1 not in self.graph:
+            self.graph[vertex1] = {}
+        if vertex2 not in self.graph:
+            self.graph[vertex2] = {}
+        self.graph[vertex1][vertex2] = weight
+        self.graph[vertex2][vertex1] = weight
+
+    def remove_edge(self, vertex1, vertex2):
+        if vertex1 in self.graph and vertex2 in self.graph[vertex1]:
+            del self.graph[vertex1][vertex2]
+            del self.graph[vertex2][vertex1]
+            if not self.graph[vertex1]:
+                del self.graph[vertex1]
+            if vertex1 != vertex2 and not self.graph[vertex2]:
+                del self.graph[vertex2]
+
+    def __str__(self):
+        edges = []
+        for vertex, neighbours in self.graph.items():
+            for neighbour, weight in neighbours.items():
+                edges.append("{} -[{}]- {}".format(vertex, weight, neighbour))
+        return "\n".join(sorted(edges))