@@ -92,11 +92,16 @@ <h5>Inheritance</h5>
9292 < div class ="level0 "> < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.object "> Object</ a > </ div >
9393 < div class ="level1 "> < span class ="xref "> WeightedDiGraph<T, TW></ span > </ div >
9494 </ div >
95+ < div classs ="implements ">
96+ < h5 > Implements</ h5 >
97+ < div > < span class ="xref "> IGraph</ span > <T></ div >
98+ < div > < span class ="xref "> IEnumerable</ span > <T></ div >
99+ </ div >
95100 < h6 > < strong > Namespace</ strong > : < a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.html "> Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix</ a > </ h6 >
96101 < h6 > < strong > Assembly</ strong > : Advanced.Algorithms.dll</ h6 >
97102 < h5 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_syntax "> Syntax</ h5 >
98103 < div class ="codewrapper ">
99- < pre > < code class ="lang-csharp hljs "> public class WeightedDiGraph<T, TW> : IEnumerable<T> where TW : IComparable</ code > </ pre >
104+ < pre > < code class ="lang-csharp hljs "> public class WeightedDiGraph<T, TW> : IDiGraph<T>, IGraph<T>, IEnumerable<T> where TW : IComparable</ code > </ pre >
100105 </ div >
101106 < h5 class ="typeParameters "> Type Parameters</ h5 >
102107 < table class ="table table-bordered table-striped table-condensed ">
@@ -133,6 +138,81 @@ <h3 id="properties">Properties
133138 </ h3 >
134139
135140
141+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_IsWeightedGraph_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.IsWeightedGraph* "> </ a >
142+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_IsWeightedGraph " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.IsWeightedGraph "> IsWeightedGraph</ h4 >
143+ < div class ="markdown level1 summary "> </ div >
144+ < div class ="markdown level1 conceptual "> </ div >
145+ < h5 class ="decalaration "> Declaration</ h5 >
146+ < div class ="codewrapper ">
147+ < pre > < code class ="lang-csharp hljs "> public bool IsWeightedGraph { get; }</ code > </ pre >
148+ </ div >
149+ < h5 class ="propertyValue "> Property Value</ h5 >
150+ < table class ="table table-bordered table-striped table-condensed ">
151+ < thead >
152+ < tr >
153+ < th > Type</ th >
154+ < th > Description</ th >
155+ </ tr >
156+ </ thead >
157+ < tbody >
158+ < tr >
159+ < td > < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.boolean "> Boolean</ a > </ td >
160+ < td > </ td >
161+ </ tr >
162+ </ tbody >
163+ </ table >
164+
165+
166+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_ReferenceVertex_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.ReferenceVertex* "> </ a >
167+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_ReferenceVertex " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.ReferenceVertex "> ReferenceVertex</ h4 >
168+ < div class ="markdown level1 summary "> </ div >
169+ < div class ="markdown level1 conceptual "> </ div >
170+ < h5 class ="decalaration "> Declaration</ h5 >
171+ < div class ="codewrapper ">
172+ < pre > < code class ="lang-csharp hljs "> public IDiGraphVertex<T> ReferenceVertex { get; }</ code > </ pre >
173+ </ div >
174+ < h5 class ="propertyValue "> Property Value</ h5 >
175+ < table class ="table table-bordered table-striped table-condensed ">
176+ < thead >
177+ < tr >
178+ < th > Type</ th >
179+ < th > Description</ th >
180+ </ tr >
181+ </ thead >
182+ < tbody >
183+ < tr >
184+ < td > < span class ="xref "> IDiGraphVertex</ span > <T></ td >
185+ < td > </ td >
186+ </ tr >
187+ </ tbody >
188+ </ table >
189+
190+
191+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_VerticesAsEnumberable_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.VerticesAsEnumberable* "> </ a >
192+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_VerticesAsEnumberable " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.VerticesAsEnumberable "> VerticesAsEnumberable</ h4 >
193+ < div class ="markdown level1 summary "> </ div >
194+ < div class ="markdown level1 conceptual "> </ div >
195+ < h5 class ="decalaration "> Declaration</ h5 >
196+ < div class ="codewrapper ">
197+ < pre > < code class ="lang-csharp hljs "> public IEnumerable<IDiGraphVertex<T>> VerticesAsEnumberable { get; }</ code > </ pre >
198+ </ div >
199+ < h5 class ="propertyValue "> Property Value</ h5 >
200+ < table class ="table table-bordered table-striped table-condensed ">
201+ < thead >
202+ < tr >
203+ < th > Type</ th >
204+ < th > Description</ th >
205+ </ tr >
206+ </ thead >
207+ < tbody >
208+ < tr >
209+ < td > < span class ="xref "> IEnumerable</ span > << span class ="xref "> IDiGraphVertex</ span > <T>></ td >
210+ < td > </ td >
211+ </ tr >
212+ </ tbody >
213+ </ table >
214+
215+
136216 < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_VerticesCount_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.VerticesCount* "> </ a >
137217 < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_VerticesCount " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.VerticesCount "> VerticesCount</ h4 >
138218 < div class ="markdown level1 summary "> </ div >
@@ -228,6 +308,73 @@ <h5 class="parameters">Parameters</h5>
228308 </ table >
229309
230310
311+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_Clone_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.Clone* "> </ a >
312+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_Clone " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.Clone "> Clone()</ h4 >
313+ < div class ="markdown level1 summary "> </ div >
314+ < div class ="markdown level1 conceptual "> </ div >
315+ < h5 class ="decalaration "> Declaration</ h5 >
316+ < div class ="codewrapper ">
317+ < pre > < code class ="lang-csharp hljs "> public WeightedDiGraph<T, TW> Clone()</ code > </ pre >
318+ </ div >
319+ < h5 class ="returns "> Returns</ h5 >
320+ < table class ="table table-bordered table-striped table-condensed ">
321+ < thead >
322+ < tr >
323+ < th > Type</ th >
324+ < th > Description</ th >
325+ </ tr >
326+ </ thead >
327+ < tbody >
328+ < tr >
329+ < td > < a class ="xref " href ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph-2.html "> WeightedDiGraph</ a > <T, TW></ td >
330+ < td > </ td >
331+ </ tr >
332+ </ tbody >
333+ </ table >
334+
335+
336+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_ContainsVertex_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.ContainsVertex* "> </ a >
337+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_ContainsVertex__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.ContainsVertex(`0) "> ContainsVertex(T)</ h4 >
338+ < div class ="markdown level1 summary "> </ div >
339+ < div class ="markdown level1 conceptual "> </ div >
340+ < h5 class ="decalaration "> Declaration</ h5 >
341+ < div class ="codewrapper ">
342+ < pre > < code class ="lang-csharp hljs "> public bool ContainsVertex(T value)</ code > </ pre >
343+ </ div >
344+ < h5 class ="parameters "> Parameters</ h5 >
345+ < table class ="table table-bordered table-striped table-condensed ">
346+ < thead >
347+ < tr >
348+ < th > Type</ th >
349+ < th > Name</ th >
350+ < th > Description</ th >
351+ </ tr >
352+ </ thead >
353+ < tbody >
354+ < tr >
355+ < td > < span class ="xref "> T</ span > </ td >
356+ < td > < span class ="parametername "> value</ span > </ td >
357+ < td > </ td >
358+ </ tr >
359+ </ tbody >
360+ </ table >
361+ < h5 class ="returns "> Returns</ h5 >
362+ < table class ="table table-bordered table-striped table-condensed ">
363+ < thead >
364+ < tr >
365+ < th > Type</ th >
366+ < th > Description</ th >
367+ </ tr >
368+ </ thead >
369+ < tbody >
370+ < tr >
371+ < td > < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.boolean "> Boolean</ a > </ td >
372+ < td > </ td >
373+ </ tr >
374+ </ tbody >
375+ </ table >
376+
377+
231378 < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_GetEnumerator_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.GetEnumerator* "> </ a >
232379 < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_GetEnumerator " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.GetEnumerator "> GetEnumerator()</ h4 >
233380 < div class ="markdown level1 summary "> </ div >
@@ -253,6 +400,48 @@ <h5 class="returns">Returns</h5>
253400 </ table >
254401
255402
403+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_GetVertex_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.GetVertex* "> </ a >
404+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_GetVertex__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.GetVertex(`0) "> GetVertex(T)</ h4 >
405+ < div class ="markdown level1 summary "> </ div >
406+ < div class ="markdown level1 conceptual "> </ div >
407+ < h5 class ="decalaration "> Declaration</ h5 >
408+ < div class ="codewrapper ">
409+ < pre > < code class ="lang-csharp hljs "> public IDiGraphVertex<T> GetVertex(T key)</ code > </ pre >
410+ </ div >
411+ < h5 class ="parameters "> Parameters</ h5 >
412+ < table class ="table table-bordered table-striped table-condensed ">
413+ < thead >
414+ < tr >
415+ < th > Type</ th >
416+ < th > Name</ th >
417+ < th > Description</ th >
418+ </ tr >
419+ </ thead >
420+ < tbody >
421+ < tr >
422+ < td > < span class ="xref "> T</ span > </ td >
423+ < td > < span class ="parametername "> key</ span > </ td >
424+ < td > </ td >
425+ </ tr >
426+ </ tbody >
427+ </ table >
428+ < h5 class ="returns "> Returns</ h5 >
429+ < table class ="table table-bordered table-striped table-condensed ">
430+ < thead >
431+ < tr >
432+ < th > Type</ th >
433+ < th > Description</ th >
434+ </ tr >
435+ </ thead >
436+ < tbody >
437+ < tr >
438+ < td > < span class ="xref "> IDiGraphVertex</ span > <T></ td >
439+ < td > </ td >
440+ </ tr >
441+ </ tbody >
442+ </ table >
443+
444+
256445 < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_HasEdge_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.HasEdge* "> </ a >
257446 < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_HasEdge__0__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.HasEdge(`0,`0) "> HasEdge(T, T)</ h4 >
258447 < div class ="markdown level1 summary "> < p > Do we have an edge between given source and destination?
@@ -302,13 +491,97 @@ <h5 class="returns">Returns</h5>
302491 </ table >
303492
304493
494+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_InEdgeCount_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.InEdgeCount* "> </ a >
495+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_InEdgeCount__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.InEdgeCount(`0) "> InEdgeCount(T)</ h4 >
496+ < div class ="markdown level1 summary "> </ div >
497+ < div class ="markdown level1 conceptual "> </ div >
498+ < h5 class ="decalaration "> Declaration</ h5 >
499+ < div class ="codewrapper ">
500+ < pre > < code class ="lang-csharp hljs "> public int InEdgeCount(T vertex)</ code > </ pre >
501+ </ div >
502+ < h5 class ="parameters "> Parameters</ h5 >
503+ < table class ="table table-bordered table-striped table-condensed ">
504+ < thead >
505+ < tr >
506+ < th > Type</ th >
507+ < th > Name</ th >
508+ < th > Description</ th >
509+ </ tr >
510+ </ thead >
511+ < tbody >
512+ < tr >
513+ < td > < span class ="xref "> T</ span > </ td >
514+ < td > < span class ="parametername "> vertex</ span > </ td >
515+ < td > </ td >
516+ </ tr >
517+ </ tbody >
518+ </ table >
519+ < h5 class ="returns "> Returns</ h5 >
520+ < table class ="table table-bordered table-striped table-condensed ">
521+ < thead >
522+ < tr >
523+ < th > Type</ th >
524+ < th > Description</ th >
525+ </ tr >
526+ </ thead >
527+ < tbody >
528+ < tr >
529+ < td > < a class ="xref " href ="https://docs.microsoft.com/dotnet/api/system.int32 "> Int32</ a > </ td >
530+ < td > </ td >
531+ </ tr >
532+ </ tbody >
533+ </ table >
534+
535+
305536 < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_InEdges_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.InEdges* "> </ a >
306537 < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_InEdges__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.InEdges(`0) "> InEdges(T)</ h4 >
307538 < div class ="markdown level1 summary "> </ div >
308539 < div class ="markdown level1 conceptual "> </ div >
309540 < h5 class ="decalaration "> Declaration</ h5 >
310541 < div class ="codewrapper ">
311- < pre > < code class ="lang-csharp hljs "> public IEnumerable<Tuple<T, TW>> InEdges(T vertex)</ code > </ pre >
542+ < pre > < code class ="lang-csharp hljs "> public IEnumerable<KeyValuePair<T, TW>> InEdges(T vertex)</ code > </ pre >
543+ </ div >
544+ < h5 class ="parameters "> Parameters</ h5 >
545+ < table class ="table table-bordered table-striped table-condensed ">
546+ < thead >
547+ < tr >
548+ < th > Type</ th >
549+ < th > Name</ th >
550+ < th > Description</ th >
551+ </ tr >
552+ </ thead >
553+ < tbody >
554+ < tr >
555+ < td > < span class ="xref "> T</ span > </ td >
556+ < td > < span class ="parametername "> vertex</ span > </ td >
557+ < td > </ td >
558+ </ tr >
559+ </ tbody >
560+ </ table >
561+ < h5 class ="returns "> Returns</ h5 >
562+ < table class ="table table-bordered table-striped table-condensed ">
563+ < thead >
564+ < tr >
565+ < th > Type</ th >
566+ < th > Description</ th >
567+ </ tr >
568+ </ thead >
569+ < tbody >
570+ < tr >
571+ < td > < span class ="xref "> IEnumerable</ span > << span class ="xref "> KeyValuePair</ span > <T, TW>></ td >
572+ < td > </ td >
573+ </ tr >
574+ </ tbody >
575+ </ table >
576+
577+
578+ < a id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_OutEdgeCount_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.OutEdgeCount* "> </ a >
579+ < h4 id ="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph_2_OutEdgeCount__0_ " data-uid ="Advanced.Algorithms.DataStructures.Graph.AdjacencyMatrix.WeightedDiGraph`2.OutEdgeCount(`0) "> OutEdgeCount(T)</ h4 >
580+ < div class ="markdown level1 summary "> </ div >
581+ < div class ="markdown level1 conceptual "> </ div >
582+ < h5 class ="decalaration "> Declaration</ h5 >
583+ < div class ="codewrapper ">
584+ < pre > < code class ="lang-csharp hljs "> public int OutEdgeCount(T vertex)</ code > </ pre >
312585 </ div >
313586 < h5 class ="parameters "> Parameters</ h5 >
314587 < table class ="table table-bordered table-striped table-condensed ">
@@ -337,7 +610,7 @@ <h5 class="returns">Returns</h5>
337610 </ thead >
338611 < tbody >
339612 < tr >
340- < td > < span class ="xref "> IEnumerable </ span > < < span class =" xref " > Tuple </ span > <T, TW>> </ td >
613+ < td > < a class ="xref " href =" https://docs.microsoft.com/dotnet/api/system.int32 " > Int32 </ a > </ td >
341614 < td > </ td >
342615 </ tr >
343616 </ tbody >
@@ -350,7 +623,7 @@ <h4 id="Advanced_Algorithms_DataStructures_Graph_AdjacencyMatrix_WeightedDiGraph
350623 < div class ="markdown level1 conceptual "> </ div >
351624 < h5 class ="decalaration "> Declaration</ h5 >
352625 < div class ="codewrapper ">
353- < pre > < code class ="lang-csharp hljs "> public IEnumerable<Tuple <T, TW>> OutEdges(T vertex)</ code > </ pre >
626+ < pre > < code class ="lang-csharp hljs "> public IEnumerable<KeyValuePair <T, TW>> OutEdges(T vertex)</ code > </ pre >
354627 </ div >
355628 < h5 class ="parameters "> Parameters</ h5 >
356629 < table class ="table table-bordered table-striped table-condensed ">
@@ -379,7 +652,7 @@ <h5 class="returns">Returns</h5>
379652 </ thead >
380653 < tbody >
381654 < tr >
382- < td > < span class ="xref "> IEnumerable</ span > << span class ="xref "> Tuple </ span > <T, TW>></ td >
655+ < td > < span class ="xref "> IEnumerable</ span > << span class ="xref "> KeyValuePair </ span > <T, TW>></ td >
383656 < td > </ td >
384657 </ tr >
385658 </ tbody >
@@ -447,6 +720,13 @@ <h5 class="parameters">Parameters</h5>
447720 </ tr >
448721 </ tbody >
449722 </ table >
723+ < h3 id ="implements "> Implements</ h3 >
724+ < div >
725+ < span class ="xref "> IGraph<></ span >
726+ </ div >
727+ < div >
728+ < span class ="xref "> IEnumerable<></ span >
729+ </ div >
450730</ article >
451731 </ div >
452732
0 commit comments