@@ -92,11 +92,15 @@ <h5>Inheritance</h5>
92
92
< div class ="level0 "> < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.object "> Object</ a > </ div >
93
93
< div class ="level1 "> < span class ="xref "> DiGraphVertex<T></ span > </ div >
94
94
</ div >
95
+ < div classs ="implements ">
96
+ < h5 > Implements</ h5 >
97
+ < div > < span class ="xref "> IEnumerable</ span > <T></ div >
98
+ </ div >
95
99
< h6 > < strong > Namespace</ strong > : < a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.html "> Advanced.Algorithms.DataStructures.Graph.AdjacencyList</ a > </ h6 >
96
100
< h6 > < strong > Assembly</ strong > : Advanced.Algorithms.dll</ h6 >
97
101
< h5 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_syntax "> Syntax</ h5 >
98
102
< div class ="codewrapper ">
99
- < pre > < code class ="lang-csharp hljs "> public class DiGraphVertex<T> : IEnumerable<T></ code > </ pre >
103
+ < pre > < code class ="lang-csharp hljs "> public class DiGraphVertex<T> : IDiGraphVertex<T>, IEnumerable<T></ code > </ pre >
100
104
</ div >
101
105
< h5 class ="typeParameters "> Type Parameters</ h5 >
102
106
< table class ="table table-bordered table-striped table-condensed ">
@@ -146,6 +150,31 @@ <h3 id="properties">Properties
146
150
</ h3 >
147
151
148
152
153
+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_InEdgeCount_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.InEdgeCount* "> </ a >
154
+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_InEdgeCount " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.InEdgeCount "> InEdgeCount</ h4 >
155
+ < div class ="markdown level1 summary "> </ div >
156
+ < div class ="markdown level1 conceptual "> </ div >
157
+ < h5 class ="decalaration "> Declaration</ h5 >
158
+ < div class ="codewrapper ">
159
+ < pre > < code class ="lang-csharp hljs "> public int InEdgeCount { get; }</ code > </ pre >
160
+ </ div >
161
+ < h5 class ="propertyValue "> Property Value</ h5 >
162
+ < table class ="table table-bordered table-striped table-condensed ">
163
+ < thead >
164
+ < tr >
165
+ < th > Type</ th >
166
+ < th > Description</ th >
167
+ </ tr >
168
+ </ thead >
169
+ < tbody >
170
+ < tr >
171
+ < td > < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.int32 "> Int32</ a > </ td >
172
+ < td > </ td >
173
+ </ tr >
174
+ </ tbody >
175
+ </ table >
176
+
177
+
149
178
< a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_InEdges_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.InEdges* "> </ a >
150
179
< h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_InEdges " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.InEdges "> InEdges</ h4 >
151
180
< div class ="markdown level1 summary "> </ div >
@@ -171,13 +200,13 @@ <h5 class="propertyValue">Property Value</h5>
171
200
</ table >
172
201
173
202
174
- < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_OutEdges_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.OutEdges * "> </ a >
175
- < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_OutEdges " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.OutEdges " > OutEdges </ h4 >
203
+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_Key_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.Key * "> </ a >
204
+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_Key " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.Key " > Key </ h4 >
176
205
< div class ="markdown level1 summary "> </ div >
177
206
< div class ="markdown level1 conceptual "> </ div >
178
207
< h5 class ="decalaration "> Declaration</ h5 >
179
208
< div class ="codewrapper ">
180
- < pre > < code class ="lang-csharp hljs "> public HashSet<DiGraphVertex<T>> OutEdges { get; set; }</ code > </ pre >
209
+ < pre > < code class ="lang-csharp hljs "> public T Key { get; set; }</ code > </ pre >
181
210
</ div >
182
211
< h5 class ="propertyValue "> Property Value</ h5 >
183
212
< table class ="table table-bordered table-striped table-condensed ">
@@ -189,20 +218,20 @@ <h5 class="propertyValue">Property Value</h5>
189
218
</ thead >
190
219
< tbody >
191
220
< tr >
192
- < td > < span class ="xref "> HashSet </ span > < < a class =" xref " href =" Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex-1.html " > DiGraphVertex </ a > <T>> </ td >
221
+ < td > < span class ="xref "> T </ span > </ td >
193
222
< td > </ td >
194
223
</ tr >
195
224
</ tbody >
196
225
</ table >
197
226
198
227
199
- < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_Value_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.Value * "> </ a >
200
- < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_Value " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.Value " > Value </ h4 >
228
+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_OutEdgeCount_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.OutEdgeCount * "> </ a >
229
+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_OutEdgeCount " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.OutEdgeCount " > OutEdgeCount </ h4 >
201
230
< div class ="markdown level1 summary "> </ div >
202
231
< div class ="markdown level1 conceptual "> </ div >
203
232
< h5 class ="decalaration "> Declaration</ h5 >
204
233
< div class ="codewrapper ">
205
- < pre > < code class ="lang-csharp hljs "> public T Value { get; set ; }</ code > </ pre >
234
+ < pre > < code class ="lang-csharp hljs "> public int OutEdgeCount { get; }</ code > </ pre >
206
235
</ div >
207
236
< h5 class ="propertyValue "> Property Value</ h5 >
208
237
< table class ="table table-bordered table-striped table-condensed ">
@@ -214,7 +243,32 @@ <h5 class="propertyValue">Property Value</h5>
214
243
</ thead >
215
244
< tbody >
216
245
< tr >
217
- < td > < span class ="xref "> T</ span > </ td >
246
+ < td > < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.int32 "> Int32</ a > </ td >
247
+ < td > </ td >
248
+ </ tr >
249
+ </ tbody >
250
+ </ table >
251
+
252
+
253
+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_OutEdges_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.OutEdges* "> </ a >
254
+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_OutEdges " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.OutEdges "> OutEdges</ h4 >
255
+ < div class ="markdown level1 summary "> </ div >
256
+ < div class ="markdown level1 conceptual "> </ div >
257
+ < h5 class ="decalaration "> Declaration</ h5 >
258
+ < div class ="codewrapper ">
259
+ < pre > < code class ="lang-csharp hljs "> public HashSet<DiGraphVertex<T>> OutEdges { get; set; }</ code > </ pre >
260
+ </ div >
261
+ < h5 class ="propertyValue "> Property Value</ h5 >
262
+ < table class ="table table-bordered table-striped table-condensed ">
263
+ < thead >
264
+ < tr >
265
+ < th > Type</ th >
266
+ < th > Description</ th >
267
+ </ tr >
268
+ </ thead >
269
+ < tbody >
270
+ < tr >
271
+ < td > < span class ="xref "> HashSet</ span > << a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex-1.html "> DiGraphVertex</ a > <T>></ td >
218
272
< td > </ td >
219
273
</ tr >
220
274
</ tbody >
@@ -246,6 +300,52 @@ <h5 class="returns">Returns</h5>
246
300
</ tr >
247
301
</ tbody >
248
302
</ table >
303
+
304
+
305
+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_GetOutEdge_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.GetOutEdge* "> </ a >
306
+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_DiGraphVertex_1_GetOutEdge_IDiGraphVertex__0__ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.DiGraphVertex`1.GetOutEdge(IDiGraphVertex{`0}) "> GetOutEdge(IDiGraphVertex<T>)</ h4 >
307
+ < div class ="markdown level1 summary "> </ div >
308
+ < div class ="markdown level1 conceptual "> </ div >
309
+ < h5 class ="decalaration "> Declaration</ h5 >
310
+ < div class ="codewrapper ">
311
+ < pre > < code class ="lang-csharp hljs "> public IDiEdge<T> GetOutEdge(IDiGraphVertex<T> targetVertex)</ code > </ pre >
312
+ </ div >
313
+ < h5 class ="parameters "> Parameters</ h5 >
314
+ < table class ="table table-bordered table-striped table-condensed ">
315
+ < thead >
316
+ < tr >
317
+ < th > Type</ th >
318
+ < th > Name</ th >
319
+ < th > Description</ th >
320
+ </ tr >
321
+ </ thead >
322
+ < tbody >
323
+ < tr >
324
+ < td > < span class ="xref "> IDiGraphVertex</ span > <T></ td >
325
+ < td > < span class ="parametername "> targetVertex</ span > </ td >
326
+ < td > </ td >
327
+ </ tr >
328
+ </ tbody >
329
+ </ table >
330
+ < h5 class ="returns "> Returns</ h5 >
331
+ < table class ="table table-bordered table-striped table-condensed ">
332
+ < thead >
333
+ < tr >
334
+ < th > Type</ th >
335
+ < th > Description</ th >
336
+ </ tr >
337
+ </ thead >
338
+ < tbody >
339
+ < tr >
340
+ < td > < span class ="xref "> IDiEdge</ span > <T></ td >
341
+ < td > </ td >
342
+ </ tr >
343
+ </ tbody >
344
+ </ table >
345
+ < h3 id ="implements "> Implements</ h3 >
346
+ < div >
347
+ < span class ="xref "> IEnumerable<></ span >
348
+ </ div >
249
349
</ article >
250
350
</ div >
251
351
0 commit comments