@@ -163,33 +163,6 @@ <h5 class="propertyValue">Property Value</h5>
163
163
</ table >
164
164
165
165
166
- < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_ReferenceVertex_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.ReferenceVertex* "> </ a >
167
- < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_ReferenceVertex " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.ReferenceVertex "> ReferenceVertex</ h4 >
168
- < div class ="markdown level1 summary "> < p > Returns a reference vertex.
169
- Time complexity: O(1).</ p >
170
- </ div >
171
- < div class ="markdown level1 conceptual "> </ div >
172
- < h5 class ="decalaration "> Declaration</ h5 >
173
- < div class ="codewrapper ">
174
- < pre > < code class ="lang-csharp hljs "> public WeightedDiGraphVertex<T, TW> ReferenceVertex { get; }</ code > </ pre >
175
- </ div >
176
- < h5 class ="propertyValue "> Property Value</ h5 >
177
- < table class ="table table-bordered table-striped table-condensed ">
178
- < thead >
179
- < tr >
180
- < th > Type</ th >
181
- < th > Description</ th >
182
- </ tr >
183
- </ thead >
184
- < tbody >
185
- < tr >
186
- < td > < a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html "> WeightedDiGraphVertex</ a > <T, TW></ td >
187
- < td > </ td >
188
- </ tr >
189
- </ tbody >
190
- </ table >
191
-
192
-
193
166
< a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_VerticesAsEnumberable_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.VerticesAsEnumberable* "> </ a >
194
167
< h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_VerticesAsEnumberable " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.VerticesAsEnumberable "> VerticesAsEnumberable</ h4 >
195
168
< div class ="markdown level1 summary "> </ div >
@@ -289,7 +262,7 @@ <h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2
289
262
< div class ="markdown level1 conceptual "> </ div >
290
263
< h5 class ="decalaration "> Declaration</ h5 >
291
264
< div class ="codewrapper ">
292
- < pre > < code class ="lang-csharp hljs "> public WeightedDiGraphVertex<T, TW> AddVertex(T value)</ code > </ pre >
265
+ < pre > < code class ="lang-csharp hljs "> public void AddVertex(T value)</ code > </ pre >
293
266
</ div >
294
267
< h5 class ="parameters "> Parameters</ h5 >
295
268
< table class ="table table-bordered table-striped table-condensed ">
@@ -308,21 +281,6 @@ <h5 class="parameters">Parameters</h5>
308
281
</ tr >
309
282
</ tbody >
310
283
</ table >
311
- < h5 class ="returns "> Returns</ h5 >
312
- < table class ="table table-bordered table-striped table-condensed ">
313
- < thead >
314
- < tr >
315
- < th > Type</ th >
316
- < th > Description</ th >
317
- </ tr >
318
- </ thead >
319
- < tbody >
320
- < tr >
321
- < td > < a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html "> WeightedDiGraphVertex</ a > <T, TW></ td >
322
- < td > </ td >
323
- </ tr >
324
- </ tbody >
325
- </ table >
326
284
327
285
328
286
< a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_Clone_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.Clone* "> </ a >
@@ -393,50 +351,6 @@ <h5 class="returns">Returns</h5>
393
351
</ table >
394
352
395
353
396
- < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_FindVertex_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.FindVertex* "> </ a >
397
- < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_FindVertex__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.FindVertex(`0) "> FindVertex(T)</ h4 >
398
- < div class ="markdown level1 summary "> < p > Returns the vertex with given value.
399
- Time complexity: O(1).</ p >
400
- </ div >
401
- < div class ="markdown level1 conceptual "> </ div >
402
- < h5 class ="decalaration "> Declaration</ h5 >
403
- < div class ="codewrapper ">
404
- < pre > < code class ="lang-csharp hljs "> public WeightedDiGraphVertex<T, TW> FindVertex(T value)</ code > </ pre >
405
- </ div >
406
- < h5 class ="parameters "> Parameters</ h5 >
407
- < table class ="table table-bordered table-striped table-condensed ">
408
- < thead >
409
- < tr >
410
- < th > Type</ th >
411
- < th > Name</ th >
412
- < th > Description</ th >
413
- </ tr >
414
- </ thead >
415
- < tbody >
416
- < tr >
417
- < td > < span class ="xref "> T</ span > </ td >
418
- < td > < span class ="parametername "> value</ span > </ td >
419
- < td > </ td >
420
- </ tr >
421
- </ tbody >
422
- </ table >
423
- < h5 class ="returns "> Returns</ h5 >
424
- < table class ="table table-bordered table-striped table-condensed ">
425
- < thead >
426
- < tr >
427
- < th > Type</ th >
428
- < th > Description</ th >
429
- </ tr >
430
- </ thead >
431
- < tbody >
432
- < tr >
433
- < td > < a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraphVertex-2.html "> WeightedDiGraphVertex</ a > <T, TW></ td >
434
- < td > </ td >
435
- </ tr >
436
- </ tbody >
437
- </ table >
438
-
439
-
440
354
< a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_GetEnumerator_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.GetEnumerator* "> </ a >
441
355
< h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyList_WeightedDiGraph_2_GetEnumerator " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyList.WeightedDiGraph`2.GetEnumerator "> GetEnumerator()</ h4 >
442
356
< div class ="markdown level1 summary "> </ div >
0 commit comments