@@ -86,6 +86,69 @@ def test_init(self):
86
86
self .assertEqual (g .in_mapping [node ], expected_in_mapping [node ])
87
87
self .assertEqual (g ._edges , expected_edges )
88
88
89
+ def test_out_dict (self ):
90
+ # Undirected graph with vertices and unweighted edges
91
+ g = graph .Graph (edges = [[1 , 2 ], [2 , 3 ]])
92
+ expected_out_mapping = {
93
+ 1 : {2 : None },
94
+ 2 : {1 : None , 3 : None },
95
+ 3 : {2 : None }
96
+ }
97
+ for key in expected_out_mapping :
98
+ self .assertEqual (g .out_mapping [key ], expected_out_mapping [key ])
99
+
100
+ # Undirected graph with vertices and weighted edges
101
+ g = graph .Graph (edges = [[1 , 2 , 10 ], [2 , 3 , 5 ]])
102
+ expected_out_mapping = {
103
+ 1 : {2 : 10 },
104
+ 2 : {1 : 10 , 3 : 5 },
105
+ 3 : {2 : 5 }
106
+ }
107
+ for key in expected_out_mapping :
108
+ self .assertEqual (g .out_mapping [key ], expected_out_mapping [key ])
109
+
110
+ # Directed graph with vertices and weighted edges
111
+ g = graph .Graph (edges = [[1 , 2 , 10 ], [2 , 3 , 5 ]], directed = True )
112
+ expected_out_mapping = {
113
+ 1 : {2 : 10 },
114
+ 2 : {3 : 5 },
115
+ }
116
+ for key in expected_out_mapping :
117
+ self .assertEqual (g .out_mapping [key ], expected_out_mapping [key ])
118
+
119
+ def test_in_dict (self ):
120
+ # Undirected graph with vertices and unweighted edges
121
+ g = graph .Graph (edges = [[1 , 2 ], [2 , 3 ]])
122
+ expected_in_mapping = {
123
+ 1 : {2 : None },
124
+ 2 : {1 : None , 3 : None },
125
+ 3 : {2 : None }
126
+ }
127
+ for key in expected_in_mapping :
128
+ self .assertEqual (g .in_mapping [key ], expected_in_mapping [key ])
129
+
130
+ # Undirected graph with vertices and weighted edges
131
+ g = graph .Graph (edges = [[1 , 2 , 10 ], [2 , 3 , 5 ]])
132
+ expected_in_mapping = {
133
+ 1 : {2 : 10 },
134
+ 2 : {1 : 10 , 3 : 5 },
135
+ 3 : {2 : 5 }
136
+ }
137
+ for key in expected_in_mapping :
138
+ self .assertEqual (g .in_mapping [key ], expected_in_mapping [key ])
139
+
140
+ # Directed graph with vertices and weighted edges
141
+ g = graph .Graph (edges = [[1 , 2 , 10 ], [2 , 3 , 5 ]], directed = True )
142
+ expected_in_mapping = {
143
+ 2 : {1 : 10 },
144
+ 3 : {2 : 5 }
145
+ }
146
+ for key in expected_in_mapping :
147
+ self .assertEqual (g .in_mapping [key ], expected_in_mapping [key ])
148
+
149
+ def test_repr (self ):
150
+ pass
151
+
89
152
def test_cycle (self ):
90
153
g = graph .cycle (1 , directed = False )
91
154
self .assertEqual (g .vertices (), [0 ])
0 commit comments