master
1<?xml version="1.0"?>
2<doc>
3 <assembly>
4 <name>QuickGraph</name>
5 </assembly>
6 <members>
7 <member name="T:QuickGraph.Collections.DistanceComparer">
8 <summary>
9 Given a Distance map, compare two vertex distance
10 </summary>
11 </member>
12 <member name="M:QuickGraph.Collections.DistanceComparer.#ctor(QuickGraph.Collections.VertexDoubleDictionary)">
13 <summary>
14 Builds a vertex distance comparer
15 </summary>
16 <param name="distances"></param>
17 </member>
18 <member name="M:QuickGraph.Collections.DistanceComparer.Compare(System.Object,System.Object)">
19 <summary>
20 Compare the distance between vertex x and y
21 </summary>
22 <param name="x">First vertex</param>
23 <param name="y">Second vertex</param>
24 <returns>-1 if d[x]<d[y], 0 if d[x] equals d[y] and +1 if d[x] > d[y]</returns>
25 </member>
26 <member name="T:QuickGraph.Collections.DoubleCollection">
27 <summary>
28 A collection of elements of type Double
29 </summary>
30 </member>
31 <member name="M:QuickGraph.Collections.DoubleCollection.#ctor">
32 <summary>
33 Initializes a new empty instance of the DoubleCollection class.
34 </summary>
35 </member>
36 <member name="M:QuickGraph.Collections.DoubleCollection.#ctor(System.Double[])">
37 <summary>
38 Initializes a new instance of the DoubleCollection class, containing elements
39 copied from an array.
40 </summary>
41 <param name="items">
42 The array whose elements are to be added to the new DoubleCollection.
43 </param>
44 </member>
45 <member name="M:QuickGraph.Collections.DoubleCollection.#ctor(QuickGraph.Collections.DoubleCollection)">
46 <summary>
47 Initializes a new instance of the DoubleCollection class, containing elements
48 copied from another instance of DoubleCollection
49 </summary>
50 <param name="items">
51 The DoubleCollection whose elements are to be added to the new DoubleCollection.
52 </param>
53 </member>
54 <member name="M:QuickGraph.Collections.DoubleCollection.AddRange(System.Double[])">
55 <summary>
56 Adds the elements of an array to the end of this DoubleCollection.
57 </summary>
58 <param name="items">
59 The array whose elements are to be added to the end of this DoubleCollection.
60 </param>
61 </member>
62 <member name="M:QuickGraph.Collections.DoubleCollection.AddRange(QuickGraph.Collections.DoubleCollection)">
63 <summary>
64 Adds the elements of another DoubleCollection to the end of this DoubleCollection.
65 </summary>
66 <param name="items">
67 The DoubleCollection whose elements are to be added to the end of this DoubleCollection.
68 </param>
69 </member>
70 <member name="M:QuickGraph.Collections.DoubleCollection.Add(System.Double)">
71 <summary>
72 Adds an instance of type Double to the end of this DoubleCollection.
73 </summary>
74 <param name="value">
75 The Double to be added to the end of this DoubleCollection.
76 </param>
77 </member>
78 <member name="M:QuickGraph.Collections.DoubleCollection.Contains(System.Double)">
79 <summary>
80 Determines whether a specfic Double value is in this DoubleCollection.
81 </summary>
82 <param name="value">
83 The Double value to locate in this DoubleCollection.
84 </param>
85 <returns>
86 true if value is found in this DoubleCollection;
87 false otherwise.
88 </returns>
89 </member>
90 <member name="M:QuickGraph.Collections.DoubleCollection.IndexOf(System.Double)">
91 <summary>
92 Return the zero-based index of the first occurrence of a specific value
93 in this DoubleCollection
94 </summary>
95 <param name="value">
96 The Double value to locate in the DoubleCollection.
97 </param>
98 <returns>
99 The zero-based index of the first occurrence of the _ELEMENT value if found;
100 -1 otherwise.
101 </returns>
102 </member>
103 <member name="M:QuickGraph.Collections.DoubleCollection.Insert(System.Int32,System.Double)">
104 <summary>
105 Inserts an element into the DoubleCollection at the specified index
106 </summary>
107 <param name="index">
108 The index at which the Double is to be inserted.
109 </param>
110 <param name="value">
111 The Double to insert.
112 </param>
113 </member>
114 <member name="M:QuickGraph.Collections.DoubleCollection.Remove(System.Double)">
115 <summary>
116 Removes the first occurrence of a specific Double from this DoubleCollection.
117 </summary>
118 <param name="value">
119 The Double value to remove from this DoubleCollection.
120 </param>
121 </member>
122 <member name="M:QuickGraph.Collections.DoubleCollection.GetEnumerator">
123 <summary>
124 Returns an enumerator that can iterate through the elements of this DoubleCollection.
125 </summary>
126 <returns>
127 An object that implements System.Collections.IEnumerator.
128 </returns>
129 </member>
130 <member name="P:QuickGraph.Collections.DoubleCollection.Item(System.Int32)">
131 <summary>
132 Gets or sets the Double at the given index in this DoubleCollection.
133 </summary>
134 </member>
135 <member name="T:QuickGraph.Collections.DoubleCollection.Enumerator">
136 <summary>
137 Type-specific enumeration class, used by DoubleCollection.GetEnumerator.
138 </summary>
139 </member>
140 <member name="T:QuickGraph.Collections.EdgeCollection">
141 <summary>
142 A collection of elements of type Edge
143 </summary>
144 </member>
145 <member name="T:QuickGraph.Concepts.Collections.IEdgeCollection">
146 <summary>
147 An edge enumerable collection
148 </summary>
149 </member>
150 <member name="T:QuickGraph.Concepts.Collections.IEdgeEnumerable">
151 <summary>
152 Edge enumerable collection
153 </summary>
154 </member>
155 <member name="M:QuickGraph.Concepts.Collections.IEdgeEnumerable.GetEnumerator">
156 <summary>
157
158 </summary>
159 <returns></returns>
160 </member>
161 <member name="M:QuickGraph.Collections.EdgeCollection.#ctor">
162 <summary>
163 Initializes a new empty instance of the EdgeCollection class.
164 </summary>
165 </member>
166 <member name="M:QuickGraph.Collections.EdgeCollection.#ctor(QuickGraph.Concepts.IEdge[])">
167 <summary>
168 Initializes a new instance of the EdgeCollection class, containing elements
169 copied from an array.
170 </summary>
171 <param name="items">
172 The array whose elements are to be added to the new EdgeCollection.
173 </param>
174 </member>
175 <member name="M:QuickGraph.Collections.EdgeCollection.#ctor(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
176 <summary>
177 Initializes a new instance of the EdgeCollection class, containing elements
178 copied from another instance of EdgeCollection
179 </summary>
180 <param name="items">
181 The EdgeCollection whose elements are to be added to the new EdgeCollection.
182 </param>
183 </member>
184 <member name="M:QuickGraph.Collections.EdgeCollection.AddRange(QuickGraph.Concepts.IEdge[])">
185 <summary>
186 Adds the elements of an array to the end of this EdgeCollection.
187 </summary>
188 <param name="items">
189 The array whose elements are to be added to the end of this EdgeCollection.
190 </param>
191 </member>
192 <member name="M:QuickGraph.Collections.EdgeCollection.AddRange(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
193 <summary>
194 Adds the elements of another EdgeCollection to the end of this EdgeCollection.
195 </summary>
196 <param name="items">
197 The EdgeCollection whose elements are to be added to the end of this EdgeCollection.
198 </param>
199 </member>
200 <member name="M:QuickGraph.Collections.EdgeCollection.Add(QuickGraph.Concepts.IEdge)">
201 <summary>
202 Adds an instance of type Edge to the end of this EdgeCollection.
203 </summary>
204 <param name="value">
205 The Edge to be added to the end of this EdgeCollection.
206 </param>
207 </member>
208 <member name="M:QuickGraph.Collections.EdgeCollection.Contains(QuickGraph.Concepts.IEdge)">
209 <summary>
210 Determines whether a specfic Edge value is in this EdgeCollection.
211 </summary>
212 <param name="value">
213 The Edge value to locate in this EdgeCollection.
214 </param>
215 <returns>
216 true if value is found in this EdgeCollection;
217 false otherwise.
218 </returns>
219 </member>
220 <member name="M:QuickGraph.Collections.EdgeCollection.IndexOf(QuickGraph.Concepts.IEdge)">
221 <summary>
222 Return the zero-based index of the first occurrence of a specific value
223 in this EdgeCollection
224 </summary>
225 <param name="value">
226 The Edge value to locate in the EdgeCollection.
227 </param>
228 <returns>
229 The zero-based index of the first occurrence of the _ELEMENT value if found;
230 -1 otherwise.
231 </returns>
232 </member>
233 <member name="M:QuickGraph.Collections.EdgeCollection.Insert(System.Int32,QuickGraph.Concepts.IEdge)">
234 <summary>
235 Inserts an element into the EdgeCollection at the specified index
236 </summary>
237 <param name="index">
238 The index at which the Edge is to be inserted.
239 </param>
240 <param name="value">
241 The Edge to insert.
242 </param>
243 </member>
244 <member name="M:QuickGraph.Collections.EdgeCollection.Remove(QuickGraph.Concepts.IEdge)">
245 <summary>
246 Removes the first occurrence of a specific Edge from this EdgeCollection.
247 </summary>
248 <param name="value">
249 The Edge value to remove from this EdgeCollection.
250 </param>
251 </member>
252 <member name="M:QuickGraph.Collections.EdgeCollection.GetEnumerator">
253 <summary>
254 Returns an enumerator that can iterate through the elements of this EdgeCollection.
255 </summary>
256 <returns>
257 An object that implements System.Collections.IEnumerator.
258 </returns>
259 </member>
260 <member name="P:QuickGraph.Collections.EdgeCollection.Item(System.Int32)">
261 <summary>
262 Gets or sets the Edge at the given index in this EdgeCollection.
263 </summary>
264 </member>
265 <member name="T:QuickGraph.Collections.EdgeCollection.Enumerator">
266 <summary>
267 Type-specific enumeration class, used by EdgeCollection.GetEnumerator.
268 </summary>
269 </member>
270 <member name="T:QuickGraph.Concepts.Collections.IEdgeEnumerator">
271 <summary>
272 An edge enumerator
273 </summary>
274 </member>
275 <member name="P:QuickGraph.Concepts.Collections.IEdgeEnumerator.Current">
276 <summary>
277 Current edge
278 </summary>
279 </member>
280 <member name="M:QuickGraph.Collections.EdgeCollection.Enumerator.#ctor(QuickGraph.Collections.EdgeCollection)">
281 <summary>
282 Create a new enumerator on the collection
283 </summary>
284 <param name="collection">collection to enumerate</param>
285 </member>
286 <member name="M:QuickGraph.Collections.EdgeCollection.Enumerator.MoveNext">
287 <summary>
288 Moves cursor to next element.
289 </summary>
290 <returns>true if current is valid, false otherwize</returns>
291 </member>
292 <member name="M:QuickGraph.Collections.EdgeCollection.Enumerator.Reset">
293 <summary>
294 Resets the cursor to the position before the first element.
295 </summary>
296 </member>
297 <member name="P:QuickGraph.Collections.EdgeCollection.Enumerator.Current">
298 <summary>
299 The current element.
300 </summary>
301 </member>
302 <member name="T:QuickGraph.Collections.EdgeCollectionCollection">
303 <summary>
304 A collection of elements of type EdgeCollection
305 </summary>
306 </member>
307 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.#ctor">
308 <summary>
309 Initializes a new empty instance of the EdgeCollectionCollection class.
310 </summary>
311 </member>
312 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.#ctor(QuickGraph.Collections.EdgeCollection[])">
313 <summary>
314 Initializes a new instance of the EdgeCollectionCollection class, containing elements
315 copied from an array.
316 </summary>
317 <param name="items">
318 The array whose elements are to be added to the new EdgeCollectionCollection.
319 </param>
320 </member>
321 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.#ctor(QuickGraph.Collections.EdgeCollectionCollection)">
322 <summary>
323 Initializes a new instance of the EdgeCollectionCollection class, containing elements
324 copied from another instance of EdgeCollectionCollection
325 </summary>
326 <param name="items">
327 The EdgeCollectionCollection whose elements are to be added to the new EdgeCollectionCollection.
328 </param>
329 </member>
330 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.AddRange(QuickGraph.Collections.EdgeCollection[])">
331 <summary>
332 Adds the elements of an array to the end of this EdgeCollectionCollection.
333 </summary>
334 <param name="items">
335 The array whose elements are to be added to the end of this EdgeCollectionCollection.
336 </param>
337 </member>
338 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.AddRange(QuickGraph.Collections.EdgeCollectionCollection)">
339 <summary>
340 Adds the elements of another EdgeCollectionCollection to the end of this EdgeCollectionCollection.
341 </summary>
342 <param name="items">
343 The EdgeCollectionCollection whose elements are to be added to the end of this EdgeCollectionCollection.
344 </param>
345 </member>
346 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Add(QuickGraph.Collections.EdgeCollection)">
347 <summary>
348 Adds an instance of type EdgeCollection to the end of this EdgeCollectionCollection.
349 </summary>
350 <param name="value">
351 The EdgeCollection to be added to the end of this EdgeCollectionCollection.
352 </param>
353 </member>
354 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Contains(QuickGraph.Collections.EdgeCollection)">
355 <summary>
356 Determines whether a specfic EdgeCollection value is in this EdgeCollectionCollection.
357 </summary>
358 <param name="value">
359 The EdgeCollection value to locate in this EdgeCollectionCollection.
360 </param>
361 <returns>
362 true if value is found in this EdgeCollectionCollection;
363 false otherwise.
364 </returns>
365 </member>
366 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.IndexOf(QuickGraph.Collections.EdgeCollection)">
367 <summary>
368 Return the zero-based index of the first occurrence of a specific value
369 in this EdgeCollectionCollection
370 </summary>
371 <param name="value">
372 The EdgeCollection value to locate in the EdgeCollectionCollection.
373 </param>
374 <returns>
375 The zero-based index of the first occurrence of the _ELEMENT value if found;
376 -1 otherwise.
377 </returns>
378 </member>
379 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Insert(System.Int32,QuickGraph.Collections.EdgeCollection)">
380 <summary>
381 Inserts an element into the EdgeCollectionCollection at the specified index
382 </summary>
383 <param name="index">
384 The index at which the EdgeCollection is to be inserted.
385 </param>
386 <param name="value">
387 The EdgeCollection to insert.
388 </param>
389 </member>
390 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Remove(QuickGraph.Collections.EdgeCollection)">
391 <summary>
392 Removes the first occurrence of a specific EdgeCollection from this EdgeCollectionCollection.
393 </summary>
394 <param name="value">
395 The EdgeCollection value to remove from this EdgeCollectionCollection.
396 </param>
397 </member>
398 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.GetEnumerator">
399 <summary>
400 Returns an enumerator that can iterate through the elements of this EdgeCollectionCollection.
401 </summary>
402 <returns>
403 An object that implements System.Collections.IEnumerator.
404 </returns>
405 </member>
406 <member name="P:QuickGraph.Collections.EdgeCollectionCollection.Item(System.Int32)">
407 <summary>
408 Gets or sets the EdgeCollection at the given index in this EdgeCollectionCollection.
409 </summary>
410 </member>
411 <member name="T:QuickGraph.Collections.EdgeCollectionCollection.Enumerator">
412 <summary>
413 Type-specific enumeration class, used by EdgeCollectionCollection.GetEnumerator.
414 </summary>
415 </member>
416 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Enumerator.#ctor(QuickGraph.Collections.EdgeCollectionCollection)">
417 <summary>
418
419 </summary>
420 <param name="collection"></param>
421 </member>
422 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Enumerator.MoveNext">
423 <summary>
424
425 </summary>
426 <returns></returns>
427 </member>
428 <member name="M:QuickGraph.Collections.EdgeCollectionCollection.Enumerator.Reset">
429 <summary>
430
431 </summary>
432 </member>
433 <member name="P:QuickGraph.Collections.EdgeCollectionCollection.Enumerator.Current">
434 <summary>
435 Gets the current edge collection
436 </summary>
437 <value>
438 Current edge collection
439 </value>
440 </member>
441 <member name="P:QuickGraph.Collections.EdgeCollectionCollection.Enumerator.System#Collections#IEnumerator#Current">
442 <summary>
443
444 </summary>
445 </member>
446 <member name="T:QuickGraph.Collections.EdgeColorDictionary">
447 <summary>
448 A dictionary with keys of type Edge and values of type GraphColor
449 </summary>
450 </member>
451 <member name="M:QuickGraph.Collections.EdgeColorDictionary.#ctor">
452 <summary>
453 Initializes a new empty instance of the EdgeGraphColorDictionary class
454 </summary>
455 </member>
456 <member name="M:QuickGraph.Collections.EdgeColorDictionary.Add(QuickGraph.Concepts.IEdge,QuickGraph.Concepts.GraphColor)">
457 <summary>
458 Adds an element with the specified key and value to this EdgeGraphColorDictionary.
459 </summary>
460 <param name="key">
461 The Edge key of the element to add.
462 </param>
463 <param name="value">
464 The GraphColor value of the element to add.
465 </param>
466 </member>
467 <member name="M:QuickGraph.Collections.EdgeColorDictionary.Contains(QuickGraph.Concepts.IEdge)">
468 <summary>
469 Determines whether this EdgeGraphColorDictionary contains a specific key.
470 </summary>
471 <param name="key">
472 The Edge key to locate in this EdgeGraphColorDictionary.
473 </param>
474 <returns>
475 true if this EdgeGraphColorDictionary contains an element with the specified key;
476 otherwise, false.
477 </returns>
478 </member>
479 <member name="M:QuickGraph.Collections.EdgeColorDictionary.ContainsKey(QuickGraph.Concepts.IEdge)">
480 <summary>
481 Determines whether this EdgeGraphColorDictionary contains a specific key.
482 </summary>
483 <param name="key">
484 The Edge key to locate in this EdgeGraphColorDictionary.
485 </param>
486 <returns>
487 true if this EdgeGraphColorDictionary contains an element with the specified key;
488 otherwise, false.
489 </returns>
490 </member>
491 <member name="M:QuickGraph.Collections.EdgeColorDictionary.ContainsValue(QuickGraph.Concepts.GraphColor)">
492 <summary>
493 Determines whether this EdgeGraphColorDictionary contains a specific value.
494 </summary>
495 <param name="value">
496 The GraphColor value to locate in this EdgeGraphColorDictionary.
497 </param>
498 <returns>
499 true if this EdgeGraphColorDictionary contains an element with the specified value;
500 otherwise, false.
501 </returns>
502 </member>
503 <member name="M:QuickGraph.Collections.EdgeColorDictionary.Remove(QuickGraph.Concepts.IEdge)">
504 <summary>
505 Removes the element with the specified key from this EdgeGraphColorDictionary.
506 </summary>
507 <param name="key">
508 The Edge key of the element to remove.
509 </param>
510 </member>
511 <member name="P:QuickGraph.Collections.EdgeColorDictionary.Item(QuickGraph.Concepts.IEdge)">
512 <summary>
513 Gets or sets the GraphColor associated with the given Edge
514 </summary>
515 <param name="key">
516 The Edge whose value to get or set.
517 </param>
518 </member>
519 <member name="P:QuickGraph.Collections.EdgeColorDictionary.Keys">
520 <summary>
521 Gets a collection containing the keys in this EdgeGraphColorDictionary.
522 </summary>
523 </member>
524 <member name="P:QuickGraph.Collections.EdgeColorDictionary.Values">
525 <summary>
526 Gets a collection containing the values in this EdgeGraphColorDictionary.
527 </summary>
528 </member>
529 <member name="T:QuickGraph.Collections.EdgeDoubleDictionary">
530 <summary>
531 A dictionary with keys of type Edge and values of type Double
532 </summary>
533 </member>
534 <member name="M:QuickGraph.Collections.EdgeDoubleDictionary.#ctor">
535 <summary>
536 Initializes a new empty instance of the EdgeDoubleDictionary class
537 </summary>
538 </member>
539 <member name="M:QuickGraph.Collections.EdgeDoubleDictionary.Add(QuickGraph.Concepts.IEdge,System.Double)">
540 <summary>
541 Adds an element with the specified key and value to this EdgeDoubleDictionary.
542 </summary>
543 <param name="key">
544 The Edge key of the element to add.
545 </param>
546 <param name="value">
547 The Double value of the element to add.
548 </param>
549 </member>
550 <member name="M:QuickGraph.Collections.EdgeDoubleDictionary.Contains(QuickGraph.Concepts.IEdge)">
551 <summary>
552 Determines whether this EdgeDoubleDictionary contains a specific key.
553 </summary>
554 <param name="key">
555 The Edge key to locate in this EdgeDoubleDictionary.
556 </param>
557 <returns>
558 true if this EdgeDoubleDictionary contains an element with the specified key;
559 otherwise, false.
560 </returns>
561 </member>
562 <member name="M:QuickGraph.Collections.EdgeDoubleDictionary.ContainsKey(QuickGraph.Concepts.IEdge)">
563 <summary>
564 Determines whether this EdgeDoubleDictionary contains a specific key.
565 </summary>
566 <param name="key">
567 The Edge key to locate in this EdgeDoubleDictionary.
568 </param>
569 <returns>
570 true if this EdgeDoubleDictionary contains an element with the specified key;
571 otherwise, false.
572 </returns>
573 </member>
574 <member name="M:QuickGraph.Collections.EdgeDoubleDictionary.ContainsValue(System.Double)">
575 <summary>
576 Determines whether this EdgeDoubleDictionary contains a specific value.
577 </summary>
578 <param name="value">
579 The Double value to locate in this EdgeDoubleDictionary.
580 </param>
581 <returns>
582 true if this EdgeDoubleDictionary contains an element with the specified value;
583 otherwise, false.
584 </returns>
585 </member>
586 <member name="M:QuickGraph.Collections.EdgeDoubleDictionary.Remove(QuickGraph.Concepts.IEdge)">
587 <summary>
588 Removes the element with the specified key from this EdgeDoubleDictionary.
589 </summary>
590 <param name="key">
591 The Edge key of the element to remove.
592 </param>
593 </member>
594 <member name="P:QuickGraph.Collections.EdgeDoubleDictionary.Item(QuickGraph.Concepts.IEdge)">
595 <summary>
596 Gets or sets the Double associated with the given Edge
597 </summary>
598 <param name="key">
599 The Edge whose value to get or set.
600 </param>
601 </member>
602 <member name="P:QuickGraph.Collections.EdgeDoubleDictionary.Keys">
603 <summary>
604 Gets a collection containing the keys in this EdgeDoubleDictionary.
605 </summary>
606 </member>
607 <member name="P:QuickGraph.Collections.EdgeDoubleDictionary.Values">
608 <summary>
609 Gets a collection containing the values in this EdgeDoubleDictionary.
610 </summary>
611 </member>
612 <member name="T:QuickGraph.Collections.EdgeEdgeDictionary">
613 <summary>
614 A dictionary with keys of type IEdge and values of type IEdge
615 </summary>
616 </member>
617 <member name="M:QuickGraph.Collections.EdgeEdgeDictionary.#ctor">
618 <summary>
619 Initializes a new empty instance of the EdgeEdgeDictionary class
620 </summary>
621 </member>
622 <member name="M:QuickGraph.Collections.EdgeEdgeDictionary.Add(QuickGraph.Concepts.IEdge,QuickGraph.Concepts.IEdge)">
623 <summary>
624 Adds an element with the specified key and value to this EdgeEdgeDictionary.
625 </summary>
626 <param name="key">
627 The IEdge key of the element to add.
628 </param>
629 <param name="value">
630 The IEdge value of the element to add.
631 </param>
632 </member>
633 <member name="M:QuickGraph.Collections.EdgeEdgeDictionary.Contains(QuickGraph.Concepts.IEdge)">
634 <summary>
635 Determines whether this EdgeEdgeDictionary contains a specific key.
636 </summary>
637 <param name="key">
638 The IEdge key to locate in this EdgeEdgeDictionary.
639 </param>
640 <returns>
641 true if this EdgeEdgeDictionary contains an element with the specified key;
642 otherwise, false.
643 </returns>
644 </member>
645 <member name="M:QuickGraph.Collections.EdgeEdgeDictionary.ContainsKey(QuickGraph.Concepts.IEdge)">
646 <summary>
647 Determines whether this EdgeEdgeDictionary contains a specific key.
648 </summary>
649 <param name="key">
650 The IEdge key to locate in this EdgeEdgeDictionary.
651 </param>
652 <returns>
653 true if this EdgeEdgeDictionary contains an element with the specified key;
654 otherwise, false.
655 </returns>
656 </member>
657 <member name="M:QuickGraph.Collections.EdgeEdgeDictionary.ContainsValue(QuickGraph.Concepts.IEdge)">
658 <summary>
659 Determines whether this EdgeEdgeDictionary contains a specific value.
660 </summary>
661 <param name="value">
662 The IEdge value to locate in this EdgeEdgeDictionary.
663 </param>
664 <returns>
665 true if this EdgeEdgeDictionary contains an element with the specified value;
666 otherwise, false.
667 </returns>
668 </member>
669 <member name="M:QuickGraph.Collections.EdgeEdgeDictionary.Remove(QuickGraph.Concepts.IEdge)">
670 <summary>
671 Removes the element with the specified key from this EdgeEdgeDictionary.
672 </summary>
673 <param name="key">
674 The IEdge key of the element to remove.
675 </param>
676 </member>
677 <member name="P:QuickGraph.Collections.EdgeEdgeDictionary.Item(QuickGraph.Concepts.IEdge)">
678 <summary>
679 Gets or sets the IEdge associated with the given IEdge
680 </summary>
681 <param name="key">
682 The IEdge whose value to get or set.
683 </param>
684 </member>
685 <member name="P:QuickGraph.Collections.EdgeEdgeDictionary.Keys">
686 <summary>
687 Gets a collection containing the keys in this EdgeEdgeDictionary.
688 </summary>
689 </member>
690 <member name="P:QuickGraph.Collections.EdgeEdgeDictionary.Values">
691 <summary>
692 Gets a collection containing the values in this EdgeEdgeDictionary.
693 </summary>
694 </member>
695 <member name="T:QuickGraph.Collections.EdgeEnumerable">
696 <summary>
697 A wrapper class for weak collection of IEdge
698 </summary>
699 <remarks>
700 <para>
701 This class works as a proxy for a weakly named collection of IEdge by
702 implementing the IEdgeEnumerable interface.
703 </para>
704 </remarks>
705 <example>
706 In this example, we show how to convert the value collection of
707 a vertex dictionary to a stronly typed collection:
708 <code>
709 VertexEdgeDictionary names = new VertexEdgeDictionary();
710 ...
711 // this will fail names.Values implements IEnumerable.
712 IEdgeEnumerable c = names.Values;
713 // wrapping the values
714 IEdgeEnumrable c = new EdgeEnumerable(names.Values);
715 </code>
716 </example>
717 </member>
718 <member name="M:QuickGraph.Collections.EdgeEnumerable.#ctor(System.Collections.IEnumerable)">
719 <summary>
720 Method
721 </summary>
722 <param name="en">Wrapped enumerable</param>
723 <exception cref="T:System.ArgumentNullException">en is null</exception>
724 </member>
725 <member name="M:QuickGraph.Collections.EdgeEnumerable.Wrap(System.Collections.IEnumerable)">
726 <summary>
727 Wraps up the weakly typed collection in a strongly typed (IEdge)
728 collection.
729 </summary>
730 <param name="en">Collection to wrap</param>
731 <returns>Edge enumerable collection</returns>
732 <remarks>
733 <para>
734 The method is thread-safe.
735 </para>
736 </remarks>
737 </member>
738 <member name="M:QuickGraph.Collections.EdgeEnumerable.GetEnumerator">
739 <summary>
740 Return a strongly typed enumerator
741 </summary>
742 <returns>strongly typed enumerator</returns>
743 </member>
744 <member name="M:QuickGraph.Collections.EdgeEnumerable.QuickGraph#Concepts#Collections#IEdgeEnumerable#GetEnumerator">
745 <summary>
746
747 </summary>
748 <returns></returns>
749 </member>
750 <member name="M:QuickGraph.Collections.EdgeEnumerable.System#Collections#IEnumerable#GetEnumerator">
751 <summary>
752
753 </summary>
754 <returns></returns>
755 </member>
756 <member name="P:QuickGraph.Collections.EdgeEnumerable.Enumerable">
757 <summary>
758 Wrapped enumerable
759 </summary>
760 </member>
761 <member name="T:QuickGraph.Collections.EdgeEnumerable.Enumerator">
762 <summary>
763 Strongly typed enumerator
764 </summary>
765 </member>
766 <member name="M:QuickGraph.Collections.EdgeEnumerable.Enumerator.#ctor(System.Collections.IEnumerator)">
767 <summary>
768 Builds a new enumrator
769 </summary>
770 <param name="e">wrapped enumerator</param>
771 <exception cref="T:System.ArgumentNullException">e is null</exception>
772 </member>
773 <member name="M:QuickGraph.Collections.EdgeEnumerable.Enumerator.Reset">
774 <summary>
775
776 </summary>
777 </member>
778 <member name="M:QuickGraph.Collections.EdgeEnumerable.Enumerator.MoveNext">
779 <summary>
780
781 </summary>
782 <returns></returns>
783 </member>
784 <member name="P:QuickGraph.Collections.EdgeEnumerable.Enumerator.Wrapped">
785 <summary>
786 Wrapped enumerator
787 </summary>
788 </member>
789 <member name="P:QuickGraph.Collections.EdgeEnumerable.Enumerator.Current">
790 <summary>
791 Current Edge
792 </summary>
793 </member>
794 <member name="P:QuickGraph.Collections.EdgeEnumerable.Enumerator.System#Collections#IEnumerator#Current">
795 <summary>
796
797 </summary>
798 </member>
799 <member name="T:QuickGraph.Collections.EdgeIntDictionary">
800 <summary>
801 A dictionary with keys of type IEdge and values of type Int
802 </summary>
803 </member>
804 <member name="M:QuickGraph.Collections.EdgeIntDictionary.#ctor">
805 <summary>
806 Initializes a new empty instance of the EdgeIntDictionary class
807 </summary>
808 </member>
809 <member name="M:QuickGraph.Collections.EdgeIntDictionary.Add(QuickGraph.Concepts.IEdge,System.Int32)">
810 <summary>
811 Adds an element with the specified key and value to this EdgeIntDictionary.
812 </summary>
813 <param name="key">
814 The IEdge key of the element to add.
815 </param>
816 <param name="value">
817 The Int value of the element to add.
818 </param>
819 </member>
820 <member name="M:QuickGraph.Collections.EdgeIntDictionary.Contains(QuickGraph.Concepts.IEdge)">
821 <summary>
822 Determines whether this EdgeIntDictionary contains a specific key.
823 </summary>
824 <param name="key">
825 The IEdge key to locate in this EdgeIntDictionary.
826 </param>
827 <returns>
828 true if this EdgeIntDictionary contains an element with the specified key;
829 otherwise, false.
830 </returns>
831 </member>
832 <member name="M:QuickGraph.Collections.EdgeIntDictionary.ContainsKey(QuickGraph.Concepts.IEdge)">
833 <summary>
834 Determines whether this EdgeIntDictionary contains a specific key.
835 </summary>
836 <param name="key">
837 The IEdge key to locate in this EdgeIntDictionary.
838 </param>
839 <returns>
840 true if this EdgeIntDictionary contains an element with the specified key;
841 otherwise, false.
842 </returns>
843 </member>
844 <member name="M:QuickGraph.Collections.EdgeIntDictionary.ContainsValue(System.Int32)">
845 <summary>
846 Determines whether this EdgeIntDictionary contains a specific value.
847 </summary>
848 <param name="value">
849 The Int value to locate in this EdgeIntDictionary.
850 </param>
851 <returns>
852 true if this EdgeIntDictionary contains an element with the specified value;
853 otherwise, false.
854 </returns>
855 </member>
856 <member name="M:QuickGraph.Collections.EdgeIntDictionary.Remove(QuickGraph.Concepts.IEdge)">
857 <summary>
858 Removes the element with the specified key from this EdgeIntDictionary.
859 </summary>
860 <param name="key">
861 The IEdge key of the element to remove.
862 </param>
863 </member>
864 <member name="P:QuickGraph.Collections.EdgeIntDictionary.Item(QuickGraph.Concepts.IEdge)">
865 <summary>
866 Gets or sets the Int associated with the given IEdge
867 </summary>
868 <param name="key">
869 The IEdge whose value to get or set.
870 </param>
871 </member>
872 <member name="P:QuickGraph.Collections.EdgeIntDictionary.Keys">
873 <summary>
874 Gets a collection containing the keys in this EdgeIntDictionary.
875 </summary>
876 </member>
877 <member name="P:QuickGraph.Collections.EdgeIntDictionary.Values">
878 <summary>
879 Gets a collection containing the values in this EdgeIntDictionary.
880 </summary>
881 </member>
882 <member name="T:QuickGraph.Collections.EdgeObjectDictionary">
883 <summary>
884 A dictionary with keys of type Edge and values of type Object
885 </summary>
886 </member>
887 <member name="M:QuickGraph.Collections.EdgeObjectDictionary.#ctor">
888 <summary>
889 Initializes a new empty instance of the EdgeObjectDictionary class
890 </summary>
891 </member>
892 <member name="M:QuickGraph.Collections.EdgeObjectDictionary.Add(QuickGraph.Concepts.IEdge,System.Object)">
893 <summary>
894 Adds an element with the specified key and value to this EdgeObjectDictionary.
895 </summary>
896 <param name="key">
897 The Edge key of the element to add.
898 </param>
899 <param name="value">
900 The Object value of the element to add.
901 </param>
902 </member>
903 <member name="M:QuickGraph.Collections.EdgeObjectDictionary.Contains(QuickGraph.Concepts.IEdge)">
904 <summary>
905 Determines whether this EdgeObjectDictionary contains a specific key.
906 </summary>
907 <param name="key">
908 The Edge key to locate in this EdgeObjectDictionary.
909 </param>
910 <returns>
911 true if this EdgeObjectDictionary contains an element with the specified key;
912 otherwise, false.
913 </returns>
914 </member>
915 <member name="M:QuickGraph.Collections.EdgeObjectDictionary.ContainsKey(QuickGraph.Concepts.IEdge)">
916 <summary>
917 Determines whether this EdgeObjectDictionary contains a specific key.
918 </summary>
919 <param name="key">
920 The Edge key to locate in this EdgeObjectDictionary.
921 </param>
922 <returns>
923 true if this EdgeObjectDictionary contains an element with the specified key;
924 otherwise, false.
925 </returns>
926 </member>
927 <member name="M:QuickGraph.Collections.EdgeObjectDictionary.ContainsValue(System.Object)">
928 <summary>
929 Determines whether this EdgeObjectDictionary contains a specific value.
930 </summary>
931 <param name="value">
932 The Object value to locate in this EdgeObjectDictionary.
933 </param>
934 <returns>
935 true if this EdgeObjectDictionary contains an element with the specified value;
936 otherwise, false.
937 </returns>
938 </member>
939 <member name="M:QuickGraph.Collections.EdgeObjectDictionary.Remove(QuickGraph.Concepts.IEdge)">
940 <summary>
941 Removes the element with the specified key from this EdgeObjectDictionary.
942 </summary>
943 <param name="key">
944 The Edge key of the element to remove.
945 </param>
946 </member>
947 <member name="P:QuickGraph.Collections.EdgeObjectDictionary.Item(QuickGraph.Concepts.IEdge)">
948 <summary>
949 Gets or sets the Object associated with the given Edge
950 </summary>
951 <param name="key">
952 The Edge whose value to get or set.
953 </param>
954 </member>
955 <member name="P:QuickGraph.Collections.EdgeObjectDictionary.Keys">
956 <summary>
957 Gets a collection containing the keys in this EdgeObjectDictionary.
958 </summary>
959 </member>
960 <member name="P:QuickGraph.Collections.EdgeObjectDictionary.Values">
961 <summary>
962 Gets a collection containing the values in this EdgeObjectDictionary.
963 </summary>
964 </member>
965 <member name="T:QuickGraph.Collections.EdgeStringDictionary">
966 <summary>
967 A dictionary with keys of type Edge and values of type String
968 </summary>
969 </member>
970 <member name="M:QuickGraph.Collections.EdgeStringDictionary.#ctor">
971 <summary>
972 Initializes a new empty instance of the EdgeStringDictionary class
973 </summary>
974 </member>
975 <member name="M:QuickGraph.Collections.EdgeStringDictionary.Add(QuickGraph.Concepts.IEdge,System.String)">
976 <summary>
977 Adds an element with the specified key and value to this EdgeStringDictionary.
978 </summary>
979 <param name="key">
980 The Edge key of the element to add.
981 </param>
982 <param name="value">
983 The String value of the element to add.
984 </param>
985 </member>
986 <member name="M:QuickGraph.Collections.EdgeStringDictionary.Contains(QuickGraph.Concepts.IEdge)">
987 <summary>
988 Determines whether this EdgeStringDictionary contains a specific key.
989 </summary>
990 <param name="key">
991 The Edge key to locate in this EdgeStringDictionary.
992 </param>
993 <returns>
994 true if this EdgeStringDictionary contains an element with the specified key;
995 otherwise, false.
996 </returns>
997 </member>
998 <member name="M:QuickGraph.Collections.EdgeStringDictionary.ContainsKey(QuickGraph.Concepts.IEdge)">
999 <summary>
1000 Determines whether this EdgeStringDictionary contains a specific key.
1001 </summary>
1002 <param name="key">
1003 The Edge key to locate in this EdgeStringDictionary.
1004 </param>
1005 <returns>
1006 true if this EdgeStringDictionary contains an element with the specified key;
1007 otherwise, false.
1008 </returns>
1009 </member>
1010 <member name="M:QuickGraph.Collections.EdgeStringDictionary.ContainsValue(System.String)">
1011 <summary>
1012 Determines whether this EdgeStringDictionary contains a specific value.
1013 </summary>
1014 <param name="value">
1015 The String value to locate in this EdgeStringDictionary.
1016 </param>
1017 <returns>
1018 true if this EdgeStringDictionary contains an element with the specified value;
1019 otherwise, false.
1020 </returns>
1021 </member>
1022 <member name="M:QuickGraph.Collections.EdgeStringDictionary.Remove(QuickGraph.Concepts.IEdge)">
1023 <summary>
1024 Removes the element with the specified key from this EdgeStringDictionary.
1025 </summary>
1026 <param name="key">
1027 The Edge key of the element to remove.
1028 </param>
1029 </member>
1030 <member name="P:QuickGraph.Collections.EdgeStringDictionary.Item(QuickGraph.Concepts.IEdge)">
1031 <summary>
1032 Gets or sets the String associated with the given Edge
1033 </summary>
1034 <param name="key">
1035 The Edge whose value to get or set.
1036 </param>
1037 </member>
1038 <member name="P:QuickGraph.Collections.EdgeStringDictionary.Keys">
1039 <summary>
1040 Gets a collection containing the keys in this EdgeStringDictionary.
1041 </summary>
1042 </member>
1043 <member name="P:QuickGraph.Collections.EdgeStringDictionary.Values">
1044 <summary>
1045 Gets a collection containing the values in this EdgeStringDictionary.
1046 </summary>
1047 </member>
1048 <member name="T:QuickGraph.Collections.Filtered.FilteredAdjacencyGraph">
1049 <summary>
1050 A filtered adjacency graph
1051 </summary>
1052 </member>
1053 <member name="T:QuickGraph.Concepts.Traversals.IAdjacencyGraph">
1054 <summary>
1055 AdjacentGraph concept
1056 </summary>
1057 </member>
1058 <member name="M:QuickGraph.Concepts.Traversals.IAdjacencyGraph.AdjacentVertices(QuickGraph.Concepts.IVertex)">
1059 <summary>
1060 Returns a enumerable collection of adjacent vertices
1061 </summary>
1062 </member>
1063 <member name="M:QuickGraph.Collections.Filtered.FilteredAdjacencyGraph.#ctor(QuickGraph.Concepts.Traversals.IAdjacencyGraph,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1064 <summary>
1065 Create an adjacency filtered graph
1066 </summary>
1067 <param name="g">graph to filter</param>
1068 <param name="vp">vertex predicate</param>
1069 </member>
1070 <member name="M:QuickGraph.Collections.Filtered.FilteredAdjacencyGraph.AdjacentVertices(QuickGraph.Concepts.IVertex)">
1071 <summary>
1072 Returns a filtered enumerable collection of adjacent vertices
1073 </summary>
1074 <param name="v"></param>
1075 <returns></returns>
1076 </member>
1077 <member name="M:QuickGraph.Collections.Filtered.FilteredAdjacencyGraph.QuickGraph#Concepts#Traversals#IAdjacencyGraph#AdjacentVertices(QuickGraph.Concepts.IVertex)">
1078 <summary>
1079
1080 </summary>
1081 <param name="v"></param>
1082 <returns></returns>
1083 </member>
1084 <member name="P:QuickGraph.Collections.Filtered.FilteredAdjacencyGraph.AdjacencyGraph">
1085 <summary>
1086 Filtered adjacency graph
1087 </summary>
1088 </member>
1089 <member name="P:QuickGraph.Collections.Filtered.FilteredAdjacencyGraph.VertexPredicate">
1090 <summary>
1091 Vertex predicate used to filter the vertices
1092 </summary>
1093 </member>
1094 <member name="T:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph">
1095 <summary>
1096 A filtered bidirectional graph
1097 </summary>
1098 </member>
1099 <member name="T:QuickGraph.Collections.Filtered.FilteredIncidenceGraph">
1100 <summary>
1101 A filtered incidence graph
1102 </summary>
1103 <remarks>
1104 </remarks>
1105 </member>
1106 <member name="T:QuickGraph.Collections.Filtered.FilteredGraph">
1107 <summary>
1108 Base class for filtered graphs
1109 </summary>
1110 <remarks>
1111 </remarks>
1112 </member>
1113 <member name="T:QuickGraph.Concepts.IGraph">
1114 <summary>
1115 The Graph concept contains a few requirements that are common to all
1116 the graph concepts.
1117 </summary>
1118 </member>
1119 <member name="P:QuickGraph.Concepts.IGraph.IsDirected">
1120 <summary>
1121 Directed or undirected graph
1122 </summary>
1123 <value>
1124 True if directed graph
1125 </value>
1126 </member>
1127 <member name="P:QuickGraph.Concepts.IGraph.AllowParallelEdges">
1128 <summary>
1129 Parallel edge handling
1130 </summary>
1131 <remarks>
1132 This describes whether the graph class allows the insertion of
1133 parallel edges (edges with the same source and target).
1134 </remarks>
1135 </member>
1136 <member name="M:QuickGraph.Collections.Filtered.FilteredGraph.#ctor(QuickGraph.Concepts.IGraph,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1137 <summary>
1138 Construct a graph that filters edges
1139 </summary>
1140 <param name="g">graph to filter</param>
1141 <param name="edgePredicate">edge predicate</param>
1142 <exception cref="T:System.ArgumentNullException">
1143 g or edgePredicate is null
1144 </exception>
1145 </member>
1146 <member name="M:QuickGraph.Collections.Filtered.FilteredGraph.#ctor(QuickGraph.Concepts.IGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1147 <summary>
1148 Construct a filtered graph with an edge and a vertex predicate.
1149 </summary>
1150 <param name="g">graph to filter</param>
1151 <param name="edgePredicate">edge predicate</param>
1152 <param name="vertexPredicate">vertex predicate</param>
1153 <exception cref="T:System.ArgumentNullException">
1154 g, edgePredicate or vertexPredicate are null
1155 </exception>
1156 </member>
1157 <member name="P:QuickGraph.Collections.Filtered.FilteredGraph.Graph">
1158 <summary>
1159 Underlying filtered graph
1160 </summary>
1161 </member>
1162 <member name="P:QuickGraph.Collections.Filtered.FilteredGraph.EdgePredicate">
1163 <summary>
1164 Edge predicate used to filter the edges
1165 </summary>
1166 </member>
1167 <member name="P:QuickGraph.Collections.Filtered.FilteredGraph.VertexPredicate">
1168 <summary>
1169 Vertex predicate used to filter the vertices
1170 </summary>
1171 </member>
1172 <member name="P:QuickGraph.Collections.Filtered.FilteredGraph.IsDirected">
1173 <summary>
1174 True if underlying graph in directed
1175 </summary>
1176 </member>
1177 <member name="P:QuickGraph.Collections.Filtered.FilteredGraph.AllowParallelEdges">
1178 <summary>
1179 True if underlying graph allows parallel edges
1180 </summary>
1181 </member>
1182 <member name="T:QuickGraph.Concepts.Traversals.IIncidenceGraph">
1183 <summary>
1184 Access to each vertex out-edges.
1185 </summary>
1186 <remarks>
1187 <para>
1188 The IncidenceGraph concept provides an interface for efficient access
1189 to the out-edges of each vertex in the graph.
1190 </para>
1191 <seealso cref="T:QuickGraph.Concepts.IGraph"/>
1192 </remarks>
1193 </member>
1194 <member name="T:QuickGraph.Concepts.Traversals.IImplicitGraph">
1195 <summary>
1196 A graph defined by a out-edges method.
1197 </summary>
1198 <remarks>
1199 <para>
1200 The <see cref="!:ImplicitGraph"/> concept provides an interface for implicitely
1201 defining graphs through an <see cref="M:QuickGraph.Concepts.Traversals.IImplicitGraph.OutEdges(QuickGraph.Concepts.IVertex)"/> method.
1202 </para>
1203 <seealso cref="T:QuickGraph.Concepts.IGraph"/>
1204 </remarks>
1205 </member>
1206 <member name="M:QuickGraph.Concepts.Traversals.IImplicitGraph.OutEdgesEmpty(QuickGraph.Concepts.IVertex)">
1207 <summary>
1208 Gets a value indicating if the set of out-edges is empty
1209 </summary>
1210 <remarks>
1211 <para>
1212 Usually faster that calling <see cref="M:QuickGraph.Concepts.Traversals.IImplicitGraph.OutDegree(QuickGraph.Concepts.IVertex)"/>.
1213 </para>
1214 </remarks>
1215 <value>
1216 true if the out-edge set is empty, false otherwise.
1217 </value>
1218 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1219 </member>
1220 <member name="M:QuickGraph.Concepts.Traversals.IImplicitGraph.OutDegree(QuickGraph.Concepts.IVertex)">
1221 <summary>
1222 Returns the out-degree edges of v
1223 </summary>
1224 <param name="v">vertex to test</param>
1225 <returns>out-degree</returns>
1226 </member>
1227 <member name="M:QuickGraph.Concepts.Traversals.IImplicitGraph.OutEdges(QuickGraph.Concepts.IVertex)">
1228 <summary>
1229 Returns an iterable collection of the out edges of v
1230 </summary>
1231 </member>
1232 <member name="M:QuickGraph.Concepts.Traversals.IIncidenceGraph.ContainsEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
1233 <summary>
1234 Gets a value indicating if there is an edge between the vertices
1235 <paramref name="u"/>, <paramref name="v"/>.
1236 </summary>
1237 <param name="u">source vertex</param>
1238 <param name="v">target vertex</param>
1239 <returns>true if (<paramref name="u"/>, <paramref name="v"/>) exists.</returns>
1240 <exception cref="T:System.ArgumentNullException">u or v is a null reference</exception>
1241 <remarks>
1242 This method checks wheter an edge exists between the two vertices.
1243 <para>
1244 Complexity: O(E)
1245 </para>
1246 </remarks>
1247 </member>
1248 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.#ctor(QuickGraph.Concepts.Traversals.IIncidenceGraph,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1249 <summary>
1250 Construct a graph that filters in-edges
1251 </summary>
1252 <param name="g">graph to filter</param>
1253 <param name="edgePredicate">edge predicate</param>
1254 <exception cref="T:System.ArgumentNullException">
1255 g or edgePredicate is null
1256 </exception>
1257 </member>
1258 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.#ctor(QuickGraph.Concepts.Traversals.IIncidenceGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1259 <summary>
1260 Construct a filtered graph with an edge and a vertex predicate.
1261 </summary>
1262 <param name="g">graph to filter</param>
1263 <param name="edgePredicate">edge predicate</param>
1264 <param name="vertexPredicate">vertex predicate</param>
1265 <exception cref="T:System.ArgumentNullException">
1266 g, edgePredicate or vertexPredicate are null
1267 </exception>
1268 </member>
1269 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.OutEdgesEmpty(QuickGraph.Concepts.IVertex)">
1270 <summary>
1271 Gets a value indicating if the set of out-edges is empty
1272 </summary>
1273 <remarks>
1274 <para>
1275 Usually faster that calling <see cref="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.OutDegree(QuickGraph.Concepts.IVertex)"/>.
1276 </para>
1277 </remarks>
1278 <value>
1279 true if the out-edge set is empty, false otherwise.
1280 </value>
1281 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1282 </member>
1283 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.OutDegree(QuickGraph.Concepts.IVertex)">
1284 <summary>
1285 Returns the number of out-degree edges of v
1286 </summary>
1287 <param name="v">vertex to test</param>
1288 <returns>out-degree</returns>
1289 </member>
1290 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.OutEdges(QuickGraph.Concepts.IVertex)">
1291 <summary>
1292 Returns an iterable collection of the out edges of v
1293 </summary>
1294 </member>
1295 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.QuickGraph#Concepts#Traversals#IImplicitGraph#OutEdges(QuickGraph.Concepts.IVertex)">
1296 <summary>
1297 Implentes IIncidenceGraph interface.
1298 </summary>
1299 <param name="v"></param>
1300 <returns></returns>
1301 </member>
1302 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.ContainsEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
1303 <summary>
1304 Gets a value indicating if there is an edge between the vertices
1305 <paramref name="u"/>, <paramref name="v"/>.
1306 </summary>
1307 <param name="u">source vertex</param>
1308 <param name="v">target vertex</param>
1309 <returns>true if (<paramref name="u"/>, <paramref name="v"/>) exists.</returns>
1310 <exception cref="T:System.ArgumentNullException">u or v is a null reference</exception>
1311 <remarks>
1312 This method checks wheter an edge exists between the two vertices.
1313 <para>
1314 Complexity: O(E)
1315 </para>
1316 </remarks>
1317 </member>
1318 <member name="M:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.AdjacentVertices(QuickGraph.Concepts.IVertex)">
1319 <summary>
1320 Gets an enumerable collection of the v adjacent vertices
1321 </summary>
1322 <param name="v"></param>
1323 <returns></returns>
1324 </member>
1325 <member name="P:QuickGraph.Collections.Filtered.FilteredIncidenceGraph.IncidenceGraph">
1326 <summary>
1327 Underlying incidence graph
1328 </summary>
1329 </member>
1330 <member name="T:QuickGraph.Concepts.Traversals.IBidirectionalGraph">
1331 <summary>
1332 Adds access to in-edges.
1333 </summary>
1334 <remarks>
1335 <para>
1336 The BidirectionalGraph concept refines IncidenceGraph and adds the
1337 requirement for efficient access to the in-edges of each vertex.
1338 </para>
1339 <para>
1340 This concept is separated from IncidenceGraph because for directed
1341 graphs efficient access to in-edges typically requires more storage
1342 space, and many algorithms do not require access to in-edges.
1343 </para>
1344 <para>
1345 For undirected graphs this is not an issue,
1346 since the InEdges and OutEdges functions are the same,
1347 they both return the edges incident to the vertex.
1348 </para>
1349 <para>
1350 The InEdges() function is required to be constant time.
1351 The InDegree and Degree properties functions must be linear in the
1352 number of in-edges (for directed graphs) or incident edges
1353 (for undirected graphs).
1354 </para>
1355 </remarks>
1356 </member>
1357 <member name="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.InEdgesEmpty(QuickGraph.Concepts.IVertex)">
1358 <summary>
1359 Gets a value indicating if the set of in-edges is empty
1360 </summary>
1361 <remarks>
1362 <para>
1363 Usually faster that calling <see cref="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.InDegree(QuickGraph.Concepts.IVertex)"/>.
1364 </para>
1365 </remarks>
1366 <value>
1367 true if the in-edge set is empty, false otherwise.
1368 </value>
1369 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1370 </member>
1371 <member name="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.InDegree(QuickGraph.Concepts.IVertex)">
1372 <summary>
1373 Returns the number of in-edges (for directed graphs) or the number
1374 of incident edges (for undirected graphs) of vertex v in graph g.
1375 </summary>
1376 <param name="v">vertex to test</param>
1377 <returns>out-degree</returns>
1378 </member>
1379 <member name="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.AdjacentEdgesEmpty(QuickGraph.Concepts.IVertex)">
1380 <summary>
1381 Gets a value indicating if the set of edges connected to v is empty
1382 </summary>
1383 <remarks>
1384 <para>
1385 Usually faster that calling <see cref="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.Degree(QuickGraph.Concepts.IVertex)"/>.
1386 </para>
1387 </remarks>
1388 <value>
1389 true if the adjacent edge set is empty, false otherwise.
1390 </value>
1391 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1392 </member>
1393 <member name="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.Degree(QuickGraph.Concepts.IVertex)">
1394 <summary>
1395 Returns the number of in-edges plus out-edges (for directed graphs)
1396 or the number of incident edges (for undirected graphs) of
1397 vertex v in graph g.
1398 </summary>
1399 <param name="v">vertex to test</param>
1400 <returns>out-degree</returns>
1401 </member>
1402 <member name="M:QuickGraph.Concepts.Traversals.IBidirectionalGraph.InEdges(QuickGraph.Concepts.IVertex)">
1403 <summary>
1404 Enumerable collection of in-edges
1405 </summary>
1406 <remarks>
1407 <para>
1408 Returns an enumerable collection of in-edges (for directed graphs)
1409 or incident edges (for undirected graphs) of vertex v in graph g.
1410 </para>
1411 <para>
1412 For both directed and undirected graphs, the target of an out-edge
1413 is required to be vertex v and the source is required to be a
1414 vertex that is adjacent to v.
1415 </para>
1416 </remarks>
1417 </member>
1418 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.#ctor(QuickGraph.Concepts.Traversals.IBidirectionalGraph,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1419 <summary>
1420 Construct a graph that filters in and out edges
1421 </summary>
1422 <param name="g">graph to filter</param>
1423 <param name="edgePredicate">edge predicate</param>
1424 <exception cref="T:System.ArgumentNullException">
1425 g or edgePredicate is null
1426 </exception>
1427 </member>
1428 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.#ctor(QuickGraph.Concepts.Traversals.IBidirectionalGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1429 <summary>
1430 Construct a filtered graph with an edge and a vertex predicate.
1431 </summary>
1432 <param name="g">graph to filter</param>
1433 <param name="edgePredicate">edge predicate</param>
1434 <param name="vertexPredicate">vertex predicate</param>
1435 <exception cref="T:System.ArgumentNullException">
1436 g, edgePredicate or vertexPredicate are null
1437 </exception>
1438 </member>
1439 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.AdjacentEdgesEmpty(QuickGraph.Concepts.IVertex)">
1440 <summary>
1441 Gets a value indicating if the set of edges connected to v is empty
1442 </summary>
1443 <remarks>
1444 <para>
1445 Usually faster that calling <see cref="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.Degree(QuickGraph.Concepts.IVertex)"/>.
1446 </para>
1447 </remarks>
1448 <value>
1449 true if the adjacent edge set is empty, false otherwise.
1450 </value>
1451 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1452 </member>
1453 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.InEdgesEmpty(QuickGraph.Concepts.IVertex)">
1454 <summary>
1455 Gets a value indicating if the set of in-edges is empty
1456 </summary>
1457 <remarks>
1458 <para>
1459 Usually faster that calling <see cref="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.InDegree(QuickGraph.Concepts.IVertex)"/>.
1460 </para>
1461 </remarks>
1462 <value>
1463 true if the in-edge set is empty, false otherwise.
1464 </value>
1465 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1466 </member>
1467 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.InDegree(QuickGraph.Concepts.IVertex)">
1468 <summary>
1469 Returns the number of out-degree edges of v
1470 </summary>
1471 <param name="v">vertex to test</param>
1472 <returns>out-degree</returns>
1473 </member>
1474 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.Degree(QuickGraph.Concepts.IVertex)">
1475 <summary>
1476 Vertex filtered degre
1477 </summary>
1478 <param name="v">v to compute degree of</param>
1479 <returns>filtered degree</returns>
1480 </member>
1481 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.InEdges(QuickGraph.Concepts.IVertex)">
1482 <summary>
1483 Returns an iterable collection of the out edges of v
1484 </summary>
1485 </member>
1486 <member name="M:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.QuickGraph#Concepts#Traversals#IBidirectionalGraph#InEdges(QuickGraph.Concepts.IVertex)">
1487 <summary>
1488 Implentens IIncidenceGraph interface.
1489 </summary>
1490 <param name="v"></param>
1491 <returns></returns>
1492 </member>
1493 <member name="P:QuickGraph.Collections.Filtered.FilteredBidirectionalGraph.BidirectionalGraph">
1494 <summary>
1495 Underlying incidence graph
1496 </summary>
1497 </member>
1498 <member name="T:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph">
1499 <summary>
1500 A filtered IEdgeListAndIncidenceGraph.
1501 </summary>
1502 </member>
1503 <member name="T:QuickGraph.Collections.Filtered.FilteredEdgeListGraph">
1504 <summary>
1505 A filtered edge list graph
1506 </summary>
1507 </member>
1508 <member name="T:QuickGraph.Concepts.Traversals.IEdgeListGraph">
1509 <summary>
1510 The EdgeListGraph concept refines the Graph concept,
1511 and adds the requirement for efficient access to all the edges in the
1512 graph.
1513 </summary>
1514 <remarks>
1515 <seealso cref="T:QuickGraph.Concepts.IGraph"/>
1516 </remarks>
1517 </member>
1518 <member name="M:QuickGraph.Concepts.Traversals.IEdgeListGraph.ContainsEdge(QuickGraph.Concepts.IEdge)">
1519 <summary>
1520 Gets a value indicating if the edge <paramref name="e"/> is part
1521 of the list.
1522 </summary>
1523 <param name="e">edge to test</param>
1524 <returns>true if part of the list, false otherwize</returns>
1525 <exception cref="T:System.ArgumentNullException">e is a null reference</exception>
1526 <remarks>
1527 This method checks wheter a particular edge is part of the set.
1528 <para>
1529 Complexity: O(E).
1530 </para>
1531 </remarks>
1532 </member>
1533 <member name="P:QuickGraph.Concepts.Traversals.IEdgeListGraph.EdgesEmpty">
1534 <summary>
1535 Gets a value indicating if the vertex set is empty
1536 </summary>
1537 <remarks>
1538 <para>
1539 Usually faster that calling <see cref="P:QuickGraph.Concepts.Traversals.IEdgeListGraph.EdgesCount"/>.
1540 </para>
1541 </remarks>
1542 <value>
1543 true if the vertex set is empty, false otherwise.
1544 </value>
1545 </member>
1546 <member name="P:QuickGraph.Concepts.Traversals.IEdgeListGraph.EdgesCount">
1547 <summary>
1548 Returns the number of edges in the graph.
1549 </summary>
1550 </member>
1551 <member name="P:QuickGraph.Concepts.Traversals.IEdgeListGraph.Edges">
1552 <summary>
1553 Returns an enumerator providing access to all the edges in the graph.
1554 </summary>
1555 </member>
1556 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.#ctor(QuickGraph.Concepts.Traversals.IEdgeListGraph,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1557 <summary>
1558 Construct a graph that filters edges
1559 </summary>
1560 <param name="g">graph to filter</param>
1561 <param name="edgePredicate">edge predicate</param>
1562 <exception cref="T:System.ArgumentNullException">
1563 g or edgePredicate is null
1564 </exception>
1565 </member>
1566 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.#ctor(QuickGraph.Concepts.Traversals.IEdgeListGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1567 <summary>
1568 Construct a graph that filters edges
1569 </summary>
1570 <param name="g">graph to filter</param>
1571 <param name="edgePredicate">edge predicate</param>
1572 <param name="vertexPredicate">vertex predicate</param>
1573 <exception cref="T:System.ArgumentNullException">
1574 g or edgePredicate or vertexPredicate is null
1575 </exception>
1576 </member>
1577 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.ContainsEdge(QuickGraph.Concepts.IEdge)">
1578 <summary>
1579 Gets a value indicating if the edge <paramref name="e"/> is part
1580 of the list.
1581 </summary>
1582 <param name="e">edge to test</param>
1583 <returns>true if part of the list, false otherwize</returns>
1584 <exception cref="T:System.ArgumentNullException">e is a null reference</exception>
1585 <remarks>
1586 This method checks wheter a particular edge is part of the set.
1587 <para>
1588 Complexity: O(E).
1589 </para>
1590 </remarks>
1591 </member>
1592 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.EdgeListGraph">
1593 <summary>
1594 Underlying incidence graph
1595 </summary>
1596 </member>
1597 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.EdgesEmpty">
1598 <summary>
1599 Gets a value indicating if the vertex set is empty
1600 </summary>
1601 <remarks>
1602 <para>
1603 Usually faster that calling <see cref="P:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.EdgesCount"/>.
1604 </para>
1605 </remarks>
1606 <value>
1607 true if the vertex set is empty, false otherwise.
1608 </value>
1609 </member>
1610 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.EdgesCount">
1611 <summary>
1612 Returns the number of filtered edges in the graph
1613 </summary>
1614 <returns>number of edges</returns>
1615 </member>
1616 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.Edges">
1617 <summary>
1618 Returns an iterable collection of filtered edges
1619 </summary>
1620 </member>
1621 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListGraph.QuickGraph#Concepts#Traversals#IEdgeListGraph#Edges">
1622 <summary>
1623 </summary>
1624 <returns></returns>
1625 </member>
1626 <member name="T:QuickGraph.Concepts.Traversals.IEdgeListAndIncidenceGraph">
1627 <summary>
1628 Defines the union of EdgeListGraph and IncidenceListGraph.
1629 </summary>
1630 </member>
1631 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.#ctor(QuickGraph.Concepts.Traversals.IEdgeListAndIncidenceGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1632 <summary>
1633 Construct a graph that filters edges and out-edges
1634 </summary>
1635 <param name="g">graph to filter</param>
1636 <param name="edgePredicate">edge predicate</param>
1637 <param name="vertexPredicate"></param>
1638 <exception cref="T:System.ArgumentNullException">
1639 g or edgePredicate is null
1640 </exception>
1641 </member>
1642 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.OutEdgesEmpty(QuickGraph.Concepts.IVertex)">
1643 <summary>
1644 Gets a value indicating if the set of out-edges is empty
1645 </summary>
1646 <remarks>
1647 <para>
1648 Usually faster that calling <see cref="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.OutDegree(QuickGraph.Concepts.IVertex)"/>.
1649 </para>
1650 </remarks>
1651 <value>
1652 true if the out-edge set is empty, false otherwise.
1653 </value>
1654 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1655 </member>
1656 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.OutDegree(QuickGraph.Concepts.IVertex)">
1657 <summary>
1658 Returns the number of out-degree edges of v
1659 </summary>
1660 <param name="v">vertex to test</param>
1661 <returns>out-degree</returns>
1662 </member>
1663 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.OutEdges(QuickGraph.Concepts.IVertex)">
1664 <summary>
1665 Returns an iterable collection of the out edges of v
1666 </summary>
1667 </member>
1668 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.QuickGraph#Concepts#Traversals#IImplicitGraph#OutEdges(QuickGraph.Concepts.IVertex)">
1669 <summary>
1670 Implentens IIncidenceGraph interface.
1671 </summary>
1672 <param name="v"></param>
1673 <returns></returns>
1674 </member>
1675 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.ContainsEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
1676 <summary>
1677 Gets a value indicating if there is an edge between the vertices
1678 <paramref name="u"/>, <paramref name="v"/>.
1679 </summary>
1680 <param name="u">source vertex</param>
1681 <param name="v">target vertex</param>
1682 <returns>true if (<paramref name="u"/>, <paramref name="v"/>) exists.</returns>
1683 <exception cref="T:System.ArgumentNullException">u or v is a null reference</exception>
1684 <remarks>
1685 This method checks wheter an edge exists between the two vertices.
1686 <para>
1687 Complexity: O(E)
1688 </para>
1689 </remarks>
1690 </member>
1691 <member name="M:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.AdjacentVertices(QuickGraph.Concepts.IVertex)">
1692 <summary>
1693 Gets an enumerable collection of the v adjacent vertices
1694 </summary>
1695 <param name="v"></param>
1696 <returns></returns>
1697 </member>
1698 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.EdgeListAndIncidenceGraph">
1699 <summary>
1700 Underlying incidence graph
1701 </summary>
1702 </member>
1703 <member name="P:QuickGraph.Collections.Filtered.FilteredEdgeListAndIncidenceGraph.FilteredIncidenceGraph">
1704 <summary>
1705 Wrapped filtered edge list
1706 </summary>
1707 </member>
1708 <member name="T:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph">
1709 <summary>
1710 A filtered edge list graph
1711 </summary>
1712 <remarks>
1713 </remarks>
1714 </member>
1715 <member name="T:QuickGraph.Collections.Filtered.FilteredVertexListGraph">
1716 <summary>
1717 Summary description for FilteredVertexList.
1718 </summary>
1719 </member>
1720 <member name="T:QuickGraph.Concepts.Traversals.IVertexListGraph">
1721 <summary>
1722 The VertexListGraph concept refines the Graph concept,
1723 and adds the requirement for efficient traversal of all the vertices
1724 in the graph.
1725 </summary>
1726 <remarks>
1727 <para>
1728 One issue in the design of this concept is whether to include the
1729 refinement from the IncidenceGraph
1730 concepts.
1731 </para>
1732 <para>
1733 The ability to traverse the vertices of a graph is orthogonal to
1734 traversing out-edges, so it would make sense to have a VertexListGraph
1735 concept that only includes vertex traversal.
1736 </para>
1737 <para>
1738 However, such a concept would no longer really be a graph,
1739 but would just be a set, and the STL already has concepts for dealing
1740 with such things. However, there are many BGL algorithms that need to
1741 traverse the vertices and out-edges of a graph, so for convenience a
1742 concept is needed that groups these requirements together,
1743 hence the VertexListGraph concept.
1744 </para>
1745 <seealso cref="T:QuickGraph.Concepts.IGraph"/>
1746 <seealso cref="T:QuickGraph.Concepts.Traversals.IIncidenceGraph"/>
1747 </remarks>
1748 </member>
1749 <member name="M:QuickGraph.Concepts.Traversals.IVertexListGraph.ContainsVertex(QuickGraph.Concepts.IVertex)">
1750 <summary>
1751 Gets a value indicating if the vertex <paramref name="v"/> is part
1752 of the list.
1753 </summary>
1754 <param name="v">vertex to test</param>
1755 <returns>true if part of the list, false otherwize</returns>
1756 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1757 <remarks>
1758 This method checks wheter a particular vertex is part of the set.
1759 <para>
1760 Complexity: O(V) at least, possibly in amortized constant time.
1761 </para>
1762 </remarks>
1763 </member>
1764 <member name="P:QuickGraph.Concepts.Traversals.IVertexListGraph.VerticesEmpty">
1765 <summary>
1766 Gets a value indicating if the vertex set is empty
1767 </summary>
1768 <para>
1769 Usually faster (O(1)) that calling <c>VertexCount</c>.
1770 </para>
1771 <value>
1772 true if the vertex set is empty, false otherwise.
1773 </value>
1774 </member>
1775 <member name="P:QuickGraph.Concepts.Traversals.IVertexListGraph.VerticesCount">
1776 <summary>
1777 Gets the number of <see cref="T:QuickGraph.Concepts.IVertex"/> in the graph.
1778 </summary>
1779 <value>
1780 The number of <see cref="T:QuickGraph.Concepts.IVertex"/> in the graph
1781 </value>
1782 </member>
1783 <member name="P:QuickGraph.Concepts.Traversals.IVertexListGraph.Vertices">
1784 <summary>
1785 Gets an iterator-range providing access to all the vertices in
1786 the graph.
1787 </summary>
1788 <value>
1789 <see cref="T:QuickGraph.Concepts.Collections.IVertexEnumerable"/> collection over the
1790 <see cref="T:QuickGraph.Concepts.IVertex"/> instances of the graph.
1791 </value>
1792 </member>
1793 <member name="M:QuickGraph.Collections.Filtered.FilteredVertexListGraph.#ctor(QuickGraph.Concepts.Traversals.IVertexListGraph,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1794 <summary>
1795 Construct a graph that filters in-edges
1796 </summary>
1797 <param name="g">graph to filter</param>
1798 <param name="vertexPredicate">vertex predicate</param>
1799 <exception cref="T:System.ArgumentNullException">
1800 g or vertexPredicate is null
1801 </exception>
1802 </member>
1803 <member name="M:QuickGraph.Collections.Filtered.FilteredVertexListGraph.#ctor(QuickGraph.Concepts.Traversals.IVertexListGraph,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1804 <summary>
1805 Construct a graph that filters in-edges
1806 </summary>
1807 <param name="g">graph to filter</param>
1808 <param name="edgePredicate">edge predicate</param>
1809 <exception cref="T:System.ArgumentNullException">
1810 g or edgePredicate is null
1811 </exception>
1812 </member>
1813 <member name="M:QuickGraph.Collections.Filtered.FilteredVertexListGraph.#ctor(QuickGraph.Concepts.Traversals.IVertexListGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1814 <summary>
1815 Construct a filtered graph with an edge and a vertex predicate.
1816 </summary>
1817 <param name="g">graph to filter</param>
1818 <param name="edgePredicate">edge predicate</param>
1819 <param name="vertexPredicate">vertex predicate</param>
1820 <exception cref="T:System.ArgumentNullException">
1821 g, edgePredicate or vertexPredicate are null
1822 </exception>
1823 </member>
1824 <member name="M:QuickGraph.Collections.Filtered.FilteredVertexListGraph.ContainsVertex(QuickGraph.Concepts.IVertex)">
1825 <summary>
1826 Gets a value indicating if the vertex <paramref name="v"/> is part
1827 of the list.
1828 </summary>
1829 <param name="u">vertex to test</param>
1830 <returns>true if part of the list, false otherwize</returns>
1831 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
1832 <remarks>
1833 This method checks wheter a particular vertex is part of the set.
1834 <para>
1835 Complexity: O(V)
1836 </para>
1837 </remarks>
1838 </member>
1839 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexListGraph.VertexListGraph">
1840 <summary>
1841 Underlying incidence graph
1842 </summary>
1843 </member>
1844 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexListGraph.VerticesEmpty">
1845 <summary>
1846 Gets a value indicating if the vertex set is empty
1847 </summary>
1848 <para>
1849 Usually faster (O(1)) that calling <c>VertexCount</c>.
1850 </para>
1851 <value>
1852 true if the vertex set is empty, false otherwise.
1853 </value>
1854 </member>
1855 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexListGraph.VerticesCount">
1856 <summary>
1857 Gets the filtered vertices count
1858 </summary>
1859 <remarks>
1860 <para>
1861 This method is <c>O(|V|)</c>.
1862 </para>
1863 </remarks>
1864 </member>
1865 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexListGraph.Vertices">
1866 <summary>
1867 Filtered enumerable collection of vertices
1868 </summary>
1869 </member>
1870 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexListGraph.QuickGraph#Concepts#Traversals#IVertexListGraph#Vertices">
1871 <summary>
1872
1873 </summary>
1874 </member>
1875 <member name="T:QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph">
1876 <summary>
1877 Defines the union of VertexListGraph and EdgeListGraph.
1878 </summary>
1879 </member>
1880 <member name="M:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.#ctor(QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph,QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
1881 <summary>
1882 Construct a graph that filters edges and vertices
1883 </summary>
1884 <param name="g">graph to filter</param>
1885 <param name="edgePredicate">edge predicate</param>
1886 <param name="vertexPredicate"></param>
1887 <exception cref="T:System.ArgumentNullException">
1888 g or edgePredicate is null
1889 </exception>
1890 </member>
1891 <member name="M:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.ContainsEdge(QuickGraph.Concepts.IEdge)">
1892 <summary>
1893
1894 </summary>
1895 <param name="e"></param>
1896 <returns></returns>
1897 </member>
1898 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.VertexAndEdgeListGraph">
1899 <summary>
1900 Underlying incidence graph
1901 </summary>
1902 </member>
1903 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.FilteredEdgeList">
1904 <summary>
1905 Wrapped filtered edge list
1906 </summary>
1907 </member>
1908 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.EdgesEmpty">
1909 <summary>
1910 Gets a value indicating if the vertex set is empty
1911 </summary>
1912 <remarks>
1913 <para>
1914 Usually faster that calling <see cref="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.EdgesCount"/>.
1915 </para>
1916 </remarks>
1917 <value>
1918 true if the vertex set is empty, false otherwise.
1919 </value>
1920 </member>
1921 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.EdgesCount">
1922 <summary>
1923 Returns the number of filtered edges in the graph
1924 </summary>
1925 <returns>number of edges</returns>
1926 </member>
1927 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.Edges">
1928 <summary>
1929 Returns an iterable collection of filtered edges
1930 </summary>
1931 </member>
1932 <member name="P:QuickGraph.Collections.Filtered.FilteredVertexAndEdgeListGraph.QuickGraph#Concepts#Traversals#IEdgeListGraph#Edges">
1933 <summary>
1934 </summary>
1935 <returns></returns>
1936 </member>
1937 <member name="T:QuickGraph.Collections.Filtered.NamespaceDoc">
1938 <summary>
1939 <para>
1940 The <b>QuickGraph.Collections.Filtered</b> namespace contains
1941 filtered graph proxies that enables to have filtered views of graph.
1942 </para>
1943 <para>
1944 Each traversal concept/interface is mapped with a corresponding
1945 filtered class.
1946 </para>
1947 </summary>
1948 </member>
1949 <member name="T:QuickGraph.Collections.FilteredEdgeEnumerable">
1950 <summary>
1951 Description résumée de FilteredEdgeCollection.
1952 </summary>
1953 </member>
1954 <member name="M:QuickGraph.Collections.FilteredEdgeEnumerable.#ctor(QuickGraph.Concepts.Collections.IEdgeEnumerable,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1955 <summary>
1956 Filtered edge collection
1957 </summary>
1958 <param name="ec">base collection</param>
1959 <param name="ep">filtering predicate</param>
1960 </member>
1961 <member name="M:QuickGraph.Collections.FilteredEdgeEnumerable.GetEnumerator">
1962 <summary>
1963 Returns the enumerator
1964 </summary>
1965 <returns></returns>
1966 </member>
1967 <member name="M:QuickGraph.Collections.FilteredEdgeEnumerable.QuickGraph#Concepts#Collections#IEdgeEnumerable#GetEnumerator">
1968 <summary>
1969 IEnumerable implementation
1970 </summary>
1971 </member>
1972 <member name="P:QuickGraph.Collections.FilteredEdgeEnumerable.BaseCollection">
1973 <summary>
1974 Base collection
1975 </summary>
1976 </member>
1977 <member name="P:QuickGraph.Collections.FilteredEdgeEnumerable.EdgePredicate">
1978 <summary>
1979 Edge predicate
1980 </summary>
1981 </member>
1982 <member name="T:QuickGraph.Collections.FilteredEdgeEnumerable.Enumerator">
1983 <summary>
1984 Filetred enumerator class
1985 </summary>
1986 </member>
1987 <member name="M:QuickGraph.Collections.FilteredEdgeEnumerable.Enumerator.#ctor(QuickGraph.Concepts.Collections.IEdgeEnumerator,QuickGraph.Concepts.Predicates.IEdgePredicate)">
1988 <summary>
1989
1990 </summary>
1991 <param name="e"></param>
1992 <param name="p"></param>
1993 </member>
1994 <member name="M:QuickGraph.Collections.FilteredEdgeEnumerable.Enumerator.Reset">
1995 <summary>
1996 Positions the cursor before the first element.
1997 </summary>
1998 </member>
1999 <member name="M:QuickGraph.Collections.FilteredEdgeEnumerable.Enumerator.MoveNext">
2000 <summary>
2001 Moves the cursor to the next in-edge.
2002 </summary>
2003 <returns>True if successful, false if the iteration ended.</returns>
2004 </member>
2005 <member name="P:QuickGraph.Collections.FilteredEdgeEnumerable.Enumerator.Current">
2006 <summary>
2007 Current edge
2008 </summary>
2009 </member>
2010 <member name="P:QuickGraph.Collections.FilteredEdgeEnumerable.Enumerator.System#Collections#IEnumerator#Current">
2011 <summary>
2012 IEnumerator implementation
2013 </summary>
2014 </member>
2015 <member name="T:QuickGraph.Collections.FilteredVertexEnumerable">
2016 <summary>
2017 Filtered vertex collectiohn
2018 </summary>
2019 <remarks>
2020 This colleciton is used to do filtered iteration.
2021 </remarks>
2022 </member>
2023 <member name="T:QuickGraph.Concepts.Collections.IVertexEnumerable">
2024 <summary>
2025 Edge enumerable collection
2026 </summary>
2027 </member>
2028 <member name="M:QuickGraph.Concepts.Collections.IVertexEnumerable.GetEnumerator">
2029 <summary>
2030
2031 </summary>
2032 <returns></returns>
2033 </member>
2034 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.#ctor(QuickGraph.Concepts.Collections.IVertexEnumerable,QuickGraph.Concepts.Predicates.IVertexPredicate)">
2035 <summary>
2036 Default constructor
2037 </summary>
2038 <param name="ec">base collection</param>
2039 <param name="ep">predicate</param>
2040 <exception cref="T:System.ArgumentNullException">ec or ep null</exception>
2041 </member>
2042 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.GetEnumerator">
2043 <summary>
2044 Returns a filtered enumerator
2045 </summary>
2046 <returns>enumerator</returns>
2047 </member>
2048 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.System#Collections#IEnumerable#GetEnumerator">
2049 <summary>
2050 IEnumerable implementation
2051 </summary>
2052 </member>
2053 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.QuickGraph#Concepts#Collections#IVertexEnumerable#GetEnumerator">
2054 <summary>
2055 IVertexEnumerable implementation
2056 </summary>
2057 </member>
2058 <member name="P:QuickGraph.Collections.FilteredVertexEnumerable.BaseEnumerable">
2059 <summary>
2060 Base collection
2061 </summary>
2062 </member>
2063 <member name="P:QuickGraph.Collections.FilteredVertexEnumerable.VertexPredicate">
2064 <summary>
2065 Predicate
2066 </summary>
2067 </member>
2068 <member name="T:QuickGraph.Collections.FilteredVertexEnumerable.Enumerator">
2069 <summary>
2070 Filtered enumerator
2071 </summary>
2072 </member>
2073 <member name="T:QuickGraph.Concepts.Collections.IVertexEnumerator">
2074 <summary>
2075 An edge enumerator
2076 </summary>
2077 </member>
2078 <member name="P:QuickGraph.Concepts.Collections.IVertexEnumerator.Current">
2079 <summary>
2080 Current edge
2081 </summary>
2082 </member>
2083 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.Enumerator.#ctor(QuickGraph.Concepts.Collections.IVertexEnumerator,QuickGraph.Concepts.Predicates.IVertexPredicate)">
2084 <summary>
2085 Constructor
2086 </summary>
2087 <param name="e">Base enumerator</param>
2088 <param name="p">predicate</param>
2089 </member>
2090 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.Enumerator.Reset">
2091 <summary>
2092 Positions the cursor before the first element.
2093 </summary>
2094 </member>
2095 <member name="M:QuickGraph.Collections.FilteredVertexEnumerable.Enumerator.MoveNext">
2096 <summary>
2097 Moves the cursor to the next Vertex.
2098 </summary>
2099 <returns>True if successful, false if the iteration ended.</returns>
2100 </member>
2101 <member name="P:QuickGraph.Collections.FilteredVertexEnumerable.Enumerator.Current">
2102 <summary>
2103 Current Vertex
2104 </summary>
2105 </member>
2106 <member name="P:QuickGraph.Collections.FilteredVertexEnumerable.Enumerator.System#Collections#IEnumerator#Current">
2107 <summary>
2108 IEnumerator implementation
2109 </summary>
2110 </member>
2111 <member name="T:QuickGraph.Collections.NamespaceDoc">
2112 <summary>
2113 <para>
2114 The <b>QuickGraph.Collections</b> namespace contains a bunch of
2115 strongly typed collections and dictionaries.
2116 </para>
2117 </summary>
2118 </member>
2119 <member name="T:QuickGraph.Collections.PriorithizedVertexBuffer">
2120 <summary>
2121 A Priorithized (with respect to distance) vertex buffer.
2122 </summary>
2123 </member>
2124 <member name="T:QuickGraph.Collections.VertexBuffer">
2125 <summary>
2126 A vertex buffer that acts like a stack.
2127 </summary>
2128 </member>
2129 <member name="M:QuickGraph.Collections.VertexBuffer.#ctor">
2130 <summary>
2131 Constructs an empty buffer
2132 </summary>
2133 </member>
2134 <member name="M:QuickGraph.Collections.VertexBuffer.Peek">
2135 <summary>
2136 Returns the latest vertex in the buffer. Leaves it in the buffer.
2137 </summary>
2138 <returns>Latest vertex</returns>
2139 </member>
2140 <member name="M:QuickGraph.Collections.VertexBuffer.Push(QuickGraph.Concepts.IVertex)">
2141 <summary>
2142 Pushes a new vertex at the end of the buffer:
2143 </summary>
2144 <param name="v">Vertex to push</param>
2145 </member>
2146 <member name="M:QuickGraph.Collections.VertexBuffer.Pop">
2147 <summary>
2148 Removes the latest vertex.
2149 </summary>
2150 </member>
2151 <member name="M:QuickGraph.Collections.VertexBuffer.Sort(System.Collections.IComparer)">
2152 <summary>
2153 Sorts the buffer using the comparer
2154 </summary>
2155 <param name="comparer">Comparer used to sort the buffer</param>
2156 </member>
2157 <member name="M:QuickGraph.Collections.VertexBuffer.GetEnumerator">
2158 <summary>
2159 Returns an enumerator over the buffer
2160 </summary>
2161 <returns>Buffer enumerator</returns>
2162 </member>
2163 <member name="P:QuickGraph.Collections.VertexBuffer.Count">
2164 <summary>
2165 The number of vertices in the buffer
2166 </summary>
2167 </member>
2168 <member name="M:QuickGraph.Collections.PriorithizedVertexBuffer.#ctor(QuickGraph.Collections.VertexDoubleDictionary)">
2169 <summary>
2170 Builds a priorithzied vertex buffer and fills a vertex distance map.
2171 </summary>
2172 <param name="distances">vertex distance map</param>
2173 </member>
2174 <member name="M:QuickGraph.Collections.PriorithizedVertexBuffer.Update(QuickGraph.Concepts.IVertex)">
2175 <summary>
2176 Updates the buffer order
2177 </summary>
2178 <param name="v">modified vertex</param>
2179 </member>
2180 <member name="M:QuickGraph.Collections.PriorithizedVertexBuffer.Push(QuickGraph.Concepts.IVertex)">
2181 <summary>
2182 Push a new vertex on the buffer.
2183 </summary>
2184 <param name="v">new vertex</param>
2185 </member>
2186 <member name="T:QuickGraph.Collections.ReversedEdge">
2187 <summary>
2188 Summary description for ReversedEdge.
2189 </summary>
2190 </member>
2191 <member name="T:QuickGraph.Concepts.IEdge">
2192 <summary>
2193 Edge interface
2194 </summary>
2195 </member>
2196 <member name="P:QuickGraph.Concepts.IEdge.ID">
2197 <summary>
2198 Edge identification number
2199 </summary>
2200 </member>
2201 <member name="P:QuickGraph.Concepts.IEdge.Source">
2202 <summary>
2203 Source vertex
2204 </summary>
2205 </member>
2206 <member name="P:QuickGraph.Concepts.IEdge.Target">
2207 <summary>
2208 Target vertex
2209 </summary>
2210 </member>
2211 <member name="M:QuickGraph.Collections.ReversedEdge.op_Equality(QuickGraph.Collections.ReversedEdge,QuickGraph.Collections.ReversedEdge)">
2212 <summary>
2213 Defines the == operator
2214 </summary>
2215 <param name="e1"></param>
2216 <param name="e2"></param>
2217 <returns></returns>
2218 </member>
2219 <member name="M:QuickGraph.Collections.ReversedEdge.op_Inequality(QuickGraph.Collections.ReversedEdge,QuickGraph.Collections.ReversedEdge)">
2220 <summary>
2221
2222 </summary>
2223 <param name="e1"></param>
2224 <param name="e2"></param>
2225 <returns></returns>
2226 </member>
2227 <member name="M:QuickGraph.Collections.ReversedEdge.Equals(System.Object)">
2228 <summary>
2229
2230 </summary>
2231 <param name="obj"></param>
2232 <returns></returns>
2233 </member>
2234 <member name="T:QuickGraph.Collections.ReversedEdgeEnumerable">
2235 <summary>
2236 Summary description for ReversedEdgeEnumerable.
2237 </summary>
2238 </member>
2239 <member name="T:QuickGraph.Collections.ReversedEdgeEnumerator">
2240 <summary>
2241 Summary description for ReversedEdgeEnumerator.
2242 </summary>
2243 </member>
2244 <member name="T:QuickGraph.Collections.Sort.ComparableComparer">
2245 <summary>
2246 Default <see cref="T:System.IComparable"/> object comparer.
2247 </summary>
2248 </member>
2249 <member name="M:QuickGraph.Collections.Sort.ComparableComparer.Compare(System.IComparable,System.Object)">
2250 <summary>
2251
2252 </summary>
2253 <param name="x"></param>
2254 <param name="y"></param>
2255 <returns></returns>
2256 </member>
2257 <member name="T:QuickGraph.Collections.Sort.DefaultSwap">
2258 <summary>
2259 Default swap class
2260 </summary>
2261 </member>
2262 <member name="T:QuickGraph.Collections.Sort.ISwap">
2263 <summary>
2264 Object swapper interface
2265 </summary>
2266 </member>
2267 <member name="M:QuickGraph.Collections.Sort.ISwap.Swap(System.Collections.IList,System.Int32,System.Int32)">
2268 <summary>
2269 Swaps left and right in the list
2270 </summary>
2271 <param name="array"></param>
2272 <param name="left"></param>
2273 <param name="right"></param>
2274 </member>
2275 <member name="M:QuickGraph.Collections.Sort.DefaultSwap.Swap(System.Collections.IList,System.Int32,System.Int32)">
2276 <summary>
2277 Default swap operation
2278 </summary>
2279 <param name="array"></param>
2280 <param name="left"></param>
2281 <param name="right"></param>
2282 </member>
2283 <member name="T:QuickGraph.Collections.Sort.ISorter">
2284 <summary>
2285 Summary description for ISorter.
2286 </summary>
2287 </member>
2288 <member name="M:QuickGraph.Collections.Sort.ISorter.Sort(System.Collections.IList)">
2289 <summary>
2290 Sorts the <paramref name="list"/>.
2291 </summary>
2292 <param name="list"></param>
2293 </member>
2294 <member name="T:QuickGraph.Collections.Sort.QuickSorter">
2295 <summary>
2296 http://www.codeproject.com/csharp/csquicksort.asp
2297 </summary>
2298 </member>
2299 <member name="T:QuickGraph.Collections.Sort.SwapSorter">
2300 <summary>
2301 Abstract base class for Swap sort algorithms.
2302 </summary>
2303 <remarks>
2304 <para>
2305 This class serves as a base class for swap based sort algorithms.
2306 </para>
2307 </remarks>
2308 </member>
2309 <member name="M:QuickGraph.Collections.Sort.SwapSorter.#ctor">
2310 <summary>
2311
2312 </summary>
2313 </member>
2314 <member name="M:QuickGraph.Collections.Sort.SwapSorter.#ctor(System.Collections.IComparer,QuickGraph.Collections.Sort.ISwap)">
2315 <summary>
2316
2317 </summary>
2318 <param name="comparer"></param>
2319 <param name="swapper"></param>
2320 </member>
2321 <member name="M:QuickGraph.Collections.Sort.SwapSorter.Sort(System.Collections.IList)">
2322 <summary>
2323
2324 </summary>
2325 <param name="list"></param>
2326 </member>
2327 <member name="P:QuickGraph.Collections.Sort.SwapSorter.Comparer">
2328 <summary>
2329 Gets or sets the <see cref="T:System.Collections.IComparer"/> object
2330 </summary>
2331 <value>
2332 Comparer object
2333 </value>
2334 <exception cref="T:System.ArgumentNullException">
2335 Set property, the value is a null reference
2336 </exception>
2337 </member>
2338 <member name="P:QuickGraph.Collections.Sort.SwapSorter.Swapper">
2339 <summary>
2340 Gets or set the swapper object
2341 </summary>
2342 <value>
2343 The <see cref="T:QuickGraph.Collections.Sort.ISwap"/> swapper.
2344 </value>
2345 <exception cref="T:System.ArgumentNullException">Swapper is a null reference</exception>
2346 </member>
2347 <member name="M:QuickGraph.Collections.Sort.QuickSorter.#ctor">
2348 <summary>
2349
2350 </summary>
2351 </member>
2352 <member name="M:QuickGraph.Collections.Sort.QuickSorter.#ctor(System.Collections.IComparer,QuickGraph.Collections.Sort.ISwap)">
2353 <summary>
2354
2355 </summary>
2356 <param name="comparer"></param>
2357 <param name="swapper"></param>
2358 </member>
2359 <member name="M:QuickGraph.Collections.Sort.QuickSorter.Sort(System.Collections.IList)">
2360 <summary>
2361 Sorts the array.
2362 </summary>
2363 <param name="array">The array to sort.</param>
2364 </member>
2365 <member name="M:QuickGraph.Collections.Sort.QuickSorter.Sort(System.Collections.IList,System.Int32,System.Int32)">
2366 <summary>
2367
2368 </summary>
2369 <param name="array"></param>
2370 <param name="lower"></param>
2371 <param name="upper"></param>
2372 </member>
2373 <member name="T:QuickGraph.Collections.StringEdgeDictionary">
2374 <summary>
2375 A dictionary with keys of type String and values of type IEdge
2376 </summary>
2377 </member>
2378 <member name="M:QuickGraph.Collections.StringEdgeDictionary.#ctor">
2379 <summary>
2380 Initializes a new empty instance of the StringEdgeDictionary class
2381 </summary>
2382 </member>
2383 <member name="M:QuickGraph.Collections.StringEdgeDictionary.Add(System.String,QuickGraph.Concepts.IEdge)">
2384 <summary>
2385 Adds an element with the specified key and value to this StringEdgeDictionary.
2386 </summary>
2387 <param name="key">
2388 The String key of the element to add.
2389 </param>
2390 <param name="value">
2391 The IEdge value of the element to add.
2392 </param>
2393 </member>
2394 <member name="M:QuickGraph.Collections.StringEdgeDictionary.Contains(System.String)">
2395 <summary>
2396 Determines whether this StringEdgeDictionary contains a specific key.
2397 </summary>
2398 <param name="key">
2399 The String key to locate in this StringEdgeDictionary.
2400 </param>
2401 <returns>
2402 true if this StringEdgeDictionary contains an element with the specified key;
2403 otherwise, false.
2404 </returns>
2405 </member>
2406 <member name="M:QuickGraph.Collections.StringEdgeDictionary.ContainsKey(System.String)">
2407 <summary>
2408 Determines whether this StringEdgeDictionary contains a specific key.
2409 </summary>
2410 <param name="key">
2411 The String key to locate in this StringEdgeDictionary.
2412 </param>
2413 <returns>
2414 true if this StringEdgeDictionary contains an element with the specified key;
2415 otherwise, false.
2416 </returns>
2417 </member>
2418 <member name="M:QuickGraph.Collections.StringEdgeDictionary.ContainsValue(QuickGraph.Concepts.IEdge)">
2419 <summary>
2420 Determines whether this StringEdgeDictionary contains a specific value.
2421 </summary>
2422 <param name="value">
2423 The IEdge value to locate in this StringEdgeDictionary.
2424 </param>
2425 <returns>
2426 true if this StringEdgeDictionary contains an element with the specified value;
2427 otherwise, false.
2428 </returns>
2429 </member>
2430 <member name="M:QuickGraph.Collections.StringEdgeDictionary.Remove(System.String)">
2431 <summary>
2432 Removes the element with the specified key from this StringEdgeDictionary.
2433 </summary>
2434 <param name="key">
2435 The String key of the element to remove.
2436 </param>
2437 </member>
2438 <member name="P:QuickGraph.Collections.StringEdgeDictionary.Item(System.String)">
2439 <summary>
2440 Gets or sets the IEdge associated with the given String
2441 </summary>
2442 <param name="key">
2443 The String whose value to get or set.
2444 </param>
2445 </member>
2446 <member name="P:QuickGraph.Collections.StringEdgeDictionary.Keys">
2447 <summary>
2448 Gets a collection containing the keys in this StringEdgeDictionary.
2449 </summary>
2450 </member>
2451 <member name="P:QuickGraph.Collections.StringEdgeDictionary.Values">
2452 <summary>
2453 Gets a collection containing the values in this StringEdgeDictionary.
2454 </summary>
2455 </member>
2456 <member name="T:QuickGraph.Collections.StringVertexDictionary">
2457 <summary>
2458 A dictionary with keys of type String and values of type IVertex
2459 </summary>
2460 </member>
2461 <member name="M:QuickGraph.Collections.StringVertexDictionary.#ctor">
2462 <summary>
2463 Initializes a new empty instance of the StringVertexDictionary class
2464 </summary>
2465 </member>
2466 <member name="M:QuickGraph.Collections.StringVertexDictionary.Add(System.String,QuickGraph.Concepts.IVertex)">
2467 <summary>
2468 Adds an element with the specified key and value to this StringVertexDictionary.
2469 </summary>
2470 <param name="key">
2471 The String key of the element to add.
2472 </param>
2473 <param name="value">
2474 The IVertex value of the element to add.
2475 </param>
2476 </member>
2477 <member name="M:QuickGraph.Collections.StringVertexDictionary.Contains(System.String)">
2478 <summary>
2479 Determines whether this StringVertexDictionary contains a specific key.
2480 </summary>
2481 <param name="key">
2482 The String key to locate in this StringVertexDictionary.
2483 </param>
2484 <returns>
2485 true if this StringVertexDictionary contains an element with the specified key;
2486 otherwise, false.
2487 </returns>
2488 </member>
2489 <member name="M:QuickGraph.Collections.StringVertexDictionary.ContainsKey(System.String)">
2490 <summary>
2491 Determines whether this StringVertexDictionary contains a specific key.
2492 </summary>
2493 <param name="key">
2494 The String key to locate in this StringVertexDictionary.
2495 </param>
2496 <returns>
2497 true if this StringVertexDictionary contains an element with the specified key;
2498 otherwise, false.
2499 </returns>
2500 </member>
2501 <member name="M:QuickGraph.Collections.StringVertexDictionary.ContainsValue(QuickGraph.Concepts.IVertex)">
2502 <summary>
2503 Determines whether this StringVertexDictionary contains a specific value.
2504 </summary>
2505 <param name="value">
2506 The IVertex value to locate in this StringVertexDictionary.
2507 </param>
2508 <returns>
2509 true if this StringVertexDictionary contains an element with the specified value;
2510 otherwise, false.
2511 </returns>
2512 </member>
2513 <member name="M:QuickGraph.Collections.StringVertexDictionary.Remove(System.String)">
2514 <summary>
2515 Removes the element with the specified key from this StringVertexDictionary.
2516 </summary>
2517 <param name="key">
2518 The String key of the element to remove.
2519 </param>
2520 </member>
2521 <member name="P:QuickGraph.Collections.StringVertexDictionary.Item(System.String)">
2522 <summary>
2523 Gets or sets the IVertex associated with the given String
2524 </summary>
2525 <param name="key">
2526 The String whose value to get or set.
2527 </param>
2528 </member>
2529 <member name="P:QuickGraph.Collections.StringVertexDictionary.Keys">
2530 <summary>
2531 Gets a collection containing the keys in this StringVertexDictionary.
2532 </summary>
2533 </member>
2534 <member name="P:QuickGraph.Collections.StringVertexDictionary.Values">
2535 <summary>
2536 Gets a collection containing the values in this StringVertexDictionary.
2537 </summary>
2538 </member>
2539 <member name="T:QuickGraph.Collections.TargetVertexEnumerator">
2540 <summary>
2541 Summary description for AdjacentVertexEnumerator.
2542 </summary>
2543 </member>
2544 <member name="T:QuickGraph.Collections.Vector2D">
2545 <summary>
2546 Summary description for Vector2D.
2547 </summary>
2548 </member>
2549 <member name="T:QuickGraph.Collections.VertexCollection">
2550 <summary>
2551 A collection of elements of type Vertex
2552 </summary>
2553 </member>
2554 <member name="T:QuickGraph.Concepts.Collections.IVertexCollection">
2555 <summary>
2556 A vertex enumerable collection
2557 </summary>
2558 </member>
2559 <member name="M:QuickGraph.Collections.VertexCollection.#ctor">
2560 <summary>
2561 Initializes a new empty instance of the VertexCollection class.
2562 </summary>
2563 </member>
2564 <member name="M:QuickGraph.Collections.VertexCollection.#ctor(QuickGraph.Concepts.IVertex[])">
2565 <summary>
2566 Initializes a new instance of the VertexCollection class, containing elements
2567 copied from an array.
2568 </summary>
2569 <param name="items">
2570 The array whose elements are to be added to the new VertexCollection.
2571 </param>
2572 </member>
2573 <member name="M:QuickGraph.Collections.VertexCollection.#ctor(QuickGraph.Concepts.Collections.IVertexEnumerable)">
2574 <summary>
2575 Initializes a new instance of the <see cref="T:QuickGraph.Concepts.Collections.IVertexEnumerable"/>
2576 interface, containing elements
2577 copied from another instance of VertexCollection
2578 </summary>
2579 <param name="items">
2580 The <see cref="T:QuickGraph.Concepts.Collections.IVertexEnumerable"/> whose elements are to be added to the new VertexCollection.
2581 </param>
2582 </member>
2583 <member name="M:QuickGraph.Collections.VertexCollection.AddRange(QuickGraph.Concepts.IVertex[])">
2584 <summary>
2585 Adds the elements of an array to the end of this VertexCollection.
2586 </summary>
2587 <param name="items">
2588 The array whose elements are to be added to the end of this VertexCollection.
2589 </param>
2590 </member>
2591 <member name="M:QuickGraph.Collections.VertexCollection.AddRange(QuickGraph.Concepts.Collections.IVertexEnumerable)">
2592 <summary>
2593 Adds the elements of another <see cref="T:QuickGraph.Concepts.Collections.IVertexEnumerable"/>
2594 to the end of this VertexCollection.
2595 </summary>
2596 <param name="items">
2597 The <see cref="T:QuickGraph.Concepts.Collections.IVertexEnumerable"/> whose elements are to
2598 be added to the end of this VertexCollection.
2599 </param>
2600 </member>
2601 <member name="M:QuickGraph.Collections.VertexCollection.Add(QuickGraph.Concepts.IVertex)">
2602 <summary>
2603 Adds an instance of type Vertex to the end of this VertexCollection.
2604 </summary>
2605 <param name="value">
2606 The Vertex to be added to the end of this VertexCollection.
2607 </param>
2608 </member>
2609 <member name="M:QuickGraph.Collections.VertexCollection.Contains(QuickGraph.Concepts.IVertex)">
2610 <summary>
2611 Determines whether a specfic Vertex value is in this VertexCollection.
2612 </summary>
2613 <param name="value">
2614 The Vertex value to locate in this VertexCollection.
2615 </param>
2616 <returns>
2617 true if value is found in this VertexCollection;
2618 false otherwise.
2619 </returns>
2620 </member>
2621 <member name="M:QuickGraph.Collections.VertexCollection.IndexOf(QuickGraph.Concepts.IVertex)">
2622 <summary>
2623 Return the zero-based index of the first occurrence of a specific value
2624 in this VertexCollection
2625 </summary>
2626 <param name="value">
2627 The Vertex value to locate in the VertexCollection.
2628 </param>
2629 <returns>
2630 The zero-based index of the first occurrence of the _ELEMENT value if found;
2631 -1 otherwise.
2632 </returns>
2633 </member>
2634 <member name="M:QuickGraph.Collections.VertexCollection.Insert(System.Int32,QuickGraph.Concepts.IVertex)">
2635 <summary>
2636 Inserts an element into the VertexCollection at the specified index
2637 </summary>
2638 <param name="index">
2639 The index at which the Vertex is to be inserted.
2640 </param>
2641 <param name="value">
2642 The Vertex to insert.
2643 </param>
2644 </member>
2645 <member name="M:QuickGraph.Collections.VertexCollection.GetEnumerator">
2646 <summary>
2647 Returns an enumerator that can iterate through the elements of this VertexCollection.
2648 </summary>
2649 <returns>
2650 An object that implements System.Collections.IEnumerator.
2651 </returns>
2652 </member>
2653 <member name="M:QuickGraph.Collections.VertexCollection.Remove(QuickGraph.Concepts.IVertex)">
2654 <summary>
2655 Removes the first occurrence of a specific Vertex from this VertexCollection.
2656 </summary>
2657 <param name="value">
2658 The Vertex value to remove from this VertexCollection.
2659 </param>
2660 </member>
2661 <member name="P:QuickGraph.Collections.VertexCollection.Item(System.Int32)">
2662 <summary>
2663 Gets or sets the Vertex at the given index in this VertexCollection.
2664 </summary>
2665 </member>
2666 <member name="T:QuickGraph.Collections.VertexCollection.Enumerator">
2667 <summary>
2668 Type-specific enumeration class, used by VertexCollection.GetEnumerator.
2669 </summary>
2670 </member>
2671 <member name="M:QuickGraph.Collections.VertexCollection.Enumerator.#ctor(QuickGraph.Collections.VertexCollection)">
2672 <summary>
2673 Builds a enumerator on the collection
2674 </summary>
2675 <param name="collection"></param>
2676 </member>
2677 <member name="M:QuickGraph.Collections.VertexCollection.Enumerator.MoveNext">
2678 <summary>
2679
2680 </summary>
2681 <returns></returns>
2682 </member>
2683 <member name="M:QuickGraph.Collections.VertexCollection.Enumerator.Reset">
2684 <summary>
2685
2686 </summary>
2687 </member>
2688 <member name="P:QuickGraph.Collections.VertexCollection.Enumerator.Current">
2689 <summary>
2690 Current vertex
2691 </summary>
2692 </member>
2693 <member name="P:QuickGraph.Collections.VertexCollection.Enumerator.System#Collections#IEnumerator#Current">
2694 <summary>
2695
2696 </summary>
2697 </member>
2698 <member name="T:QuickGraph.Collections.VertexColorDictionary">
2699 <summary>
2700 A dictionary with keys of type Vertex and values of type GraphColor
2701 </summary>
2702 </member>
2703 <member name="M:QuickGraph.Collections.VertexColorDictionary.#ctor">
2704 <summary>
2705 Initializes a new empty instance of the VertexColorDictionary class
2706 </summary>
2707 </member>
2708 <member name="M:QuickGraph.Collections.VertexColorDictionary.Add(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.GraphColor)">
2709 <summary>
2710 Adds an element with the specified key and value to this VertexColorDictionary.
2711 </summary>
2712 <param name="key">
2713 The Vertex key of the element to add.
2714 </param>
2715 <param name="value">
2716 The GraphColor value of the element to add.
2717 </param>
2718 </member>
2719 <member name="M:QuickGraph.Collections.VertexColorDictionary.Contains(QuickGraph.Concepts.IVertex)">
2720 <summary>
2721 Determines whether this VertexColorDictionary contains a specific key.
2722 </summary>
2723 <param name="key">
2724 The Vertex key to locate in this VertexColorDictionary.
2725 </param>
2726 <returns>
2727 true if this VertexColorDictionary contains an element with the specified key;
2728 otherwise, false.
2729 </returns>
2730 </member>
2731 <member name="M:QuickGraph.Collections.VertexColorDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
2732 <summary>
2733 Determines whether this VertexColorDictionary contains a specific key.
2734 </summary>
2735 <param name="key">
2736 The Vertex key to locate in this VertexColorDictionary.
2737 </param>
2738 <returns>
2739 true if this VertexColorDictionary contains an element with the specified key;
2740 otherwise, false.
2741 </returns>
2742 </member>
2743 <member name="M:QuickGraph.Collections.VertexColorDictionary.ContainsValue(QuickGraph.Concepts.GraphColor)">
2744 <summary>
2745 Determines whether this VertexColorDictionary contains a specific value.
2746 </summary>
2747 <param name="value">
2748 The GraphColor value to locate in this VertexColorDictionary.
2749 </param>
2750 <returns>
2751 true if this VertexColorDictionary contains an element with the specified value;
2752 otherwise, false.
2753 </returns>
2754 </member>
2755 <member name="M:QuickGraph.Collections.VertexColorDictionary.Remove(QuickGraph.Concepts.IVertex)">
2756 <summary>
2757 Removes the element with the specified key from this VertexColorDictionary.
2758 </summary>
2759 <param name="key">
2760 The Vertex key of the element to remove.
2761 </param>
2762 </member>
2763 <member name="P:QuickGraph.Collections.VertexColorDictionary.Item(QuickGraph.Concepts.IVertex)">
2764 <summary>
2765 Gets or sets the GraphColor associated with the given Vertex
2766 </summary>
2767 <param name="key">
2768 The Vertex whose value to get or set.
2769 </param>
2770 </member>
2771 <member name="P:QuickGraph.Collections.VertexColorDictionary.Keys">
2772 <summary>
2773 Gets a collection containing the keys in this VertexColorDictionary.
2774 </summary>
2775 </member>
2776 <member name="P:QuickGraph.Collections.VertexColorDictionary.Values">
2777 <summary>
2778 Gets a collection containing the values in this VertexColorDictionary.
2779 </summary>
2780 </member>
2781 <member name="T:QuickGraph.Collections.VertexDoubleDictionary">
2782 <summary>
2783 A dictionary with keys of type Vertex and values of type Double
2784 </summary>
2785 </member>
2786 <member name="M:QuickGraph.Collections.VertexDoubleDictionary.#ctor">
2787 <summary>
2788 Initializes a new empty instance of the VertexDistanceDictionary class
2789 </summary>
2790 </member>
2791 <member name="M:QuickGraph.Collections.VertexDoubleDictionary.Add(QuickGraph.Concepts.IVertex,System.Double)">
2792 <summary>
2793 Adds an element with the specified key and value to this VertexDistanceDictionary.
2794 </summary>
2795 <param name="key">
2796 The Vertex key of the element to add.
2797 </param>
2798 <param name="value">
2799 The Double value of the element to add.
2800 </param>
2801 </member>
2802 <member name="M:QuickGraph.Collections.VertexDoubleDictionary.Contains(QuickGraph.Concepts.IVertex)">
2803 <summary>
2804 Determines whether this VertexDistanceDictionary contains a specific key.
2805 </summary>
2806 <param name="key">
2807 The Vertex key to locate in this VertexDistanceDictionary.
2808 </param>
2809 <returns>
2810 true if this VertexDistanceDictionary contains an element with the specified key;
2811 otherwise, false.
2812 </returns>
2813 </member>
2814 <member name="M:QuickGraph.Collections.VertexDoubleDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
2815 <summary>
2816 Determines whether this VertexDistanceDictionary contains a specific key.
2817 </summary>
2818 <param name="key">
2819 The Vertex key to locate in this VertexDistanceDictionary.
2820 </param>
2821 <returns>
2822 true if this VertexDistanceDictionary contains an element with the specified key;
2823 otherwise, false.
2824 </returns>
2825 </member>
2826 <member name="M:QuickGraph.Collections.VertexDoubleDictionary.ContainsValue(System.Double)">
2827 <summary>
2828 Determines whether this VertexDistanceDictionary contains a specific value.
2829 </summary>
2830 <param name="value">
2831 The Double value to locate in this VertexDistanceDictionary.
2832 </param>
2833 <returns>
2834 true if this VertexDistanceDictionary contains an element with the specified value;
2835 otherwise, false.
2836 </returns>
2837 </member>
2838 <member name="M:QuickGraph.Collections.VertexDoubleDictionary.Remove(QuickGraph.Concepts.IVertex)">
2839 <summary>
2840 Removes the element with the specified key from this VertexDistanceDictionary.
2841 </summary>
2842 <param name="key">
2843 The Vertex key of the element to remove.
2844 </param>
2845 </member>
2846 <member name="P:QuickGraph.Collections.VertexDoubleDictionary.Item(QuickGraph.Concepts.IVertex)">
2847 <summary>
2848 Gets or sets the Double associated with the given Vertex
2849 </summary>
2850 <param name="key">
2851 The Vertex whose value to get or set.
2852 </param>
2853 </member>
2854 <member name="P:QuickGraph.Collections.VertexDoubleDictionary.Keys">
2855 <summary>
2856 Gets a collection containing the keys in this VertexDistanceDictionary.
2857 </summary>
2858 </member>
2859 <member name="P:QuickGraph.Collections.VertexDoubleDictionary.Values">
2860 <summary>
2861 Gets a collection containing the values in this VertexDistanceDictionary.
2862 </summary>
2863 </member>
2864 <member name="T:QuickGraph.Collections.VertexDoublesDictionary">
2865 <summary>
2866 A dictionary with keys of type IVertex and values of type DoubleCollection
2867 </summary>
2868 </member>
2869 <member name="M:QuickGraph.Collections.VertexDoublesDictionary.#ctor">
2870 <summary>
2871 Initializes a new empty instance of the VertexDoublesDictionary class
2872 </summary>
2873 </member>
2874 <member name="M:QuickGraph.Collections.VertexDoublesDictionary.Add(QuickGraph.Concepts.IVertex,QuickGraph.Collections.DoubleCollection)">
2875 <summary>
2876 Adds an element with the specified key and value to this VertexDoublesDictionary.
2877 </summary>
2878 <param name="key">
2879 The IVertex key of the element to add.
2880 </param>
2881 <param name="value">
2882 The DoubleCollection value of the element to add.
2883 </param>
2884 </member>
2885 <member name="M:QuickGraph.Collections.VertexDoublesDictionary.Contains(QuickGraph.Concepts.IVertex)">
2886 <summary>
2887 Determines whether this VertexDoublesDictionary contains a specific key.
2888 </summary>
2889 <param name="key">
2890 The IVertex key to locate in this VertexDoublesDictionary.
2891 </param>
2892 <returns>
2893 true if this VertexDoublesDictionary contains an element with the specified key;
2894 otherwise, false.
2895 </returns>
2896 </member>
2897 <member name="M:QuickGraph.Collections.VertexDoublesDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
2898 <summary>
2899 Determines whether this VertexDoublesDictionary contains a specific key.
2900 </summary>
2901 <param name="key">
2902 The IVertex key to locate in this VertexDoublesDictionary.
2903 </param>
2904 <returns>
2905 true if this VertexDoublesDictionary contains an element with the specified key;
2906 otherwise, false.
2907 </returns>
2908 </member>
2909 <member name="M:QuickGraph.Collections.VertexDoublesDictionary.ContainsValue(QuickGraph.Collections.DoubleCollection)">
2910 <summary>
2911 Determines whether this VertexDoublesDictionary contains a specific value.
2912 </summary>
2913 <param name="value">
2914 The DoubleCollection value to locate in this VertexDoublesDictionary.
2915 </param>
2916 <returns>
2917 true if this VertexDoublesDictionary contains an element with the specified value;
2918 otherwise, false.
2919 </returns>
2920 </member>
2921 <member name="M:QuickGraph.Collections.VertexDoublesDictionary.Remove(QuickGraph.Concepts.IVertex)">
2922 <summary>
2923 Removes the element with the specified key from this VertexDoublesDictionary.
2924 </summary>
2925 <param name="key">
2926 The IVertex key of the element to remove.
2927 </param>
2928 </member>
2929 <member name="P:QuickGraph.Collections.VertexDoublesDictionary.Item(QuickGraph.Concepts.IVertex)">
2930 <summary>
2931 Gets or sets the DoubleCollection associated with the given IVertex
2932 </summary>
2933 <param name="key">
2934 The IVertex whose value to get or set.
2935 </param>
2936 </member>
2937 <member name="P:QuickGraph.Collections.VertexDoublesDictionary.Keys">
2938 <summary>
2939 Gets a collection containing the keys in this VertexDoublesDictionary.
2940 </summary>
2941 </member>
2942 <member name="P:QuickGraph.Collections.VertexDoublesDictionary.Values">
2943 <summary>
2944 Gets a collection containing the values in this VertexDoublesDictionary.
2945 </summary>
2946 </member>
2947 <member name="T:QuickGraph.Collections.VertexEdgeDictionary">
2948 <summary>
2949 A dictionary with keys of type Vertex and values of type Edge
2950 </summary>
2951 </member>
2952 <member name="M:QuickGraph.Collections.VertexEdgeDictionary.#ctor">
2953 <summary>
2954 Initializes a new empty instance of the VertexEdgeDictionary class
2955 </summary>
2956 </member>
2957 <member name="M:QuickGraph.Collections.VertexEdgeDictionary.Add(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IEdge)">
2958 <summary>
2959 Adds an element with the specified key and value to this VertexEdgeDictionary.
2960 </summary>
2961 <param name="key">
2962 The Vertex key of the element to add.
2963 </param>
2964 <param name="value">
2965 The Edge value of the element to add.
2966 </param>
2967 </member>
2968 <member name="M:QuickGraph.Collections.VertexEdgeDictionary.Contains(QuickGraph.Concepts.IVertex)">
2969 <summary>
2970 Determines whether this VertexEdgeDictionary contains a specific key.
2971 </summary>
2972 <param name="key">
2973 The Vertex key to locate in this VertexEdgeDictionary.
2974 </param>
2975 <returns>
2976 true if this VertexEdgeDictionary contains an element with the specified key;
2977 otherwise, false.
2978 </returns>
2979 </member>
2980 <member name="M:QuickGraph.Collections.VertexEdgeDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
2981 <summary>
2982 Determines whether this VertexEdgeDictionary contains a specific key.
2983 </summary>
2984 <param name="key">
2985 The Vertex key to locate in this VertexEdgeDictionary.
2986 </param>
2987 <returns>
2988 true if this VertexEdgeDictionary contains an element with the specified key;
2989 otherwise, false.
2990 </returns>
2991 </member>
2992 <member name="M:QuickGraph.Collections.VertexEdgeDictionary.ContainsValue(QuickGraph.Concepts.IEdge)">
2993 <summary>
2994 Determines whether this VertexEdgeDictionary contains a specific value.
2995 </summary>
2996 <param name="value">
2997 The Edge value to locate in this VertexEdgeDictionary.
2998 </param>
2999 <returns>
3000 true if this VertexEdgeDictionary contains an element with the specified value;
3001 otherwise, false.
3002 </returns>
3003 </member>
3004 <member name="M:QuickGraph.Collections.VertexEdgeDictionary.Remove(QuickGraph.Concepts.IVertex)">
3005 <summary>
3006 Removes the element with the specified key from this VertexEdgeDictionary.
3007 </summary>
3008 <param name="key">
3009 The Vertex key of the element to remove.
3010 </param>
3011 </member>
3012 <member name="P:QuickGraph.Collections.VertexEdgeDictionary.Item(QuickGraph.Concepts.IVertex)">
3013 <summary>
3014 Gets or sets the Edge associated with the given Vertex
3015 </summary>
3016 <param name="key">
3017 The Vertex whose value to get or set.
3018 </param>
3019 </member>
3020 <member name="P:QuickGraph.Collections.VertexEdgeDictionary.Keys">
3021 <summary>
3022 Gets a collection containing the keys in this VertexEdgeDictionary.
3023 </summary>
3024 </member>
3025 <member name="P:QuickGraph.Collections.VertexEdgeDictionary.Values">
3026 <summary>
3027 Gets a collection containing the values in this VertexEdgeDictionary.
3028 </summary>
3029 </member>
3030 <member name="T:QuickGraph.Collections.VertexEdgesDictionary">
3031 <summary>
3032 A dictionary with keys of type Vertex and values of type EdgeCollection
3033 </summary>
3034 </member>
3035 <member name="M:QuickGraph.Collections.VertexEdgesDictionary.#ctor">
3036 <summary>
3037 Initializes a new empty instance of the VertexEdgesDictionary class
3038 </summary>
3039 </member>
3040 <member name="M:QuickGraph.Collections.VertexEdgesDictionary.Add(QuickGraph.Concepts.IVertex,QuickGraph.Collections.EdgeCollection)">
3041 <summary>
3042 Adds an element with the specified key and value to this VertexEdgesDictionary.
3043 </summary>
3044 <param name="key">
3045 The Vertex key of the element to add.
3046 </param>
3047 <param name="value">
3048 The EdgeCollection value of the element to add.
3049 </param>
3050 </member>
3051 <member name="M:QuickGraph.Collections.VertexEdgesDictionary.Contains(QuickGraph.Concepts.IVertex)">
3052 <summary>
3053 Determines whether this VertexEdgesDictionary contains a specific key.
3054 </summary>
3055 <param name="key">
3056 The Vertex key to locate in this VertexEdgesDictionary.
3057 </param>
3058 <returns>
3059 true if this VertexEdgesDictionary contains an element with the specified key;
3060 otherwise, false.
3061 </returns>
3062 </member>
3063 <member name="M:QuickGraph.Collections.VertexEdgesDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3064 <summary>
3065 Determines whether this VertexEdgesDictionary contains a specific key.
3066 </summary>
3067 <param name="key">
3068 The Vertex key to locate in this VertexEdgesDictionary.
3069 </param>
3070 <returns>
3071 true if this VertexEdgesDictionary contains an element with the specified key;
3072 otherwise, false.
3073 </returns>
3074 </member>
3075 <member name="M:QuickGraph.Collections.VertexEdgesDictionary.ContainsValue(QuickGraph.Collections.EdgeCollection)">
3076 <summary>
3077 Determines whether this VertexEdgesDictionary contains a specific value.
3078 </summary>
3079 <param name="value">
3080 The EdgeCollection value to locate in this VertexEdgesDictionary.
3081 </param>
3082 <returns>
3083 true if this VertexEdgesDictionary contains an element with the specified value;
3084 otherwise, false.
3085 </returns>
3086 </member>
3087 <member name="M:QuickGraph.Collections.VertexEdgesDictionary.Remove(QuickGraph.Concepts.IVertex)">
3088 <summary>
3089 Removes the element with the specified key from this VertexEdgesDictionary.
3090 </summary>
3091 <param name="key">
3092 The Vertex key of the element to remove.
3093 </param>
3094 </member>
3095 <member name="P:QuickGraph.Collections.VertexEdgesDictionary.Item(QuickGraph.Concepts.IVertex)">
3096 <summary>
3097 Gets or sets the EdgeCollection associated with the given Vertex
3098 </summary>
3099 <param name="key">
3100 The Vertex whose value to get or set.
3101 </param>
3102 </member>
3103 <member name="P:QuickGraph.Collections.VertexEdgesDictionary.Keys">
3104 <summary>
3105 Gets a collection containing the keys in this VertexEdgesDictionary.
3106 </summary>
3107 </member>
3108 <member name="P:QuickGraph.Collections.VertexEdgesDictionary.Values">
3109 <summary>
3110 Gets a collection containing the values in this VertexEdgesDictionary.
3111 </summary>
3112 </member>
3113 <member name="T:QuickGraph.Collections.VertexEdgesEnumerable">
3114 <summary>
3115 A simple IEnumerable class that provides an enumerator over
3116 the graph edges.
3117 </summary>
3118 <remarks>
3119 </remarks>
3120 </member>
3121 <member name="M:QuickGraph.Collections.VertexEdgesEnumerable.#ctor(QuickGraph.Collections.VertexEdgesDictionary)">
3122 <summary>
3123 Construct an enumerable collection of edges
3124 </summary>
3125 <param name="vertexOutEdges">vertex out edges dictionary</param>
3126 <exception cref="T:System.ArgumentNullException">vertexOutEdges is null</exception>
3127 </member>
3128 <member name="M:QuickGraph.Collections.VertexEdgesEnumerable.GetEnumerator">
3129 <summary>
3130 Provides an enumerator over the graph edges
3131 </summary>
3132 <returns>An enumerator</returns>
3133 </member>
3134 <member name="M:QuickGraph.Collections.VertexEdgesEnumerable.System#Collections#IEnumerable#GetEnumerator">
3135 <summary>
3136 Implements the IEnumerable method.
3137 </summary>
3138 <returns>An enumerator over the edges</returns>
3139 </member>
3140 <member name="T:QuickGraph.Collections.VertexEdgesEnumerator">
3141 <summary>
3142 An adaptor class to enumerate edges.
3143 </summary>
3144 <remarks>
3145 <para>
3146 The enumerator works be succesively iterating the vertices
3147 out-edges.
3148 </para>
3149 <para>
3150 This class should not be constructed directly. It is created on
3151 a <c>GetEnumerator()</c> call.
3152 </para>
3153 </remarks>
3154 </member>
3155 <member name="M:QuickGraph.Collections.VertexEdgesEnumerator.#ctor(QuickGraph.Collections.VertexEdgesDictionary)">
3156 <summary>
3157 Construct an enumerator over the out-edges
3158 </summary>
3159 <param name="vertexOutEdges">Out edge dictionary to iterate</param>
3160 <exception cref="T:System.ArgumentNullException">vertexOutEdges is null</exception>
3161 </member>
3162 <member name="M:QuickGraph.Collections.VertexEdgesEnumerator.Reset">
3163 <summary>
3164 Sets the enumerator to its initial position,
3165 which is before the first element in the collection.
3166 </summary>
3167 </member>
3168 <member name="M:QuickGraph.Collections.VertexEdgesEnumerator.MoveNext">
3169 <summary>
3170 Advances the enumerator to the next element of the
3171 collection.
3172 </summary>
3173 <returns>
3174 true if the enumerator was successfully advanced to the
3175 next edge; false if the enumerator has passed the end of
3176 the collection.
3177 </returns>
3178 </member>
3179 <member name="M:QuickGraph.Collections.VertexEdgesEnumerator.MoveNextVertex">
3180 <summary>
3181 Move the vertex iterator to the next vertex.
3182 </summary>
3183 <returns></returns>
3184 </member>
3185 <member name="P:QuickGraph.Collections.VertexEdgesEnumerator.Current">
3186 <summary>
3187 Gets the current element in the collection.
3188 </summary>
3189 <exception cref="T:System.InvalidOperationException">The enumerator
3190 is positioned before the first element of the collection
3191 or after the last element.</exception>
3192 </member>
3193 <member name="P:QuickGraph.Collections.VertexEdgesEnumerator.System#Collections#IEnumerator#Current">
3194 <summary>
3195 Implement IEnumerator.Current.
3196 </summary>
3197 </member>
3198 <member name="T:QuickGraph.Collections.VertexEnumerable">
3199 <summary>
3200 A wrapper class for weak collection of IVertex
3201 </summary>
3202 <remarks>
3203 <para>
3204 This class works as a proxy for a weakly named collection of IVertex by
3205 implementing the IVertexEnumerable interface.
3206 </para>
3207 </remarks>
3208 <example>
3209 In this example, we show how to convert the key collection of
3210 a vertex dictionary to a stronly typed collection:
3211 <code>
3212 VertexStringDictionary names = new VertexStringDictionary();
3213 // adding names
3214 ...
3215 // this will fail names.Keys implements IEnumerable.
3216 IVertexEnumerable c = names.Keys;
3217 // wrapping the keys
3218 IVertexEnumrable c = new VertexEnumerable(names.Keys);
3219 </code>
3220 </example>
3221 </member>
3222 <member name="M:QuickGraph.Collections.VertexEnumerable.#ctor(System.Collections.IEnumerable)">
3223 <summary>
3224 Constructor
3225 </summary>
3226 <param name="en">Wrapped enumerable</param>
3227 <exception cref="T:System.ArgumentNullException">en is null</exception>
3228 </member>
3229 <member name="M:QuickGraph.Collections.VertexEnumerable.Wrap(System.Collections.IEnumerable)">
3230 <summary>
3231 Wraps up the weakly typed collection in a strongly typed (IVertex)
3232 collection.
3233 </summary>
3234 <param name="en">Collection to wrap</param>
3235 <returns>vertex enumerable collection</returns>
3236 <remarks>
3237 <para>
3238 The method is thread-safe.
3239 </para>
3240 </remarks>
3241 </member>
3242 <member name="M:QuickGraph.Collections.VertexEnumerable.GetEnumerator">
3243 <summary>
3244 Return a strongly typed enumerator
3245 </summary>
3246 <returns>strongly typed enumerator</returns>
3247 </member>
3248 <member name="M:QuickGraph.Collections.VertexEnumerable.QuickGraph#Concepts#Collections#IVertexEnumerable#GetEnumerator">
3249 <summary>
3250
3251 </summary>
3252 <returns></returns>
3253 </member>
3254 <member name="M:QuickGraph.Collections.VertexEnumerable.System#Collections#IEnumerable#GetEnumerator">
3255 <summary>
3256
3257 </summary>
3258 <returns></returns>
3259 </member>
3260 <member name="P:QuickGraph.Collections.VertexEnumerable.Enumerable">
3261 <summary>
3262 Wrapped enumerable
3263 </summary>
3264 </member>
3265 <member name="T:QuickGraph.Collections.VertexEnumerable.Enumerator">
3266 <summary>
3267 Strongly typed enumerator
3268 </summary>
3269 </member>
3270 <member name="M:QuickGraph.Collections.VertexEnumerable.Enumerator.#ctor(System.Collections.IEnumerator)">
3271 <summary>
3272 Builds a new enumrator
3273 </summary>
3274 <param name="e">wrapped enumerator</param>
3275 <exception cref="T:System.ArgumentNullException">e is null</exception>
3276 </member>
3277 <member name="M:QuickGraph.Collections.VertexEnumerable.Enumerator.Reset">
3278 <summary>
3279
3280 </summary>
3281 </member>
3282 <member name="M:QuickGraph.Collections.VertexEnumerable.Enumerator.MoveNext">
3283 <summary>
3284
3285 </summary>
3286 <returns></returns>
3287 </member>
3288 <member name="P:QuickGraph.Collections.VertexEnumerable.Enumerator.Wrapped">
3289 <summary>
3290 Wrapped enumerator
3291 </summary>
3292 </member>
3293 <member name="P:QuickGraph.Collections.VertexEnumerable.Enumerator.Current">
3294 <summary>
3295 Current vertex
3296 </summary>
3297 </member>
3298 <member name="P:QuickGraph.Collections.VertexEnumerable.Enumerator.System#Collections#IEnumerator#Current">
3299 <summary>
3300
3301 </summary>
3302 </member>
3303 <member name="T:QuickGraph.Collections.VertexIntDictionary">
3304 <summary>
3305 A dictionary with keys of type Vertex and values of type int
3306 </summary>
3307 </member>
3308 <member name="M:QuickGraph.Collections.VertexIntDictionary.#ctor">
3309 <summary>
3310 Initializes a new empty instance of the VertexIntDictionary class
3311 </summary>
3312 </member>
3313 <member name="M:QuickGraph.Collections.VertexIntDictionary.Add(QuickGraph.Concepts.IVertex,System.Int32)">
3314 <summary>
3315 Adds an element with the specified key and value to this VertexIntDictionary.
3316 </summary>
3317 <param name="key">
3318 The Vertex key of the element to add.
3319 </param>
3320 <param name="value">
3321 The int value of the element to add.
3322 </param>
3323 </member>
3324 <member name="M:QuickGraph.Collections.VertexIntDictionary.Contains(QuickGraph.Concepts.IVertex)">
3325 <summary>
3326 Determines whether this VertexIntDictionary contains a specific key.
3327 </summary>
3328 <param name="key">
3329 The Vertex key to locate in this VertexIntDictionary.
3330 </param>
3331 <returns>
3332 true if this VertexIntDictionary contains an element with the specified key;
3333 otherwise, false.
3334 </returns>
3335 </member>
3336 <member name="M:QuickGraph.Collections.VertexIntDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3337 <summary>
3338 Determines whether this VertexIntDictionary contains a specific key.
3339 </summary>
3340 <param name="key">
3341 The Vertex key to locate in this VertexIntDictionary.
3342 </param>
3343 <returns>
3344 true if this VertexIntDictionary contains an element with the specified key;
3345 otherwise, false.
3346 </returns>
3347 </member>
3348 <member name="M:QuickGraph.Collections.VertexIntDictionary.ContainsValue(System.Int32)">
3349 <summary>
3350 Determines whether this VertexIntDictionary contains a specific value.
3351 </summary>
3352 <param name="value">
3353 The int value to locate in this VertexIntDictionary.
3354 </param>
3355 <returns>
3356 true if this VertexIntDictionary contains an element with the specified value;
3357 otherwise, false.
3358 </returns>
3359 </member>
3360 <member name="M:QuickGraph.Collections.VertexIntDictionary.Remove(QuickGraph.Concepts.IVertex)">
3361 <summary>
3362 Removes the element with the specified key from this VertexIntDictionary.
3363 </summary>
3364 <param name="key">
3365 The Vertex key of the element to remove.
3366 </param>
3367 </member>
3368 <member name="P:QuickGraph.Collections.VertexIntDictionary.Item(QuickGraph.Concepts.IVertex)">
3369 <summary>
3370 Gets or sets the int associated with the given Vertex
3371 </summary>
3372 <param name="key">
3373 The Vertex whose value to get or set.
3374 </param>
3375 </member>
3376 <member name="P:QuickGraph.Collections.VertexIntDictionary.Keys">
3377 <summary>
3378 Gets a collection containing the keys in this VertexIntDictionary.
3379 </summary>
3380 </member>
3381 <member name="P:QuickGraph.Collections.VertexIntDictionary.Values">
3382 <summary>
3383 Gets a collection containing the values in this VertexIntDictionary.
3384 </summary>
3385 </member>
3386 <member name="T:QuickGraph.Collections.VertexObjectDictionary">
3387 <summary>
3388 A dictionary with keys of type Vertex and values of type Object
3389 </summary>
3390 </member>
3391 <member name="M:QuickGraph.Collections.VertexObjectDictionary.#ctor">
3392 <summary>
3393 Initializes a new empty instance of the VertexObjectDictionary class
3394 </summary>
3395 </member>
3396 <member name="M:QuickGraph.Collections.VertexObjectDictionary.Add(QuickGraph.Concepts.IVertex,System.Object)">
3397 <summary>
3398 Adds an element with the specified key and value to this VertexObjectDictionary.
3399 </summary>
3400 <param name="key">
3401 The Vertex key of the element to add.
3402 </param>
3403 <param name="value">
3404 The Object value of the element to add.
3405 </param>
3406 </member>
3407 <member name="M:QuickGraph.Collections.VertexObjectDictionary.Contains(QuickGraph.Concepts.IVertex)">
3408 <summary>
3409 Determines whether this VertexObjectDictionary contains a specific key.
3410 </summary>
3411 <param name="key">
3412 The Vertex key to locate in this VertexObjectDictionary.
3413 </param>
3414 <returns>
3415 true if this VertexObjectDictionary contains an element with the specified key;
3416 otherwise, false.
3417 </returns>
3418 </member>
3419 <member name="M:QuickGraph.Collections.VertexObjectDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3420 <summary>
3421 Determines whether this VertexObjectDictionary contains a specific key.
3422 </summary>
3423 <param name="key">
3424 The Vertex key to locate in this VertexObjectDictionary.
3425 </param>
3426 <returns>
3427 true if this VertexObjectDictionary contains an element with the specified key;
3428 otherwise, false.
3429 </returns>
3430 </member>
3431 <member name="M:QuickGraph.Collections.VertexObjectDictionary.ContainsValue(System.Object)">
3432 <summary>
3433 Determines whether this VertexObjectDictionary contains a specific value.
3434 </summary>
3435 <param name="value">
3436 The Object value to locate in this VertexObjectDictionary.
3437 </param>
3438 <returns>
3439 true if this VertexObjectDictionary contains an element with the specified value;
3440 otherwise, false.
3441 </returns>
3442 </member>
3443 <member name="M:QuickGraph.Collections.VertexObjectDictionary.Remove(QuickGraph.Concepts.IVertex)">
3444 <summary>
3445 Removes the element with the specified key from this VertexObjectDictionary.
3446 </summary>
3447 <param name="key">
3448 The Vertex key of the element to remove.
3449 </param>
3450 </member>
3451 <member name="P:QuickGraph.Collections.VertexObjectDictionary.Item(QuickGraph.Concepts.IVertex)">
3452 <summary>
3453 Gets or sets the Object associated with the given Vertex
3454 </summary>
3455 <param name="key">
3456 The Vertex whose value to get or set.
3457 </param>
3458 </member>
3459 <member name="P:QuickGraph.Collections.VertexObjectDictionary.Keys">
3460 <summary>
3461 Gets a collection containing the keys in this VertexObjectDictionary.
3462 </summary>
3463 </member>
3464 <member name="P:QuickGraph.Collections.VertexObjectDictionary.Values">
3465 <summary>
3466 Gets a collection containing the values in this VertexObjectDictionary.
3467 </summary>
3468 </member>
3469 <member name="T:QuickGraph.Collections.VertexPair">
3470 <summary>
3471 A class containing a pair of <see cref="T:QuickGraph.Concepts.IVertex"/>.
3472 </summary>
3473 <remarks>
3474 Mini-class useful in a number of situations.
3475 </remarks>
3476 </member>
3477 <member name="M:QuickGraph.Collections.VertexPair.#ctor(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
3478 <summary>
3479 Create a <see cref="T:QuickGraph.Concepts.IVertex"/> pair
3480 </summary>
3481 <param name="first">first <see cref="T:QuickGraph.Concepts.IVertex"/> instance</param>
3482 <param name="second">second <see cref="T:QuickGraph.Concepts.IVertex"/> instance</param>
3483 <exception cref="T:System.ArgumentNullException">
3484 <paramref name="first"/> or <paramref name="second"/> is a null
3485 reference
3486 </exception>
3487 </member>
3488 <member name="M:QuickGraph.Collections.VertexPair.CompareTo(System.Object)">
3489 <summary>
3490
3491 </summary>
3492 <param name="obj"></param>
3493 <returns></returns>
3494 </member>
3495 <member name="P:QuickGraph.Collections.VertexPair.First">
3496 <summary>
3497 Gets or sets the first <see cref="T:QuickGraph.Concepts.IVertex"/> instance
3498 </summary>
3499 <value>
3500 First <see cref="T:QuickGraph.Concepts.IVertex"/> instance.
3501 </value>
3502 <exception cref="T:System.ArgumentNullException">
3503 set property, value is a null reference
3504 </exception>
3505 </member>
3506 <member name="P:QuickGraph.Collections.VertexPair.Second">
3507 <summary>
3508 Gets or sets the second <see cref="T:QuickGraph.Concepts.IVertex"/> instance
3509 </summary>
3510 <value>
3511 Second <see cref="T:QuickGraph.Concepts.IVertex"/> instance.
3512 </value>
3513 <exception cref="T:System.ArgumentNullException">
3514 set property, value is a null reference
3515 </exception>
3516 </member>
3517 <member name="T:QuickGraph.Collections.VertexPairDoubleDictionary">
3518 <summary>
3519 A dictionary with keys of type VertexPair and values of type double
3520 </summary>
3521 </member>
3522 <member name="T:QuickGraph.Concepts.Collections.IVertexDistanceMatrix">
3523 <summary>
3524
3525 </summary>
3526 </member>
3527 <member name="M:QuickGraph.Concepts.Collections.IVertexDistanceMatrix.Distance(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
3528 <summary>
3529
3530 </summary>
3531 <param name="source"></param>
3532 <param name="target"></param>
3533 <returns></returns>
3534 </member>
3535 <member name="M:QuickGraph.Concepts.Collections.IVertexDistanceMatrix.SetDistance(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex,System.Double)">
3536 <summary>
3537
3538 </summary>
3539 <param name="source"></param>
3540 <param name="target"></param>
3541 <param name="distance"></param>
3542 </member>
3543 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.#ctor">
3544 <summary>
3545 Initializes a new empty instance of the VertexPairDoubleDictionary class
3546 </summary>
3547 </member>
3548 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.Distance(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
3549 <summary>
3550
3551 </summary>
3552 <param name="u"></param>
3553 <param name="v"></param>
3554 <returns></returns>
3555 </member>
3556 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.SetDistance(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex,System.Double)">
3557 <summary>
3558
3559 </summary>
3560 <param name="u"></param>
3561 <param name="v"></param>
3562 <param name="d"></param>
3563 </member>
3564 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.Add(QuickGraph.Collections.VertexPair,System.Double)">
3565 <summary>
3566 Adds an element with the specified key and value to this VertexPairDoubleDictionary.
3567 </summary>
3568 <param name="key">
3569 The VertexPair key of the element to add.
3570 </param>
3571 <param name="value">
3572 The double value of the element to add.
3573 </param>
3574 </member>
3575 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.Contains(QuickGraph.Collections.VertexPair)">
3576 <summary>
3577 Determines whether this VertexPairDoubleDictionary contains a specific key.
3578 </summary>
3579 <param name="key">
3580 The VertexPair key to locate in this VertexPairDoubleDictionary.
3581 </param>
3582 <returns>
3583 true if this VertexPairDoubleDictionary contains an element with the specified key;
3584 otherwise, false.
3585 </returns>
3586 </member>
3587 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.ContainsKey(QuickGraph.Collections.VertexPair)">
3588 <summary>
3589 Determines whether this VertexPairDoubleDictionary contains a specific key.
3590 </summary>
3591 <param name="key">
3592 The VertexPair key to locate in this VertexPairDoubleDictionary.
3593 </param>
3594 <returns>
3595 true if this VertexPairDoubleDictionary contains an element with the specified key;
3596 otherwise, false.
3597 </returns>
3598 </member>
3599 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.ContainsValue(System.Double)">
3600 <summary>
3601 Determines whether this VertexPairDoubleDictionary contains a specific value.
3602 </summary>
3603 <param name="value">
3604 The double value to locate in this VertexPairDoubleDictionary.
3605 </param>
3606 <returns>
3607 true if this VertexPairDoubleDictionary contains an element with the specified value;
3608 otherwise, false.
3609 </returns>
3610 </member>
3611 <member name="M:QuickGraph.Collections.VertexPairDoubleDictionary.Remove(QuickGraph.Collections.VertexPair)">
3612 <summary>
3613 Removes the element with the specified key from this VertexPairDoubleDictionary.
3614 </summary>
3615 <param name="key">
3616 The VertexPair key of the element to remove.
3617 </param>
3618 </member>
3619 <member name="P:QuickGraph.Collections.VertexPairDoubleDictionary.Item(QuickGraph.Collections.VertexPair)">
3620 <summary>
3621 Gets or sets the double associated with the given VertexPair
3622 </summary>
3623 <param name="key">
3624 The VertexPair whose value to get or set.
3625 </param>
3626 </member>
3627 <member name="P:QuickGraph.Collections.VertexPairDoubleDictionary.Item(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
3628 <summary>
3629 Returns
3630 </summary>
3631 <param name="u"></param>
3632 <param name="v"></param>
3633 <returns></returns>
3634 </member>
3635 <member name="P:QuickGraph.Collections.VertexPairDoubleDictionary.Keys">
3636 <summary>
3637 Gets a collection containing the keys in this VertexPairDoubleDictionary.
3638 </summary>
3639 </member>
3640 <member name="P:QuickGraph.Collections.VertexPairDoubleDictionary.Values">
3641 <summary>
3642 Gets a collection containing the values in this VertexPairDoubleDictionary.
3643 </summary>
3644 </member>
3645 <member name="T:QuickGraph.Collections.VertexPointFDictionary">
3646 <summary>
3647 A dictionary with keys of type IVertex and values of type PointF
3648 </summary>
3649 </member>
3650 <member name="M:QuickGraph.Collections.VertexPointFDictionary.#ctor">
3651 <summary>
3652 Initializes a new empty instance of the VertexPointFDictionary class
3653 </summary>
3654 </member>
3655 <member name="M:QuickGraph.Collections.VertexPointFDictionary.Add(QuickGraph.Concepts.IVertex,System.Drawing.PointF)">
3656 <summary>
3657 Adds an element with the specified key and value to this VertexPointFDictionary.
3658 </summary>
3659 <param name="key">
3660 The IVertex key of the element to add.
3661 </param>
3662 <param name="value">
3663 The PointF value of the element to add.
3664 </param>
3665 </member>
3666 <member name="M:QuickGraph.Collections.VertexPointFDictionary.Contains(QuickGraph.Concepts.IVertex)">
3667 <summary>
3668 Determines whether this VertexPointFDictionary contains a specific key.
3669 </summary>
3670 <param name="key">
3671 The IVertex key to locate in this VertexPointFDictionary.
3672 </param>
3673 <returns>
3674 true if this VertexPointFDictionary contains an element with the specified key;
3675 otherwise, false.
3676 </returns>
3677 </member>
3678 <member name="M:QuickGraph.Collections.VertexPointFDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3679 <summary>
3680 Determines whether this VertexPointFDictionary contains a specific key.
3681 </summary>
3682 <param name="key">
3683 The IVertex key to locate in this VertexPointFDictionary.
3684 </param>
3685 <returns>
3686 true if this VertexPointFDictionary contains an element with the specified key;
3687 otherwise, false.
3688 </returns>
3689 </member>
3690 <member name="M:QuickGraph.Collections.VertexPointFDictionary.ContainsValue(System.Drawing.PointF)">
3691 <summary>
3692 Determines whether this VertexPointFDictionary contains a specific value.
3693 </summary>
3694 <param name="value">
3695 The PointF value to locate in this VertexPointFDictionary.
3696 </param>
3697 <returns>
3698 true if this VertexPointFDictionary contains an element with the specified value;
3699 otherwise, false.
3700 </returns>
3701 </member>
3702 <member name="M:QuickGraph.Collections.VertexPointFDictionary.Remove(QuickGraph.Concepts.IVertex)">
3703 <summary>
3704 Removes the element with the specified key from this VertexPointFDictionary.
3705 </summary>
3706 <param name="key">
3707 The IVertex key of the element to remove.
3708 </param>
3709 </member>
3710 <member name="P:QuickGraph.Collections.VertexPointFDictionary.Item(QuickGraph.Concepts.IVertex)">
3711 <summary>
3712 Gets or sets the PointF associated with the given IVertex
3713 </summary>
3714 <param name="key">
3715 The IVertex whose value to get or set.
3716 </param>
3717 </member>
3718 <member name="T:QuickGraph.Collections.VertexSizeFDictionary">
3719 <summary>
3720 A dictionary with keys of type IVertex and values of type Size
3721 </summary>
3722 </member>
3723 <member name="M:QuickGraph.Collections.VertexSizeFDictionary.#ctor">
3724 <summary>
3725 Initializes a new empty instance of the VertexSizeDictionary class
3726 </summary>
3727 </member>
3728 <member name="M:QuickGraph.Collections.VertexSizeFDictionary.Add(QuickGraph.Concepts.IVertex,System.Drawing.SizeF)">
3729 <summary>
3730 Adds an element with the specified key and value to this VertexSizeDictionary.
3731 </summary>
3732 <param name="key">
3733 The IVertex key of the element to add.
3734 </param>
3735 <param name="value">
3736 The Size value of the element to add.
3737 </param>
3738 </member>
3739 <member name="M:QuickGraph.Collections.VertexSizeFDictionary.Contains(QuickGraph.Concepts.IVertex)">
3740 <summary>
3741 Determines whether this VertexSizeDictionary contains a specific key.
3742 </summary>
3743 <param name="key">
3744 The IVertex key to locate in this VertexSizeDictionary.
3745 </param>
3746 <returns>
3747 true if this VertexSizeDictionary contains an element with the specified key;
3748 otherwise, false.
3749 </returns>
3750 </member>
3751 <member name="M:QuickGraph.Collections.VertexSizeFDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3752 <summary>
3753 Determines whether this VertexSizeDictionary contains a specific key.
3754 </summary>
3755 <param name="key">
3756 The IVertex key to locate in this VertexSizeDictionary.
3757 </param>
3758 <returns>
3759 true if this VertexSizeDictionary contains an element with the specified key;
3760 otherwise, false.
3761 </returns>
3762 </member>
3763 <member name="M:QuickGraph.Collections.VertexSizeFDictionary.ContainsValue(System.Drawing.SizeF)">
3764 <summary>
3765 Determines whether this VertexSizeDictionary contains a specific value.
3766 </summary>
3767 <param name="value">
3768 The Size value to locate in this VertexSizeDictionary.
3769 </param>
3770 <returns>
3771 true if this VertexSizeDictionary contains an element with the specified value;
3772 otherwise, false.
3773 </returns>
3774 </member>
3775 <member name="M:QuickGraph.Collections.VertexSizeFDictionary.Remove(QuickGraph.Concepts.IVertex)">
3776 <summary>
3777 Removes the element with the specified key from this VertexSizeDictionary.
3778 </summary>
3779 <param name="key">
3780 The IVertex key of the element to remove.
3781 </param>
3782 </member>
3783 <member name="P:QuickGraph.Collections.VertexSizeFDictionary.Item(QuickGraph.Concepts.IVertex)">
3784 <summary>
3785 Gets or sets the Size associated with the given IVertex
3786 </summary>
3787 <param name="key">
3788 The IVertex whose value to get or set.
3789 </param>
3790 </member>
3791 <member name="P:QuickGraph.Collections.VertexSizeFDictionary.Keys">
3792 <summary>
3793 Gets a collection containing the keys in this VertexSizeDictionary.
3794 </summary>
3795 </member>
3796 <member name="P:QuickGraph.Collections.VertexSizeFDictionary.Values">
3797 <summary>
3798 Gets a collection containing the values in this VertexSizeDictionary.
3799 </summary>
3800 </member>
3801 <member name="T:QuickGraph.Collections.VertexStringDictionary">
3802 <summary>
3803 A dictionary with keys of type Vertex and values of type String
3804 </summary>
3805 </member>
3806 <member name="M:QuickGraph.Collections.VertexStringDictionary.#ctor">
3807 <summary>
3808 Initializes a new empty instance of the VertexStringDictionary class
3809 </summary>
3810 </member>
3811 <member name="M:QuickGraph.Collections.VertexStringDictionary.Add(QuickGraph.Concepts.IVertex,System.String)">
3812 <summary>
3813 Adds an element with the specified key and value to this VertexStringDictionary.
3814 </summary>
3815 <param name="key">
3816 The Vertex key of the element to add.
3817 </param>
3818 <param name="value">
3819 The String value of the element to add.
3820 </param>
3821 </member>
3822 <member name="M:QuickGraph.Collections.VertexStringDictionary.Contains(QuickGraph.Concepts.IVertex)">
3823 <summary>
3824 Determines whether this VertexStringDictionary contains a specific key.
3825 </summary>
3826 <param name="key">
3827 The Vertex key to locate in this VertexStringDictionary.
3828 </param>
3829 <returns>
3830 true if this VertexStringDictionary contains an element with the specified key;
3831 otherwise, false.
3832 </returns>
3833 </member>
3834 <member name="M:QuickGraph.Collections.VertexStringDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3835 <summary>
3836 Determines whether this VertexStringDictionary contains a specific key.
3837 </summary>
3838 <param name="key">
3839 The Vertex key to locate in this VertexStringDictionary.
3840 </param>
3841 <returns>
3842 true if this VertexStringDictionary contains an element with the specified key;
3843 otherwise, false.
3844 </returns>
3845 </member>
3846 <member name="M:QuickGraph.Collections.VertexStringDictionary.ContainsValue(System.String)">
3847 <summary>
3848 Determines whether this VertexStringDictionary contains a specific value.
3849 </summary>
3850 <param name="value">
3851 The String value to locate in this VertexStringDictionary.
3852 </param>
3853 <returns>
3854 true if this VertexStringDictionary contains an element with the specified value;
3855 otherwise, false.
3856 </returns>
3857 </member>
3858 <member name="M:QuickGraph.Collections.VertexStringDictionary.Remove(QuickGraph.Concepts.IVertex)">
3859 <summary>
3860 Removes the element with the specified key from this VertexStringDictionary.
3861 </summary>
3862 <param name="key">
3863 The Vertex key of the element to remove.
3864 </param>
3865 </member>
3866 <member name="P:QuickGraph.Collections.VertexStringDictionary.Item(QuickGraph.Concepts.IVertex)">
3867 <summary>
3868 Gets or sets the String associated with the given Vertex
3869 </summary>
3870 <param name="key">
3871 The Vertex whose value to get or set.
3872 </param>
3873 </member>
3874 <member name="P:QuickGraph.Collections.VertexStringDictionary.Keys">
3875 <summary>
3876 Gets a collection containing the keys in this VertexStringDictionary.
3877 </summary>
3878 </member>
3879 <member name="P:QuickGraph.Collections.VertexStringDictionary.Values">
3880 <summary>
3881 Gets a collection containing the values in this VertexStringDictionary.
3882 </summary>
3883 </member>
3884 <member name="T:QuickGraph.Collections.VertexVector2DDictionary">
3885 <summary>
3886 A dictionary with keys of type IVertex and values of type Vector2D
3887 </summary>
3888 </member>
3889 <member name="M:QuickGraph.Collections.VertexVector2DDictionary.#ctor">
3890 <summary>
3891 Initializes a new empty instance of the VertexVector2DDictionary class
3892 </summary>
3893 </member>
3894 <member name="M:QuickGraph.Collections.VertexVector2DDictionary.Add(QuickGraph.Concepts.IVertex,QuickGraph.Collections.Vector2D)">
3895 <summary>
3896 Adds an element with the specified key and value to this VertexVector2DDictionary.
3897 </summary>
3898 <param name="key">
3899 The IVertex key of the element to add.
3900 </param>
3901 <param name="value">
3902 The Vector2D value of the element to add.
3903 </param>
3904 </member>
3905 <member name="M:QuickGraph.Collections.VertexVector2DDictionary.Contains(QuickGraph.Concepts.IVertex)">
3906 <summary>
3907 Determines whether this VertexVector2DDictionary contains a specific key.
3908 </summary>
3909 <param name="key">
3910 The IVertex key to locate in this VertexVector2DDictionary.
3911 </param>
3912 <returns>
3913 true if this VertexVector2DDictionary contains an element with the specified key;
3914 otherwise, false.
3915 </returns>
3916 </member>
3917 <member name="M:QuickGraph.Collections.VertexVector2DDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
3918 <summary>
3919 Determines whether this VertexVector2DDictionary contains a specific key.
3920 </summary>
3921 <param name="key">
3922 The IVertex key to locate in this VertexVector2DDictionary.
3923 </param>
3924 <returns>
3925 true if this VertexVector2DDictionary contains an element with the specified key;
3926 otherwise, false.
3927 </returns>
3928 </member>
3929 <member name="M:QuickGraph.Collections.VertexVector2DDictionary.ContainsValue(QuickGraph.Collections.Vector2D)">
3930 <summary>
3931 Determines whether this VertexVector2DDictionary contains a specific value.
3932 </summary>
3933 <param name="value">
3934 The Vector2D value to locate in this VertexVector2DDictionary.
3935 </param>
3936 <returns>
3937 true if this VertexVector2DDictionary contains an element with the specified value;
3938 otherwise, false.
3939 </returns>
3940 </member>
3941 <member name="M:QuickGraph.Collections.VertexVector2DDictionary.Remove(QuickGraph.Concepts.IVertex)">
3942 <summary>
3943 Removes the element with the specified key from this VertexVector2DDictionary.
3944 </summary>
3945 <param name="key">
3946 The IVertex key of the element to remove.
3947 </param>
3948 </member>
3949 <member name="P:QuickGraph.Collections.VertexVector2DDictionary.Item(QuickGraph.Concepts.IVertex)">
3950 <summary>
3951 Gets or sets the Vector2D associated with the given IVertex
3952 </summary>
3953 <param name="key">
3954 The IVertex whose value to get or set.
3955 </param>
3956 </member>
3957 <member name="P:QuickGraph.Collections.VertexVector2DDictionary.Keys">
3958 <summary>
3959 Gets a collection containing the keys in this VertexVector2DDictionary.
3960 </summary>
3961 </member>
3962 <member name="P:QuickGraph.Collections.VertexVector2DDictionary.Values">
3963 <summary>
3964 Gets a collection containing the values in this VertexVector2DDictionary.
3965 </summary>
3966 </member>
3967 <member name="T:QuickGraph.Collections.VertexVertexDictionary">
3968 <summary>
3969 A dictionary with keys of type Vertex and values of type Vertex
3970 </summary>
3971 </member>
3972 <member name="M:QuickGraph.Collections.VertexVertexDictionary.#ctor">
3973 <summary>
3974 Initializes a new empty instance of the VertexVertexDictionary class
3975 </summary>
3976 </member>
3977 <member name="M:QuickGraph.Collections.VertexVertexDictionary.Add(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
3978 <summary>
3979 Adds an element with the specified key and value to this VertexVertexDictionary.
3980 </summary>
3981 <param name="key">
3982 The Vertex key of the element to add.
3983 </param>
3984 <param name="value">
3985 The Vertex value of the element to add.
3986 </param>
3987 </member>
3988 <member name="M:QuickGraph.Collections.VertexVertexDictionary.Contains(QuickGraph.Concepts.IVertex)">
3989 <summary>
3990 Determines whether this VertexVertexDictionary contains a specific key.
3991 </summary>
3992 <param name="key">
3993 The Vertex key to locate in this VertexVertexDictionary.
3994 </param>
3995 <returns>
3996 true if this VertexVertexDictionary contains an element with the specified key;
3997 otherwise, false.
3998 </returns>
3999 </member>
4000 <member name="M:QuickGraph.Collections.VertexVertexDictionary.ContainsKey(QuickGraph.Concepts.IVertex)">
4001 <summary>
4002 Determines whether this VertexVertexDictionary contains a specific key.
4003 </summary>
4004 <param name="key">
4005 The Vertex key to locate in this VertexVertexDictionary.
4006 </param>
4007 <returns>
4008 true if this VertexVertexDictionary contains an element with the specified key;
4009 otherwise, false.
4010 </returns>
4011 </member>
4012 <member name="M:QuickGraph.Collections.VertexVertexDictionary.ContainsValue(QuickGraph.Concepts.IVertex)">
4013 <summary>
4014 Determines whether this VertexVertexDictionary contains a specific value.
4015 </summary>
4016 <param name="value">
4017 The Vertex value to locate in this VertexVertexDictionary.
4018 </param>
4019 <returns>
4020 true if this VertexVertexDictionary contains an element with the specified value;
4021 otherwise, false.
4022 </returns>
4023 </member>
4024 <member name="M:QuickGraph.Collections.VertexVertexDictionary.Remove(QuickGraph.Concepts.IVertex)">
4025 <summary>
4026 Removes the element with the specified key from this VertexVertexDictionary.
4027 </summary>
4028 <param name="key">
4029 The Vertex key of the element to remove.
4030 </param>
4031 </member>
4032 <member name="P:QuickGraph.Collections.VertexVertexDictionary.Item(QuickGraph.Concepts.IVertex)">
4033 <summary>
4034 Gets or sets the Vertex associated with the given Vertex
4035 </summary>
4036 <param name="key">
4037 The Vertex whose value to get or set.
4038 </param>
4039 </member>
4040 <member name="P:QuickGraph.Collections.VertexVertexDictionary.Keys">
4041 <summary>
4042 Gets a collection containing the keys in this VertexVertexDictionary.
4043 </summary>
4044 </member>
4045 <member name="P:QuickGraph.Collections.VertexVertexDictionary.Values">
4046 <summary>
4047 Gets a collection containing the values in this VertexVertexDictionary.
4048 </summary>
4049 </member>
4050 <member name="T:QuickGraph.Concepts.Algorithms.IAlgorithm">
4051 <summary>
4052 IAlgorithm interface.
4053 </summary>
4054 </member>
4055 <member name="P:QuickGraph.Concepts.Algorithms.IAlgorithm.VisitedGraph">
4056 <summary>
4057 Visited graph object
4058 </summary>
4059 </member>
4060 <member name="T:QuickGraph.Concepts.Algorithms.IDistanceRecorderAlgorithm">
4061 <summary>
4062 Defines an algorithm that supports vertex distance recording.
4063 </summary>
4064 </member>
4065 <member name="M:QuickGraph.Concepts.Algorithms.IDistanceRecorderAlgorithm.RegisterDistanceRecorderHandlers(QuickGraph.Concepts.Visitors.IDistanceRecorderVisitor)">
4066 <summary>
4067 Add event handlers to the corresponding events.
4068 </summary>
4069 <param name="vis">Distance recorder visitor</param>
4070 </member>
4071 <member name="T:QuickGraph.Concepts.Algorithms.IEdgeColorizerAlgorithm">
4072 <summary>
4073 Edge colorzing algorithm
4074 </summary>
4075 </member>
4076 <member name="M:QuickGraph.Concepts.Algorithms.IEdgeColorizerAlgorithm.RegisterEdgeColorizerHandlers(QuickGraph.Concepts.Visitors.IEdgeColorizerVisitor)">
4077 <summary>
4078
4079 </summary>
4080 <param name="vis"></param>
4081 </member>
4082 <member name="P:QuickGraph.Concepts.Algorithms.IEdgeColorizerAlgorithm.EdgeColors">
4083 <summary>
4084 Edge color map
4085 </summary>
4086 </member>
4087 <member name="T:QuickGraph.Concepts.Algorithms.IEdgePredecessorRecorderAlgorithm">
4088 <summary>
4089 Defines an algorithm that support edge predecessor recording.
4090 </summary>
4091 </member>
4092 <member name="M:QuickGraph.Concepts.Algorithms.IEdgePredecessorRecorderAlgorithm.RegisterEdgePredecessorRecorderHandlers(QuickGraph.Concepts.Visitors.IEdgePredecessorRecorderVisitor)">
4093 <summary>
4094 Register the predecessor handlers
4095 </summary>
4096 <param name="vis">visitor</param>
4097 </member>
4098 <member name="T:QuickGraph.Concepts.Algorithms.IPredecessorRecorderAlgorithm">
4099 <summary>
4100 Defines an algorithm that support predecessor recording.
4101 </summary>
4102 </member>
4103 <member name="M:QuickGraph.Concepts.Algorithms.IPredecessorRecorderAlgorithm.RegisterPredecessorRecorderHandlers(QuickGraph.Concepts.Visitors.IPredecessorRecorderVisitor)">
4104 <summary>
4105 Register the predecessor handlers
4106 </summary>
4107 <param name="vis">visitor</param>
4108 </member>
4109 <member name="T:QuickGraph.Concepts.Algorithms.ITimeStamperAlgorithm">
4110 <summary>
4111 Defines an algorithm that supports time stamping.
4112 </summary>
4113 </member>
4114 <member name="M:QuickGraph.Concepts.Algorithms.ITimeStamperAlgorithm.RegisterTimeStamperHandlers(QuickGraph.Concepts.Visitors.ITimeStamperVisitor)">
4115 <summary>
4116
4117 </summary>
4118 <param name="vis"></param>
4119 </member>
4120 <member name="T:QuickGraph.Concepts.Algorithms.ITreeEdgeBuilderAlgorithm">
4121 <summary>
4122 An algorithm that implement TreeEdge event.
4123 </summary>
4124 </member>
4125 <member name="M:QuickGraph.Concepts.Algorithms.ITreeEdgeBuilderAlgorithm.RegisterTreeEdgeBuilderHandlers(QuickGraph.Concepts.Visitors.ITreeEdgeBuilderVisitor)">
4126 <summary>
4127
4128 </summary>
4129 <param name="vis"></param>
4130 </member>
4131 <member name="T:QuickGraph.Concepts.Algorithms.IVertexColorizerAlgorithm">
4132 <summary>
4133 Description résumée de IVertexColorizerAlgorithm.
4134 </summary>
4135 </member>
4136 <member name="M:QuickGraph.Concepts.Algorithms.IVertexColorizerAlgorithm.RegisterVertexColorizerHandlers(QuickGraph.Concepts.Visitors.IVertexColorizerVisitor)">
4137 <summary>
4138
4139 </summary>
4140 <param name="vis"></param>
4141 </member>
4142 <member name="P:QuickGraph.Concepts.Algorithms.IVertexColorizerAlgorithm.Colors">
4143 <summary>
4144 Vertex color map
4145 </summary>
4146 </member>
4147 <member name="T:QuickGraph.Concepts.Algorithms.NamespaceDoc">
4148 <summary>
4149 <para>
4150 The <b>QuickGraph.Concepts.Algorithms</b> namespace contains
4151 the interfaces that define algorithm concept and behaviors.
4152 </para>
4153 </summary>
4154 </member>
4155 <member name="T:QuickGraph.Concepts.Collections.IPortCollection">
4156 <summary>
4157 A collection of <see cref="T:QuickGraph.Concepts.IPort"/> instance
4158 </summary>
4159 </member>
4160 <member name="T:QuickGraph.Concepts.Collections.IPortEnumerable">
4161 <summary>
4162 <see cref="T:QuickGraph.Concepts.IVertex"/> enumerable collection
4163 </summary>
4164 </member>
4165 <member name="M:QuickGraph.Concepts.Collections.IPortEnumerable.GetEnumerator">
4166 <summary>
4167 Gets an <see cref="T:QuickGraph.Concepts.Collections.IPortEnumerator"/> instance
4168 </summary>
4169 <returns>
4170 A <see cref="T:QuickGraph.Concepts.Collections.IPortEnumerator"/> instance.
4171 </returns>
4172 </member>
4173 <member name="T:QuickGraph.Concepts.Collections.IPortEnumerator">
4174 <summary>
4175 An <see cref="T:QuickGraph.Concepts.IPort"/> enumerator
4176 </summary>
4177 </member>
4178 <member name="P:QuickGraph.Concepts.Collections.IPortEnumerator.Current">
4179 <summary>
4180 Current <see cref="T:QuickGraph.Concepts.IPort"/>
4181 </summary>
4182 </member>
4183 <member name="T:QuickGraph.Concepts.Collections.IVertexPredecessorMatrix">
4184 <summary>
4185
4186 </summary>
4187 </member>
4188 <member name="M:QuickGraph.Concepts.Collections.IVertexPredecessorMatrix.Predecessor(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
4189 <summary>
4190
4191 </summary>
4192 <param name="source"></param>
4193 <param name="target"></param>
4194 <returns></returns>
4195 </member>
4196 <member name="M:QuickGraph.Concepts.Collections.IVertexPredecessorMatrix.SetPredecessor(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
4197 <summary>
4198
4199 </summary>
4200 <param name="source"></param>
4201 <param name="target"></param>
4202 <param name="predecessor"></param>
4203 </member>
4204 <member name="T:QuickGraph.Concepts.Collections.NamespaceDoc">
4205 <summary>
4206 The <b>QuickGraph.Concepts.Collections</b> defines strongly typed
4207 interface for iterating vertices and edges.
4208 </summary>
4209 </member>
4210 <member name="T:QuickGraph.Concepts.VertexEventArgs">
4211 <summary>
4212 Event argument that contains a <seealso cref="P:QuickGraph.Concepts.VertexEventArgs.Vertex"/>.
4213 </summary>
4214 </member>
4215 <member name="M:QuickGraph.Concepts.VertexEventArgs.#ctor(QuickGraph.Concepts.IVertex)">
4216 <summary>
4217 Builds a new event argument object
4218 </summary>
4219 <param name="v">vertex to store</param>
4220 </member>
4221 <member name="P:QuickGraph.Concepts.VertexEventArgs.Vertex">
4222 <summary>
4223 Vertex passed to the event
4224 </summary>
4225 </member>
4226 <member name="T:QuickGraph.Concepts.VertexEventHandler">
4227 <summary>
4228 Delegate that handles an event that sends a vertex.
4229 </summary>
4230 </member>
4231 <member name="T:QuickGraph.Concepts.EdgeEventArgs">
4232 <summary>
4233 Event argument that contains an <seealso cref="T:QuickGraph.Concepts.IEdge"/>.
4234 </summary>
4235 </member>
4236 <member name="M:QuickGraph.Concepts.EdgeEventArgs.#ctor(QuickGraph.Concepts.IEdge)">
4237 <summary>
4238 Create a new event argument
4239 </summary>
4240 <param name="e">edge to store</param>
4241 </member>
4242 <member name="P:QuickGraph.Concepts.EdgeEventArgs.Edge">
4243 <summary>
4244 Edge passed to the event
4245 </summary>
4246 </member>
4247 <member name="T:QuickGraph.Concepts.EdgeEventHandler">
4248 <summary>
4249 Delegate that handles an edge that sends a vertex.
4250 </summary>
4251 </member>
4252 <member name="T:QuickGraph.Concepts.EdgeEdgeEventArgs">
4253 <summary>
4254 Event argument that contains two <seealso cref="T:QuickGraph.Concepts.IEdge"/>.
4255 </summary>
4256 </member>
4257 <member name="M:QuickGraph.Concepts.EdgeEdgeEventArgs.#ctor(QuickGraph.Concepts.IEdge,QuickGraph.Concepts.IEdge)">
4258 <summary>
4259 Create a new event argument
4260 </summary>
4261 <param name="e">edge to store</param>
4262 <param name="targetEdge"></param>
4263 </member>
4264 <member name="P:QuickGraph.Concepts.EdgeEdgeEventArgs.TargetEdge">
4265 <summary>
4266 Edge passed to the event
4267 </summary>
4268 </member>
4269 <member name="T:QuickGraph.Concepts.EdgeEdgeEventHandler">
4270 <summary>
4271 Delegate that handles an edge that sends a vertex.
4272 </summary>
4273 </member>
4274 <member name="T:QuickGraph.Concepts.EdgePort">
4275 <summary>
4276 Edge port enumeration
4277 </summary>
4278 </member>
4279 <member name="F:QuickGraph.Concepts.EdgePort.Undefined">
4280 <summary>
4281 Unknown port
4282 </summary>
4283 </member>
4284 <member name="F:QuickGraph.Concepts.EdgePort.LowerLeft">
4285 <summary>
4286 Lower left port
4287 </summary>
4288 </member>
4289 <member name="F:QuickGraph.Concepts.EdgePort.LowerRight">
4290 <summary>
4291 Lower right port
4292 </summary>
4293 </member>
4294 <member name="F:QuickGraph.Concepts.EdgePort.UpperLeft">
4295 <summary>
4296 Upper left port
4297 </summary>
4298 </member>
4299 <member name="F:QuickGraph.Concepts.EdgePort.UpperRight">
4300 <summary>
4301 Upper right port
4302 </summary>
4303 </member>
4304 <member name="F:QuickGraph.Concepts.EdgePort.MiddleLeft">
4305 <summary>
4306 Middle left port
4307 </summary>
4308 </member>
4309 <member name="F:QuickGraph.Concepts.EdgePort.MiddleRight">
4310 <summary>
4311 Middle right port
4312 </summary>
4313 </member>
4314 <member name="F:QuickGraph.Concepts.EdgePort.MiddleTop">
4315 <summary>
4316 Middle top port
4317 </summary>
4318 </member>
4319 <member name="F:QuickGraph.Concepts.EdgePort.MiddleBottom">
4320 <summary>
4321 Middle bottom port
4322 </summary>
4323 </member>
4324 <member name="T:QuickGraph.Concepts.GraphColor">
4325 <summary>
4326 Colors used to mark the vertex and edges in the algorithms
4327 </summary>
4328 </member>
4329 <member name="F:QuickGraph.Concepts.GraphColor.White">
4330 <summary>
4331 White color, usually describes describes vertex.
4332 </summary>
4333 </member>
4334 <member name="F:QuickGraph.Concepts.GraphColor.Black">
4335 <summary>
4336 Black color, usually describes finished vertex.
4337 </summary>
4338 </member>
4339 <member name="F:QuickGraph.Concepts.GraphColor.Gray">
4340 <summary>
4341 Gray color
4342 </summary>
4343 </member>
4344 <member name="T:QuickGraph.Concepts.GraphColorConverter">
4345 <summary>
4346 Utility class for graph color conversion
4347 </summary>
4348 </member>
4349 <member name="M:QuickGraph.Concepts.GraphColorConverter.#ctor">
4350 <summary>
4351 No constructor
4352 </summary>
4353 </member>
4354 <member name="M:QuickGraph.Concepts.GraphColorConverter.Convert(QuickGraph.Concepts.GraphColor,System.Int32)">
4355 <summary>
4356 Converts GraphColor to System.Drawing.Color
4357 </summary>
4358 <param name="c">graph color to convert</param>
4359 <param name="alpha">alpha component</param>
4360 <returns>corresponding Color</returns>
4361 </member>
4362 <member name="M:QuickGraph.Concepts.GraphColorConverter.Convert(QuickGraph.Concepts.GraphColor)">
4363 <summary>
4364 Converts GraphColor to System.Drawing.Color
4365 </summary>
4366 <param name="c">graph color to convert</param>
4367 <returns>corresponding Color</returns>
4368 </member>
4369 <member name="T:QuickGraph.Concepts.IPort">
4370 <summary>
4371 A port represents an anchor between an edge and a vertex
4372 </summary>
4373 </member>
4374 <member name="P:QuickGraph.Concepts.IPort.ID">
4375 <summary>
4376 Port identification number
4377 </summary>
4378 </member>
4379 <member name="P:QuickGraph.Concepts.IPort.name">
4380 <summary>
4381 The name of the port
4382 </summary>
4383 </member>
4384 <member name="P:QuickGraph.Concepts.IPort.Parent">
4385 <summary>
4386 Gets or sets the parent vertex
4387 </summary>
4388 <value>
4389 The parent <see cref="T:QuickGraph.Concepts.IVertex"/> instance
4390 </value>
4391 </member>
4392 <member name="T:QuickGraph.Concepts.IPortEdge">
4393 <summary>
4394 An edge with ports attachement
4395 </summary>
4396 </member>
4397 <member name="P:QuickGraph.Concepts.IPortEdge.Source">
4398 <summary>
4399 Source vertex
4400 </summary>
4401 </member>
4402 <member name="P:QuickGraph.Concepts.IPortEdge.Target">
4403 <summary>
4404 Target vertex
4405 </summary>
4406 </member>
4407 <member name="P:QuickGraph.Concepts.IPortEdge.SourcePort">
4408 <summary>
4409 Source port
4410 </summary>
4411 </member>
4412 <member name="P:QuickGraph.Concepts.IPortEdge.TargetPort">
4413 <summary>
4414 Target port
4415 </summary>
4416 </member>
4417 <member name="T:QuickGraph.Concepts.IPortVertex">
4418 <summary>
4419 A <see cref="T:QuickGraph.Concepts.IVertex"/> with <see cref="T:QuickGraph.Concepts.IPort"/>.
4420 </summary>
4421 </member>
4422 <member name="T:QuickGraph.Concepts.IVertex">
4423 <summary>
4424 Vertex interface
4425 </summary>
4426 </member>
4427 <member name="P:QuickGraph.Concepts.IVertex.ID">
4428 <summary>
4429 Vertex unique identification number
4430 </summary>
4431 </member>
4432 <member name="P:QuickGraph.Concepts.IPortVertex.Ports">
4433 <summary>
4434 Gets a collection of <see cref="T:QuickGraph.Concepts.IPort"/> associated
4435 to the vertex
4436 </summary>
4437 <value>
4438 A <see cref="T:QuickGraph.Concepts.Collections.IPortCollection"/> of <see cref="T:QuickGraph.Concepts.IPort"/>
4439 instance attached to the vertex
4440 </value>
4441 </member>
4442 <member name="T:QuickGraph.Concepts.Modifications.IEdgeMutableGraph">
4443 <summary>
4444 </summary>
4445 </member>
4446 <member name="T:QuickGraph.Concepts.Modifications.IVertexMutableGraph">
4447 <summary>
4448 Defines a graph that can be modified by adding or removing vertices.
4449 </summary>
4450 </member>
4451 <member name="M:QuickGraph.Concepts.Modifications.IMutableGraph.Clear">
4452 <summary>
4453 Clears the graph.
4454 </summary>
4455 </member>
4456 <member name="M:QuickGraph.Concepts.Modifications.IVertexMutableGraph.AddVertex">
4457 <summary>
4458 Adds a new vertex to the graph.
4459 </summary>
4460 <remarks>
4461 Creates a new <see cref="T:QuickGraph.Concepts.IVertex"/> instance and adds it to the
4462 graph.
4463 </remarks>
4464 <returns>new <see cref="T:QuickGraph.Concepts.IVertex"/> instance</returns>
4465 </member>
4466 <member name="M:QuickGraph.Concepts.Modifications.IVertexMutableGraph.RemoveVertex(QuickGraph.Concepts.IVertex)">
4467 <summary>
4468 Remove u from the vertex set of the graph.
4469 Note that undefined behavior may result if there are edges
4470 remaining in the graph who's target is u.
4471
4472 Typically the ClearVertex function should be called first.
4473 </summary>
4474 <param name="u">vertex to clear</param>
4475 <exception cref="T:System.ArgumentNullException">u is a null reference</exception>
4476 </member>
4477 <member name="P:QuickGraph.Concepts.Modifications.IVertexMutableGraph.VertexProvider">
4478 <summary>
4479 Returns the vertex provider
4480 </summary>
4481 </member>
4482 <member name="M:QuickGraph.Concepts.Modifications.IEdgeMutableGraph.ClearVertex(QuickGraph.Concepts.IVertex)">
4483 <summary>
4484 Remove all edges to and from vertex u from the graph.
4485 </summary>
4486 <param name="u"></param>
4487 </member>
4488 <member name="M:QuickGraph.Concepts.Modifications.IEdgeMutableGraph.AddEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
4489 <summary>
4490 Inserts the edge (u,v) into the graph, and returns the new edge.
4491 </summary>
4492 <remarks>
4493 <para>
4494 This method attemps to insert the edge (u,v) into the graph,
4495 returning the inserted edge or a parrallel edge. If the insertion
4496 was not successful, the returned edge is null.
4497 </para>
4498 </remarks>
4499 </member>
4500 <member name="M:QuickGraph.Concepts.Modifications.IEdgeMutableGraph.RemoveEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
4501 <summary>
4502 Remove the edge (u,v) from the graph.
4503 If the graph allows parallel edges this remove all occurrences of
4504 (u,v).
4505 </summary>
4506 <param name="u">source vertex</param>
4507 <param name="v">target vertex</param>
4508 </member>
4509 <member name="M:QuickGraph.Concepts.Modifications.IEdgeMutableGraph.RemoveEdge(QuickGraph.Concepts.IEdge)">
4510 <summary>
4511 Removes the edge e
4512 </summary>
4513 <param name="e">edge to remove</param>
4514 <exception cref="T:System.ArgumentException">Edge not found</exception>
4515 </member>
4516 <member name="P:QuickGraph.Concepts.Modifications.IEdgeMutableGraph.EdgeProvider">
4517 <summary>
4518 Returns the vertex provider
4519 </summary>
4520 </member>
4521 <member name="T:QuickGraph.Concepts.Modifications.IMutableBidirectionalGraph">
4522 <summary>
4523 Description résumée de IMutableBidirectionalGraph.
4524 </summary>
4525 </member>
4526 <member name="T:QuickGraph.Concepts.Modifications.IMutableIncidenceGraph">
4527 <summary>
4528
4529 </summary>
4530 </member>
4531 <member name="M:QuickGraph.Concepts.Modifications.IMutableIncidenceGraph.RemoveOutEdgeIf(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.Predicates.IEdgePredicate)">
4532 <summary>
4533 Remove all the out-edges of vertex u for which the predicate pred
4534 returns true.
4535 </summary>
4536 <param name="u">vertex</param>
4537 <param name="pred">edge predicate</param>
4538 </member>
4539 <member name="M:QuickGraph.Concepts.Modifications.IMutableBidirectionalGraph.RemoveInEdgeIf(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.Predicates.IEdgePredicate)">
4540 <summary>
4541 Remove all the in-edges of vertex u for which the predicate pred
4542 returns true.
4543 </summary>
4544 <param name="u">vertex</param>
4545 <param name="pred">edge predicate</param>
4546 </member>
4547 <member name="T:QuickGraph.Concepts.Modifications.IMutableEdgeListGraph">
4548 <summary>
4549
4550 </summary>
4551 </member>
4552 <member name="M:QuickGraph.Concepts.Modifications.IMutableEdgeListGraph.RemoveEdgeIf(QuickGraph.Concepts.Predicates.IEdgePredicate)">
4553 <summary>
4554 Remove all the edges from graph g for which the predicate pred
4555 returns true.
4556 </summary>
4557 <param name="pred">edge predicate</param>
4558 </member>
4559 <member name="T:QuickGraph.Concepts.Modifications.IMutableTreeGraph">
4560 <summary>
4561 A mutable tree-like graph
4562 </summary>
4563 </member>
4564 <member name="M:QuickGraph.Concepts.Modifications.IMutableTreeGraph.AddChild(QuickGraph.Concepts.IVertex)">
4565 <summary>
4566 Adds a child vertex to the tree
4567 </summary>
4568 <param name="parent">parent vertex</param>
4569 <returns>created vertex</returns>
4570 <exception cref="T:System.ArgumentNullException">parent is a null reference</exception>
4571 <exception cref="T:QuickGraph.Exceptions.NonAcyclicGraphException">
4572 if <c>AllowCycles</c> is false and the edge creates a cycle
4573 </exception>
4574 </member>
4575 <member name="M:QuickGraph.Concepts.Modifications.IMutableTreeGraph.RemoveTree(QuickGraph.Concepts.IVertex)">
4576 <summary>
4577 Removes vertex and sub-tree
4578 </summary>
4579 <param name="root">vertex to remove</param>
4580 <exception cref="T:System.ArgumentNullException">v is a null reference</exception>
4581 <exception cref="T:QuickGraph.Exceptions.GraphNotStronglyConnectedException">
4582 Removing the vertex breaks the graph connectivity
4583 </exception>
4584 </member>
4585 <member name="P:QuickGraph.Concepts.Modifications.IMutableTreeGraph.AllowCycles">
4586 <summary>
4587 Gets a value indicating if the tree allows cycles
4588 </summary>
4589 <value>
4590 true if it allows cycle, false otherwise
4591 </value>
4592 </member>
4593 <member name="T:QuickGraph.Concepts.Modifications.IVertexAndEdgeMutableGraph">
4594 <summary>
4595 Fusion of <see cref="T:QuickGraph.Concepts.Modifications.IEdgeMutableGraph"/>
4596 and <see cref="T:QuickGraph.Concepts.Modifications.IVertexMutableGraph"/>.
4597 </summary>
4598 </member>
4599 <member name="T:QuickGraph.Concepts.Modifications.NamespaceDoc">
4600 <summary>
4601 <para>
4602 The <b>QuickGraph.Concepts.Modifications</b> namespace contains
4603 the interfaces that implement the <b>graph modification concepts</b>.
4604 </para>
4605 </summary>
4606 </member>
4607 <member name="T:QuickGraph.Concepts.Modifications.RandomGraph">
4608 <summary>
4609 Description résumée de RandomGraph.
4610 </summary>
4611 </member>
4612 <member name="M:QuickGraph.Concepts.Modifications.RandomGraph.#ctor">
4613 <summary>
4614 Empty constructor
4615 </summary>
4616 </member>
4617 <member name="M:QuickGraph.Concepts.Modifications.RandomGraph.Vertex(QuickGraph.Concepts.Traversals.IVertexListGraph,System.Random)">
4618 <summary>
4619 Picks a vertex randomly in the vertex list
4620 </summary>
4621 <param name="g">vertex list</param>
4622 <param name="rnd">random generator</param>
4623 <returns>randomaly chosen vertex</returns>
4624 </member>
4625 <member name="M:QuickGraph.Concepts.Modifications.RandomGraph.Vertex(QuickGraph.Concepts.Collections.IVertexEnumerable,System.Int32,System.Random)">
4626 <summary>
4627
4628 </summary>
4629 <param name="vertices"></param>
4630 <param name="count"></param>
4631 <param name="rnd"></param>
4632 <returns></returns>
4633 </member>
4634 <member name="M:QuickGraph.Concepts.Modifications.RandomGraph.Edge(QuickGraph.Concepts.Traversals.IEdgeListGraph,System.Random)">
4635 <summary>
4636 Picks an edge randomly in the edge list
4637 </summary>
4638 <param name="g">edge list</param>
4639 <param name="rnd">random generator</param>
4640 <returns>randomaly chosen edge</returns>
4641 </member>
4642 <member name="M:QuickGraph.Concepts.Modifications.RandomGraph.Edge(QuickGraph.Concepts.Collections.IEdgeEnumerable,System.Int32,System.Random)">
4643 <summary>
4644
4645 </summary>
4646 <param name="edges"></param>
4647 <param name="count"></param>
4648 <param name="rnd"></param>
4649 <returns></returns>
4650 </member>
4651 <member name="M:QuickGraph.Concepts.Modifications.RandomGraph.Graph(QuickGraph.Concepts.Modifications.IEdgeMutableGraph,System.Int32,System.Int32,System.Random,System.Boolean)">
4652 <summary>
4653 Generates a random graph
4654 </summary>
4655 <param name="g">Graph to fill</param>
4656 <param name="vertexCount">number of vertices</param>
4657 <param name="edgeCount">number of edges</param>
4658 <param name="rnd">random generator</param>
4659 <param name="selfEdges">self edges allowed</param>
4660 </member>
4661 <member name="T:QuickGraph.Concepts.MutableTraversals.IMutableBidirectionalVertexAndEdgeListGraph">
4662 <summary>
4663 A fusion of <see cref="!:IBidirectionalGraph"/>,
4664
4665 </summary>
4666 </member>
4667 <member name="T:QuickGraph.Concepts.MutableTraversals.IMutableVertexAndEdgeListGraph">
4668 <summary>
4669 Union of <see cref="T:QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph"/>,
4670 <see cref="T:QuickGraph.Concepts.MutableTraversals.IMutableVertexAndEdgeListGraph"/>
4671 </summary>
4672 </member>
4673 <member name="T:QuickGraph.Concepts.NamespaceDoc">
4674 <summary>
4675 <para>
4676 The <b>QuickGraph.Concepts</b> namespace contains all the interfaces
4677 that define the different graph concepts.
4678 </para>
4679 </summary>
4680 </member>
4681 <member name="T:QuickGraph.Concepts.Petri.IArc">
4682 <summary>
4683 A directed edge of a net which may connect a <see cref="T:QuickGraph.Concepts.Petri.IPlace"/>
4684 to a <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> or a <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> to
4685 a <see cref="T:QuickGraph.Concepts.Petri.IPlace"/>.
4686 </summary>
4687 <remarks>
4688 <para>
4689 Usually represented by an arrow.
4690 </para>
4691 </remarks>
4692 </member>
4693 <member name="P:QuickGraph.Concepts.Petri.IArc.IsInputArc">
4694 <summary>
4695 Gets or sets a value indicating if the <see cref="T:QuickGraph.Concepts.Petri.IArc"/>
4696 instance is a <strong>input arc.</strong>
4697 </summary>
4698 <remarks>
4699 <para>
4700 An arc that leads from an input <see cref="T:QuickGraph.Concepts.Petri.IPlace"/> to a
4701 <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> is called an <em>Input Arc</em> of
4702 the transition.
4703 </para>
4704 </remarks>
4705 </member>
4706 <member name="P:QuickGraph.Concepts.Petri.IArc.Place">
4707 <summary>
4708 Gets or sets the <see cref="T:QuickGraph.Concepts.Petri.IPlace"/> instance attached to the
4709 <see cref="T:QuickGraph.Concepts.Petri.IArc"/>.
4710 </summary>
4711 <value>
4712 The <see cref="T:QuickGraph.Concepts.Petri.IPlace"/> attached to the <see cref="T:QuickGraph.Concepts.Petri.IArc"/>.
4713 </value>
4714 <exception cref="T:System.ArgumentNullException">
4715 set property, value is a null reference (Nothing in Visual Basic).
4716 </exception>
4717 </member>
4718 <member name="P:QuickGraph.Concepts.Petri.IArc.Transition">
4719 <summary>
4720 Gets or sets the <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> instance attached to the
4721 <see cref="T:QuickGraph.Concepts.Petri.IArc"/>.
4722 </summary>
4723 <value>
4724 The <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> attached to the <see cref="T:QuickGraph.Concepts.Petri.IArc"/>.
4725 </value>
4726 <exception cref="T:System.ArgumentNullException">
4727 set property, value is a null reference (Nothing in Visual Basic).
4728 </exception>
4729 </member>
4730 <!-- Badly formed XML comment ignored for member "P:QuickGraph.Concepts.Petri.IArc.Annotation" -->
4731 <member name="T:QuickGraph.Concepts.Petri.IPetriNet">
4732 <summary>
4733 A High Level Petri Graph.
4734 </summary>
4735 <remarks>
4736 <para>
4737 This object is called a Petri Net in honour of Petri's work. In fact,
4738 it should be named High Level Petri Graph.
4739 </para>
4740 </remarks>
4741 </member>
4742 <member name="P:QuickGraph.Concepts.Petri.IPetriNet.Places">
4743 <summary>
4744 Gets a collection of <see cref="T:QuickGraph.Concepts.Petri.IPlace"/> instances.
4745 </summary>
4746 <value>
4747 A collection of <see cref="T:QuickGraph.Concepts.Petri.IPlace"/> instances.
4748 </value>
4749 </member>
4750 <member name="P:QuickGraph.Concepts.Petri.IPetriNet.Transitions">
4751 <summary>
4752 Gets a collection of <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> instances.
4753 </summary>
4754 <value>
4755 A collection of <see cref="T:QuickGraph.Concepts.Petri.ITransition"/> instances.
4756 </value>
4757 </member>
4758 <member name="P:QuickGraph.Concepts.Petri.IPetriNet.Arcs">
4759 <summary>
4760 Gets a collection of <see cref="T:QuickGraph.Concepts.Petri.IArc"/> instances.
4761 </summary>
4762 <value>
4763 A collection of <see cref="T:QuickGraph.Concepts.Petri.IArc"/> instances.
4764 </value>
4765 </member>
4766 <member name="T:QuickGraph.Concepts.Petri.IPetriVertex">
4767 <summary>
4768 A vertex (node) of a Petri Graph.
4769 </summary>
4770 </member>
4771 <member name="P:QuickGraph.Concepts.Petri.IPetriVertex.Name">
4772 <summary>
4773 Gets or sets the name of the node
4774 </summary>
4775 <value>
4776 A <see cref="T:System.String"/> representing the name of the node.
4777 </value>
4778 </member>
4779 <member name="T:QuickGraph.Concepts.Petri.IPlace">
4780 <summary>
4781 A Place in the HLPN framework
4782 </summary>
4783 <remarks>
4784 <para>
4785 A <see cref="!:Place"/> is characterized by a set of tokens, called the
4786 <see cref="P:QuickGraph.Concepts.Petri.IPlace.Marking"/> of the place. The place is <strong>typed</strong>
4787 by the <see cref="!:StrongType"/> instance. This means only object
4788 of <see cref="T:System.Type"/> assignable to <see cref="!:StrongType"/> can reside
4789 in the place.
4790 </para>
4791 <para>
4792 Usually represented by an ellipses (often circles).
4793 </para>
4794 </remarks>
4795 </member>
4796 <member name="T:QuickGraph.Concepts.Petri.ITransition">
4797 <summary>
4798 A node of a net, taken from the transition kind.
4799 </summary>
4800 <remarks>
4801 <para>
4802 Usually represented by a rectangle.
4803 </para>
4804 </remarks>
4805 </member>
4806 <member name="P:QuickGraph.Concepts.Petri.ITransition.Condition">
4807 <summary>
4808 A boolean expression associated with the transition
4809 </summary>
4810 </member>
4811 <member name="T:QuickGraph.Concepts.Predicates.IEdgePredicate">
4812 <summary>
4813 A predicate applied to an edge
4814 </summary>
4815 </member>
4816 <member name="M:QuickGraph.Concepts.Predicates.IEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
4817 <summary>
4818 Tests the predicate and returns the result
4819 </summary>
4820 <param name="e">edge to test</param>
4821 <returns>true if successful</returns>
4822 <exception cref="T:System.ArgumentNullException">e is null</exception>
4823 </member>
4824 <member name="T:QuickGraph.Concepts.Predicates.IVertexPredicate">
4825 <summary>
4826 A predicate applied to a vertex
4827 </summary>
4828 </member>
4829 <member name="M:QuickGraph.Concepts.Predicates.IVertexPredicate.Test(QuickGraph.Concepts.IVertex)">
4830 <summary>
4831 Tests the predicate and returns the result
4832 </summary>
4833 <param name="v">Vertex to test</param>
4834 <returns>true if successful</returns>
4835 <exception cref="T:System.ArgumentNullException">v is null</exception>
4836 </member>
4837 <member name="T:QuickGraph.Concepts.Providers.IEdgeProvider">
4838 <summary>
4839 A edge generator
4840 </summary>
4841 </member>
4842 <member name="M:QuickGraph.Concepts.Providers.IEdgeProvider.ProvideEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
4843 <summary>
4844 Returns an edge e=(u,v)
4845 </summary>
4846 </member>
4847 <member name="M:QuickGraph.Concepts.Providers.IEdgeProvider.UpdateEdge(QuickGraph.Concepts.IEdge)">
4848 <summary>
4849 Updates edge that has not been created with the provider
4850 </summary>
4851 <param name="v">vertex to update</param>
4852 </member>
4853 <member name="P:QuickGraph.Concepts.Providers.IEdgeProvider.EdgeType">
4854 <summary>
4855 The edge full type.
4856 </summary>
4857 </member>
4858 <member name="T:QuickGraph.Concepts.Providers.IVertexProvider">
4859 <summary>
4860 A vertex generator object
4861 </summary>
4862 </member>
4863 <member name="M:QuickGraph.Concepts.Providers.IVertexProvider.ProvideVertex">
4864 <summary>
4865 Generates a new vertex
4866 </summary>
4867 </member>
4868 <member name="M:QuickGraph.Concepts.Providers.IVertexProvider.UpdateVertex(QuickGraph.Concepts.IVertex)">
4869 <summary>
4870 Updates a vertex that has not been created with the provider
4871 </summary>
4872 <param name="v">vertex to update</param>
4873 </member>
4874 <member name="P:QuickGraph.Concepts.Providers.IVertexProvider.VertexType">
4875 <summary>
4876 The vertex full type.
4877 </summary>
4878 </member>
4879 <member name="T:QuickGraph.Concepts.Providers.NamespaceDoc">
4880 <summary>
4881 <para>
4882 The <b>QuickGraph.Concepts.Providers</b> namespace contains
4883 the interfaces that define the vertex and edge provider classes.
4884 </para>
4885 </summary>
4886 </member>
4887 <member name="T:QuickGraph.Concepts.Serialization.IGraphSerializable">
4888 <summary>
4889 A serializable graph structure (graph, vertex or edge)
4890 </summary>
4891 </member>
4892 <member name="M:QuickGraph.Concepts.Serialization.IGraphSerializable.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
4893 <summary>
4894 Adds data to serialization info
4895 </summary>
4896 <param name="info">data holder</param>
4897 <exception cref="T:System.ArgumentNullException">info is null</exception>
4898 <exception cref="T:System.ArgumentException">info is not serializing</exception>
4899 </member>
4900 <member name="T:QuickGraph.Concepts.Serialization.IGraphDeSerializable">
4901 <summary>
4902 Defines an instance that can be deserialized from a
4903 <see cref="T:QuickGraph.Concepts.Serialization.IGraphSerializationInfo"/> instance.
4904 </summary>
4905 <remarks>
4906 </remarks>
4907 </member>
4908 <member name="M:QuickGraph.Concepts.Serialization.IGraphDeSerializable.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
4909 <summary>
4910 Reads data from serialization info
4911 </summary>
4912 <param name="info">data holder</param>
4913 <exception cref="T:System.ArgumentNullException">info is a null reference</exception>
4914 <exception cref="T:System.ArgumentException">info is serializing</exception>
4915 </member>
4916 <member name="T:QuickGraph.Concepts.Serialization.IGraphSerializationInfo">
4917 <summary>
4918 A class for adding and retreiving atomic data.
4919 </summary>
4920 </member>
4921 <member name="M:QuickGraph.Concepts.Serialization.IGraphSerializationInfo.Add(System.String,System.Object)">
4922 <summary>
4923 Adds a new key-value pair
4924 </summary>
4925 <param name="key">value identifier</param>
4926 <param name="value">value</param>
4927 <exception cref="T:System.ArgumentNullException">key is a null reference</exception>
4928 </member>
4929 <member name="M:QuickGraph.Concepts.Serialization.IGraphSerializationInfo.Contains(System.String)">
4930 <summary>
4931 Gets a value indicating if the key is in the entry collection
4932 </summary>
4933 <param name="key">key to test</param>
4934 <returns>true if key is in the dictionary, false otherwise</returns>
4935 <exception cref="T:System.ArgumentNullException">key is a null reference</exception>
4936 </member>
4937 <member name="P:QuickGraph.Concepts.Serialization.IGraphSerializationInfo.IsSerializing">
4938 <summary>
4939 Get a value indicating if the object is serializing
4940 </summary>
4941 <value>
4942 true if serializing, false if deserializing
4943 </value>
4944 </member>
4945 <member name="P:QuickGraph.Concepts.Serialization.IGraphSerializationInfo.Item(System.String)">
4946 <summary>
4947 Gets or sets a value from a key
4948 </summary>
4949 <param name="key">value identifier</param>
4950 <returns>
4951 value associated with the key. If the key is not present
4952 in the data, null value is returned
4953 </returns>
4954 <exception cref="T:System.ArgumentNullException">
4955 get,set property, key is a null reference
4956 </exception>
4957 </member>
4958 <member name="T:QuickGraph.Concepts.Serialization.ISerializableEdgeListGraph">
4959 <summary>
4960 Summary description for ISerializableEdgeListGraph.
4961 </summary>
4962 </member>
4963 <member name="M:QuickGraph.Concepts.Serialization.ISerializableEdgeListGraph.AddEdge(QuickGraph.Concepts.IEdge)">
4964 <summary>
4965 Adds an edge to the graph
4966 </summary>
4967 <param name="e">edge to add</param>
4968 </member>
4969 <member name="T:QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph">
4970 <summary>
4971 Union of the <see cref="T:QuickGraph.Concepts.Traversals.IVertexListGraph"/>
4972 , <see cref="T:QuickGraph.Concepts.Modifications.IVertexMutableGraph"/> and
4973 <see cref="T:QuickGraph.Concepts.Modifications.IEdgeMutableGraph"/>
4974 interfaces.
4975 </summary>
4976 </member>
4977 <member name="M:QuickGraph.Concepts.Serialization.ISerializableVertexListGraph.AddVertex(QuickGraph.Concepts.IVertex)">
4978 <summary>
4979 Add a vertex to the graph
4980 </summary>
4981 <param name="v">vertex to add</param>
4982 </member>
4983 <member name="T:QuickGraph.Concepts.Traversals.IBidirectionalVertexAndEdgeListGraph">
4984 <summary>
4985 Summary description for IBidirectionalVertexAndEdgeListGraph.
4986 </summary>
4987 </member>
4988 <member name="T:QuickGraph.Concepts.Traversals.IBidirectionalVertexListGraph">
4989 <summary>
4990 A fusion of <see cref="T:QuickGraph.Concepts.Traversals.IBidirectionalGraph"/> and
4991 <see cref="T:QuickGraph.Concepts.Traversals.IVertexListGraph"/>.
4992 </summary>
4993 </member>
4994 <member name="T:QuickGraph.Concepts.Traversals.IClusteredGraph">
4995 <summary>
4996 A graph with clusters.
4997 </summary>
4998 </member>
4999 <member name="M:QuickGraph.Concepts.Traversals.IClusteredGraph.AddCluster">
5000 <summary>
5001 Adds a new cluster to the graph.
5002 </summary>
5003 <returns>Added cluster</returns>
5004 </member>
5005 <member name="M:QuickGraph.Concepts.Traversals.IClusteredGraph.RemoveCluster(QuickGraph.Concepts.Traversals.IClusteredGraph)">
5006 <summary>
5007 Removes a cluster from the graph
5008 </summary>
5009 <param name="g">cluster to remove</param>
5010 <exception cref="T:System.ArgumentNullException">g is null</exception>
5011 </member>
5012 <member name="P:QuickGraph.Concepts.Traversals.IClusteredGraph.Clusters">
5013 <summary>
5014 Gets an enumerable collection of <see cref="T:QuickGraph.Concepts.Traversals.IClusteredGraph"/>.
5015 </summary>
5016 </member>
5017 <member name="P:QuickGraph.Concepts.Traversals.IClusteredGraph.ClustersCount">
5018 <summary>
5019 Gets the number of clusters
5020 </summary>
5021 <remarks>
5022 Number of clusters.
5023 </remarks>
5024 </member>
5025 <member name="P:QuickGraph.Concepts.Traversals.IClusteredGraph.Colapsed">
5026 <summary>
5027 Gets a value indicating wheter the cluster is collapsed
5028 </summary>
5029 <value>
5030 true if the cluster is colapsed; otherwize, false.
5031 </value>
5032 </member>
5033 <member name="T:QuickGraph.Concepts.Traversals.IFilteredBidirectionalGraph">
5034 <summary>
5035 A bidirectional graph that supports filtered traversals
5036 </summary>
5037 </member>
5038 <member name="T:QuickGraph.Concepts.Traversals.IFilteredIncidenceGraph">
5039 <summary>
5040 An incidence graph that supports filtered traversals
5041 </summary>
5042 </member>
5043 <member name="M:QuickGraph.Concepts.Traversals.IFilteredIncidenceGraph.SelectSingleOutEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.Predicates.IEdgePredicate)">
5044 <summary>
5045 Returns the first out-edge that matches the predicate
5046 </summary>
5047 <param name="v"></param>
5048 <param name="ep">Edge predicate</param>
5049 <returns>null if not found, otherwize the first Edge that
5050 matches the predicate.</returns>
5051 <exception cref="T:System.ArgumentNullException">v or ep is null</exception>
5052 </member>
5053 <member name="M:QuickGraph.Concepts.Traversals.IFilteredIncidenceGraph.SelectOutEdges(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.Predicates.IEdgePredicate)">
5054 <summary>
5055 Returns the collection of out-edges that matches the predicate
5056 </summary>
5057 <param name="v"></param>
5058 <param name="ep">Edge predicate</param>
5059 <returns>enumerable colleciton of vertices that matches the
5060 criteron</returns>
5061 <exception cref="T:System.ArgumentNullException">v or ep is null</exception>
5062 </member>
5063 <member name="M:QuickGraph.Concepts.Traversals.IFilteredBidirectionalGraph.SelectSingleInEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.Predicates.IEdgePredicate)">
5064 <summary>
5065 Returns the first in-edge that matches the predicate
5066 </summary>
5067 <param name="v"></param>
5068 <param name="ep">Edge predicate</param>
5069 <returns>null if not found, otherwize the first Edge that
5070 matches the predicate.</returns>
5071 <exception cref="T:System.ArgumentNullException">v or ep is null</exception>
5072 </member>
5073 <member name="M:QuickGraph.Concepts.Traversals.IFilteredBidirectionalGraph.SelectInEdges(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.Predicates.IEdgePredicate)">
5074 <summary>
5075 Returns the collection of in-edges that matches the predicate
5076 </summary>
5077 <param name="v"></param>
5078 <param name="ep">Edge predicate</param>
5079 <returns>enumerable colleciton of vertices that matches the
5080 criteron</returns>
5081 <exception cref="T:System.ArgumentNullException">v or ep is null</exception>
5082 </member>
5083 <member name="T:QuickGraph.Concepts.Traversals.IFilteredEdgeListGraph">
5084 <summary>
5085 A edge list graph that supports filtered traversals
5086 </summary>
5087 </member>
5088 <member name="M:QuickGraph.Concepts.Traversals.IFilteredEdgeListGraph.SelectSingleEdge(QuickGraph.Concepts.Predicates.IEdgePredicate)">
5089 <summary>
5090 Returns the first Edge that matches the predicate
5091 </summary>
5092 <param name="vp">Edge predicate</param>
5093 <returns>null if not found, otherwize the first Edge that
5094 matches the predicate.</returns>
5095 <exception cref="T:System.ArgumentNullException">vp is null</exception>
5096 </member>
5097 <member name="M:QuickGraph.Concepts.Traversals.IFilteredEdgeListGraph.SelectEdges(QuickGraph.Concepts.Predicates.IEdgePredicate)">
5098 <summary>
5099 Returns the collection of edges that matches the predicate
5100 </summary>
5101 <param name="vp">Edge predicate</param>
5102 <returns>enumerable colleciton of vertices that matches the
5103 criteron</returns>
5104 <exception cref="T:System.ArgumentNullException">vp is null</exception>
5105 </member>
5106 <member name="T:QuickGraph.Concepts.Traversals.IFilteredVertexAndEdgeListGraph">
5107 <summary>
5108 Union of <see cref="T:QuickGraph.Concepts.Traversals.IFilteredVertexListGraph"/>,
5109 <see cref="T:QuickGraph.Concepts.Traversals.IFilteredEdgeListGraph"/> and <see cref="T:QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph"/>.
5110 </summary>
5111 </member>
5112 <member name="T:QuickGraph.Concepts.Traversals.IFilteredVertexListGraph">
5113 <summary>
5114 A vertex list graph that supports filtered traversals
5115 </summary>
5116 </member>
5117 <member name="M:QuickGraph.Concepts.Traversals.IFilteredVertexListGraph.SelectSingleVertex(QuickGraph.Concepts.Predicates.IVertexPredicate)">
5118 <summary>
5119 Returns the first vertex that matches the predicate
5120 </summary>
5121 <param name="vp">vertex predicate</param>
5122 <returns>null if not found, otherwize the first vertex that
5123 matches the predicate.</returns>
5124 <exception cref="T:System.ArgumentNullException">vp is null</exception>
5125 </member>
5126 <member name="M:QuickGraph.Concepts.Traversals.IFilteredVertexListGraph.SelectVertices(QuickGraph.Concepts.Predicates.IVertexPredicate)">
5127 <summary>
5128 Returns the collection of vertices that matches the predicate
5129 </summary>
5130 <param name="vp">vertex predicate</param>
5131 <returns>enumerable colleciton of vertices that matches the
5132 criteron</returns>
5133 <exception cref="T:System.ArgumentNullException">vp is null</exception>
5134 </member>
5135 <member name="T:QuickGraph.Concepts.Traversals.ITreeGraph">
5136 <summary>
5137 A tree-like interface definition
5138 </summary>
5139 <remarks>
5140 <para>
5141 This interface defines a DOM like tree node structure.
5142 </para>
5143 <para>
5144 Graphs used with this interface must be directed, not
5145 allowing parrallel edges. However, they can be cylic
5146 but the in-degree of each vertex must be equal to 1.
5147 </para>
5148 </remarks>
5149 </member>
5150 <member name="M:QuickGraph.Concepts.Traversals.ITreeGraph.ParentVertex(QuickGraph.Concepts.IVertex)">
5151 <summary>
5152 Gets the <see cref="T:QuickGraph.Concepts.IVertex"/> parent.
5153 </summary>
5154 <param name="v">current vertex</param>
5155 <returns>
5156 parent vertex if any, null reference otherwize
5157 </returns>
5158 <exception cref="T:System.ArgumentNullException">
5159 <paramref name="v"/> is a null reference
5160 </exception>
5161 <exception cref="T:QuickGraph.Exceptions.MultipleInEdgeException">
5162 <paramref name="v"/> has multiple in-edges
5163 </exception>
5164 </member>
5165 <member name="M:QuickGraph.Concepts.Traversals.ITreeGraph.FirstChild(QuickGraph.Concepts.IVertex)">
5166 <summary>
5167 Gets the first adjacent vertex
5168 </summary>
5169 <param name="v">current vertex</param>
5170 <returns>first out-vertex</returns>
5171 <exception cref="T:System.ArgumentNullException">
5172 <paramref name="v"/> is a null reference
5173 </exception>
5174 </member>
5175 <member name="M:QuickGraph.Concepts.Traversals.ITreeGraph.LastChild(QuickGraph.Concepts.IVertex)">
5176 <summary>
5177
5178 </summary>
5179 <param name="v"></param>
5180 <returns></returns>
5181 <exception cref="T:System.ArgumentNullException">
5182 <paramref name="v"/> is a null reference
5183 </exception>
5184 </member>
5185 <member name="M:QuickGraph.Concepts.Traversals.ITreeGraph.HasChildVertices(QuickGraph.Concepts.IVertex)">
5186 <summary>
5187 Gets a value indicating if the <see cref="T:QuickGraph.Concepts.IVertex"/> has out-edges
5188 </summary>
5189 <param name="v"><see cref="T:QuickGraph.Concepts.IVertex"/> to test</param>
5190 <returns>true if <paramref name="v"/> has out-edges.</returns>
5191 <exception cref="T:System.ArgumentNullException">
5192 <paramref name="v"/> is a null reference
5193 </exception>
5194 </member>
5195 <member name="M:QuickGraph.Concepts.Traversals.ITreeGraph.ChildVertices(QuickGraph.Concepts.IVertex)">
5196 <summary>
5197 Gets an enumerable collection of child <see cref="T:QuickGraph.Concepts.IVertex"/>
5198 </summary>
5199 <param name="v">current <see cref="T:QuickGraph.Concepts.IVertex"/></param>
5200 <returns>An enumerable collection of adjacent vertices</returns>
5201 <exception cref="T:System.ArgumentNullException">
5202 <paramref name="v"/> is a null reference
5203 </exception>
5204 </member>
5205 <member name="T:QuickGraph.Concepts.Traversals.NamespaceDoc">
5206 <summary>
5207 <para>
5208 The <b>QuickGraph.Concepts.Traversals</b> namespace contains
5209 the interfaces that implement the <b>graph traversal concepts</b>.
5210 </para>
5211 </summary>
5212 </member>
5213 <member name="T:QuickGraph.Concepts.Traversals.Traversal">
5214 <summary>
5215 A small helper class for traversals
5216 </summary>
5217 </member>
5218 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstVertexIf(QuickGraph.Concepts.Collections.IVertexEnumerable,QuickGraph.Concepts.Predicates.IVertexPredicate)">
5219 <summary>
5220 Returns the first vertex of the enumerable that matches the predicate.
5221 </summary>
5222 <param name="vertices">enumerable collection of <see cref="T:QuickGraph.Concepts.IVertex"/></param>
5223 <param name="pred">vertex predicate</param>
5224 <returns>first vertex if any, otherwise a null reference</returns>
5225 </member>
5226 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstVertex(QuickGraph.Concepts.Collections.IVertexEnumerable)">
5227 <summary>
5228 Returns the first vertex of the enumerable
5229 </summary>
5230 <param name="vertices">enumerable collection of <see cref="T:QuickGraph.Concepts.IVertex"/></param>
5231 <returns>first vertex if any, otherwise a null reference</returns>
5232 </member>
5233 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstVertex(QuickGraph.Concepts.Traversals.IVertexListGraph)">
5234 <summary>
5235 Returns the first vertex of the graph
5236 </summary>
5237 <param name="g">graph</param>
5238 <returns>first vertex if any, otherwise a null reference</returns>
5239 </member>
5240 <member name="M:QuickGraph.Concepts.Traversals.Traversal.LastVertex(QuickGraph.Concepts.Collections.IVertexEnumerable)">
5241 <summary>
5242 Returns the first vertex of the enumerable
5243 </summary>
5244 <param name="vertices">enumerable collection of <see cref="T:QuickGraph.Concepts.IVertex"/></param>
5245 <returns>first vertex if any, otherwise a null reference</returns>
5246 </member>
5247 <member name="M:QuickGraph.Concepts.Traversals.Traversal.LastVertex(QuickGraph.Concepts.Traversals.IVertexListGraph)">
5248 <summary>
5249 Returns the last vertex of the graph
5250 </summary>
5251 <param name="g">graph</param>
5252 <returns>last vertex if any, otherwise a null reference</returns>
5253 </member>
5254 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstEdge(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
5255 <summary>
5256 Returns the first edge of the graph
5257 </summary>
5258 <param name="edges">graph</param>
5259 <returns>first edge if any, otherwise a null reference</returns>
5260 </member>
5261 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstEdge(QuickGraph.Concepts.Traversals.IEdgeListGraph)">
5262 <summary>
5263 Returns the first edge of the graph
5264 </summary>
5265 <param name="g">graph</param>
5266 <returns>first edge if any, otherwise a null reference</returns>
5267 </member>
5268 <member name="M:QuickGraph.Concepts.Traversals.Traversal.LastEdge(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
5269 <summary>
5270 Returns the last edge of the edge collection
5271 </summary>
5272 <param name="edges">edge collection</param>
5273 <returns>last edge if any, otherwise a null reference</returns>
5274 </member>
5275 <member name="M:QuickGraph.Concepts.Traversals.Traversal.LastEdge(QuickGraph.Concepts.Traversals.IEdgeListGraph)">
5276 <summary>
5277 Returns the last edge of the graph
5278 </summary>
5279 <param name="g">graph</param>
5280 <returns>last edge if any, otherwise a null reference</returns>
5281 </member>
5282 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstTargetVertex(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
5283 <summary>
5284 Returns the first vertex of the enumerable
5285 </summary>
5286 <param name="edges">enumerable collection of <see cref="T:QuickGraph.Concepts.IEdge"/></param>
5287 <returns>first target vertex if any, otherwise a null reference</returns>
5288 </member>
5289 <member name="M:QuickGraph.Concepts.Traversals.Traversal.FirstSourceVertex(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
5290 <summary>
5291 Returns the first source vertex of the enumerable
5292 </summary>
5293 <param name="edges">enumerable collection of <see cref="T:QuickGraph.Concepts.IEdge"/></param>
5294 <returns>first source vertex if any, otherwise a null reference</returns>
5295 </member>
5296 <member name="M:QuickGraph.Concepts.Traversals.Traversal.LastTargetVertex(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
5297 <summary>
5298 Returns the last vertex of the enumerable
5299 </summary>
5300 <param name="edges">enumerable collection of <see cref="T:QuickGraph.Concepts.IEdge"/></param>
5301 <returns>last target vertex if any, otherwise a null reference</returns>
5302 </member>
5303 <member name="M:QuickGraph.Concepts.Traversals.Traversal.LastSourceVertex(QuickGraph.Concepts.Collections.IEdgeEnumerable)">
5304 <summary>
5305 Returns the last source vertex of the enumerable
5306 </summary>
5307 <param name="edges">enumerable collection of <see cref="T:QuickGraph.Concepts.IEdge"/></param>
5308 <returns>last source vertex if any, otherwise a null reference</returns>
5309 </member>
5310 <member name="T:QuickGraph.Concepts.Visitors.IDistanceRecorderVisitor">
5311 <summary>
5312 A distance recorder visitor
5313 </summary>
5314 </member>
5315 <member name="M:QuickGraph.Concepts.Visitors.IDistanceRecorderVisitor.InitializeVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5316 <summary>
5317
5318 </summary>
5319 <param name="sender"></param>
5320 <param name="args"></param>
5321 </member>
5322 <member name="M:QuickGraph.Concepts.Visitors.IDistanceRecorderVisitor.DiscoverVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5323 <summary>
5324
5325 </summary>
5326 <param name="sender"></param>
5327 <param name="args"></param>
5328 </member>
5329 <member name="M:QuickGraph.Concepts.Visitors.IDistanceRecorderVisitor.TreeEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5330 <summary>
5331
5332 </summary>
5333 <param name="sender"></param>
5334 <param name="args"></param>
5335 </member>
5336 <member name="T:QuickGraph.Concepts.Visitors.IEdgeColorizerVisitor">
5337 <summary>
5338 Summary description for IEdgeColorizerVisitor.
5339 </summary>
5340 </member>
5341 <member name="M:QuickGraph.Concepts.Visitors.IEdgeColorizerVisitor.InitializeEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5342 <summary>
5343
5344 </summary>
5345 <param name="sender"></param>
5346 <param name="args"></param>
5347 </member>
5348 <member name="M:QuickGraph.Concepts.Visitors.IEdgeColorizerVisitor.TreeEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5349 <summary>
5350
5351 </summary>
5352 <param name="sender"></param>
5353 <param name="args"></param>
5354 </member>
5355 <member name="M:QuickGraph.Concepts.Visitors.IEdgeColorizerVisitor.FinishEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5356 <summary>
5357
5358 </summary>
5359 <param name="sender"></param>
5360 <param name="args"></param>
5361 </member>
5362 <member name="T:QuickGraph.Concepts.Visitors.IEdgePredecessorRecorderVisitor">
5363 <summary>
5364 Visitor that records the edge predecessor from a vertex.
5365 </summary>
5366 </member>
5367 <member name="M:QuickGraph.Concepts.Visitors.IEdgePredecessorRecorderVisitor.InitializeEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5368 <summary>
5369 Not used
5370 </summary>
5371 <param name="sender"></param>
5372 <param name="args"></param>
5373 </member>
5374 <member name="M:QuickGraph.Concepts.Visitors.IEdgePredecessorRecorderVisitor.DiscoverTreeEdge(System.Object,QuickGraph.Concepts.EdgeEdgeEventArgs)">
5375 <summary>
5376 Records edge predecessor
5377 </summary>
5378 </member>
5379 <member name="M:QuickGraph.Concepts.Visitors.IEdgePredecessorRecorderVisitor.FinishEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5380 <summary>
5381 Records end path edges
5382 </summary>
5383 <param name="sender"></param>
5384 <param name="args"></param>
5385 </member>
5386 <member name="T:QuickGraph.Concepts.Visitors.IPredecessorRecorderVisitor">
5387 <summary>
5388 Visitor that records the edge predecessor from a vertex.
5389 </summary>
5390 </member>
5391 <member name="M:QuickGraph.Concepts.Visitors.IPredecessorRecorderVisitor.TreeEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5392 <summary>
5393 Predecessor record
5394 </summary>
5395 <param name="sender"></param>
5396 <param name="args"></param>
5397 </member>
5398 <member name="M:QuickGraph.Concepts.Visitors.IPredecessorRecorderVisitor.FinishVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5399 <summary>
5400 Finished a vertex exploration
5401 </summary>
5402 <param name="sender"></param>
5403 <param name="args"></param>
5404 </member>
5405 <member name="T:QuickGraph.Concepts.Visitors.ITimeStamperVisitor">
5406 <summary>
5407 Description résumée de ITimeStamperVisitior.
5408 </summary>
5409 </member>
5410 <member name="M:QuickGraph.Concepts.Visitors.ITimeStamperVisitor.DiscoverVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5411 <summary>
5412
5413 </summary>
5414 <param name="sender"></param>
5415 <param name="args"></param>
5416 </member>
5417 <member name="M:QuickGraph.Concepts.Visitors.ITimeStamperVisitor.FinishVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5418 <summary>
5419
5420 </summary>
5421 <param name="sender"></param>
5422 <param name="args"></param>
5423 </member>
5424 <member name="T:QuickGraph.Concepts.Visitors.ITreeEdgeBuilderVisitor">
5425 <summary>
5426 Tree edge visitor
5427 </summary>
5428 </member>
5429 <member name="M:QuickGraph.Concepts.Visitors.ITreeEdgeBuilderVisitor.TreeEdge(System.Object,QuickGraph.Concepts.EdgeEventArgs)">
5430 <summary>
5431
5432 </summary>
5433 <param name="sender"></param>
5434 <param name="args"></param>
5435 </member>
5436 <member name="T:QuickGraph.Concepts.Visitors.IVertexColorizerVisitor">
5437 <summary>
5438 A vertex colorizer visitor
5439 </summary>
5440 </member>
5441 <member name="M:QuickGraph.Concepts.Visitors.IVertexColorizerVisitor.InitializeVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5442 <summary>
5443
5444 </summary>
5445 <param name="sender"></param>
5446 <param name="args"></param>
5447 </member>
5448 <member name="M:QuickGraph.Concepts.Visitors.IVertexColorizerVisitor.DiscoverVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5449 <summary>
5450
5451 </summary>
5452 <param name="sender"></param>
5453 <param name="args"></param>
5454 </member>
5455 <member name="M:QuickGraph.Concepts.Visitors.IVertexColorizerVisitor.FinishVertex(System.Object,QuickGraph.Concepts.VertexEventArgs)">
5456 <summary>
5457
5458 </summary>
5459 <param name="sender"></param>
5460 <param name="args"></param>
5461 </member>
5462 <member name="T:QuickGraph.Concepts.Visitors.NamespaceDoc">
5463 <summary>
5464 <para>
5465 The <b>QuickGraph.Concepts.Visitors</b> namespace contains
5466 interfaces that define "classic" visitors.
5467 </para>
5468 </summary>
5469 </member>
5470 <member name="T:QuickGraph.CustomEdge">
5471 <summary>
5472 An edge that can hold a value
5473 </summary>
5474 </member>
5475 <member name="T:QuickGraph.Edge">
5476 <summary>
5477 A graph edge
5478 </summary>
5479 <remarks>
5480 This class represents a directed edge. It links
5481 a source <seealso cref="T:QuickGraph.Vertex"/> to a target <seealso cref="T:QuickGraph.Vertex"/>.
5482
5483 The source and target vertices can be accessed as properties.
5484 </remarks>
5485 <example>
5486 This sample shows a basic usage of an edge:
5487 <code>
5488 Vertex v; // vertex
5489 foreach(Edge e in v.InEdges)
5490 {
5491 Console.WriteLine("{0} -> {1}",
5492 e.Source.GetHashCode(),
5493 e.Target.GetHashCode()
5494 );
5495 }
5496 </code>
5497 </example>
5498 </member>
5499 <member name="M:QuickGraph.Edge.#ctor">
5500 <summary>
5501 Empty Method. Used for serialization.
5502 </summary>
5503 </member>
5504 <member name="M:QuickGraph.Edge.#ctor(System.Int32,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
5505 <summary>
5506 Builds an edge from source to target
5507 </summary>
5508 <param name="id">unique identification number</param>
5509 <param name="source">Source vertex</param>
5510 <param name="target">Target vertex</param>
5511 <exception cref="T:System.ArgumentNullException">Source or Target is null</exception>
5512 </member>
5513 <member name="M:QuickGraph.Edge.op_LessThan(QuickGraph.Edge,QuickGraph.Edge)">
5514 <summary>
5515
5516 </summary>
5517 <param name="e1"></param>
5518 <param name="e2"></param>
5519 <returns></returns>
5520 </member>
5521 <member name="M:QuickGraph.Edge.op_GreaterThan(QuickGraph.Edge,QuickGraph.Edge)">
5522 <summary>
5523
5524 </summary>
5525 <param name="e1"></param>
5526 <param name="e2"></param>
5527 <returns></returns>
5528 </member>
5529 <member name="M:QuickGraph.Edge.Equals(System.Object)">
5530 <summary>
5531
5532 </summary>
5533 <param name="obj"></param>
5534 <returns></returns>
5535 </member>
5536 <member name="M:QuickGraph.Edge.CompareTo(QuickGraph.Edge)">
5537 <summary>
5538 Compares two edges
5539 </summary>
5540 <param name="obj">Edge to compare</param>
5541 <returns></returns>
5542 <exception cref="T:System.ArgumentException">obj is not of type Edge.</exception>
5543 </member>
5544 <member name="M:QuickGraph.Edge.ToString">
5545 <summary>
5546 Converts to string.
5547 </summary>
5548 <returns></returns>
5549 </member>
5550 <member name="M:QuickGraph.Edge.ToString(System.IFormatProvider)">
5551 <summary>
5552 Converts to string by returning the formatted ID
5553 </summary>
5554 <param name="provider"></param>
5555 <returns></returns>
5556 </member>
5557 <member name="M:QuickGraph.Edge.GetHashCode">
5558 <summary>
5559 Hash code, using ID
5560 </summary>
5561 <returns></returns>
5562 </member>
5563 <member name="M:QuickGraph.Edge.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
5564 <summary>
5565 Adds nothing to serialization info
5566 </summary>
5567 <param name="info">data holder</param>
5568 <exception cref="T:System.ArgumentNullException">info is null</exception>
5569 <exception cref="T:System.ArgumentException">info is not serializing</exception>
5570 </member>
5571 <member name="M:QuickGraph.Edge.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
5572 <summary>
5573 Reads no data from serialization info
5574 </summary>
5575 <param name="info">data holder</param>
5576 <exception cref="T:System.ArgumentNullException">info is null</exception>
5577 <exception cref="T:System.ArgumentException">info is serializing</exception>
5578 </member>
5579 <member name="P:QuickGraph.Edge.ID">
5580 <summary>
5581 Edge unique identification number
5582 </summary>
5583 </member>
5584 <member name="P:QuickGraph.Edge.Source">
5585 <summary>
5586 Source vertex
5587 </summary>
5588 </member>
5589 <member name="P:QuickGraph.Edge.SourceID">
5590 <summary>
5591 Source vertex id, for serialization
5592 </summary>
5593 </member>
5594 <member name="P:QuickGraph.Edge.Target">
5595 <summary>
5596 Target Vertex
5597 </summary>
5598 </member>
5599 <member name="P:QuickGraph.Edge.TargetID">
5600 <summary>
5601 Source vertex id, for serialization
5602 </summary>
5603 </member>
5604 <member name="M:QuickGraph.CustomEdge.#ctor(System.Int32,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
5605 <summary>
5606 Default constructor
5607 </summary>
5608 <remarks>
5609 This constructors defaults the value to null
5610 </remarks>
5611 <param name="id">unique edge identification number</param>
5612 <param name="source">source vertex</param>
5613 <param name="target">target vertex</param>
5614 </member>
5615 <member name="P:QuickGraph.CustomEdge.Value">
5616 <summary>
5617 associated property value
5618 </summary>
5619 </member>
5620 <member name="T:QuickGraph.CustomVertex">
5621 <summary>
5622 A vertex that can hold a value
5623 </summary>
5624 </member>
5625 <member name="T:QuickGraph.Vertex">
5626 <summary>
5627 A Graph Vertex.
5628 </summary>
5629 </member>
5630 <member name="M:QuickGraph.Vertex.#ctor">
5631 <summary>
5632 Default constructor. Used for serialization.
5633 </summary>
5634 </member>
5635 <member name="M:QuickGraph.Vertex.#ctor(System.Int32)">
5636 <summary>
5637 Builds a new vertex
5638 </summary>
5639 </member>
5640 <member name="M:QuickGraph.Vertex.op_LessThan(QuickGraph.Vertex,QuickGraph.Vertex)">
5641 <summary>
5642
5643 </summary>
5644 <param name="v1"></param>
5645 <param name="v2"></param>
5646 <returns></returns>
5647 </member>
5648 <member name="M:QuickGraph.Vertex.op_GreaterThan(QuickGraph.Vertex,QuickGraph.Vertex)">
5649 <summary>
5650
5651 </summary>
5652 <param name="v1"></param>
5653 <param name="v2"></param>
5654 <returns></returns>
5655 </member>
5656 <member name="M:QuickGraph.Vertex.Equals(System.Object)">
5657 <summary>
5658
5659 </summary>
5660 <param name="obj"></param>
5661 <returns></returns>
5662 </member>
5663 <member name="M:QuickGraph.Vertex.CompareTo(QuickGraph.Vertex)">
5664 <summary>
5665 Compares two vertices
5666 </summary>
5667 <param name="obj">vertex to compare</param>
5668 <returns></returns>
5669 <exception cref="T:System.ArgumentException">obj is not of type Vertex</exception>
5670 </member>
5671 <member name="M:QuickGraph.Vertex.ToString">
5672 <summary>
5673 Converts to string by returning the ID.
5674 </summary>
5675 <returns></returns>
5676 </member>
5677 <member name="M:QuickGraph.Vertex.ToString(System.IFormatProvider)">
5678 <summary>
5679 Converts to string by returning the formatted ID
5680 </summary>
5681 <param name="provider"></param>
5682 <returns></returns>
5683 </member>
5684 <member name="M:QuickGraph.Vertex.GetHashCode">
5685 <summary>
5686 Hash code. ID used as identification number.
5687 </summary>
5688 <returns></returns>
5689 </member>
5690 <member name="M:QuickGraph.Vertex.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
5691 <summary>
5692 Adds nothing to serialization info
5693 </summary>
5694 <param name="info">data holder</param>
5695 <exception cref="T:System.ArgumentNullException">info is null</exception>
5696 <exception cref="T:System.ArgumentException">info is not serializing</exception>
5697 </member>
5698 <member name="M:QuickGraph.Vertex.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
5699 <summary>
5700 Reads no data from serialization info
5701 </summary>
5702 <param name="info">data holder</param>
5703 <exception cref="T:System.ArgumentNullException">info is null</exception>
5704 <exception cref="T:System.ArgumentException">info is serializing</exception>
5705 </member>
5706 <member name="P:QuickGraph.Vertex.ID">
5707 <summary>
5708 Unique identification number
5709 </summary>
5710 </member>
5711 <member name="M:QuickGraph.CustomVertex.#ctor">
5712 <summary>
5713 Custom constructor. Used for serialization.
5714 </summary>
5715 </member>
5716 <member name="M:QuickGraph.CustomVertex.#ctor(System.Int32)">
5717 <summary>
5718 Default constructor
5719 </summary>
5720 <param name="id">unique vertex identification number</param>
5721 <remarks>
5722 This constructors defaults the value to null
5723 </remarks>
5724 </member>
5725 <member name="P:QuickGraph.CustomVertex.Value">
5726 <summary>
5727 Vertex associated property value
5728 </summary>
5729 </member>
5730 <member name="T:QuickGraph.Exceptions.AttributeNotFoundException">
5731 <summary>
5732 Exception throwed when not finding a vertex.
5733 </summary>
5734 </member>
5735 <member name="M:QuickGraph.Exceptions.AttributeNotFoundException.#ctor(System.String)">
5736 <summary>
5737 Build a new exception
5738 </summary>
5739 <param name="name">vertex name</param>
5740 </member>
5741 <member name="M:QuickGraph.Exceptions.AttributeNotFoundException.#ctor">
5742 <summary>
5743
5744 </summary>
5745 </member>
5746 <member name="M:QuickGraph.Exceptions.AttributeNotFoundException.#ctor(System.String,System.Exception)">
5747 <summary>
5748
5749 </summary>
5750 <param name="name"></param>
5751 <param name="ex"></param>
5752 </member>
5753 <member name="M:QuickGraph.Exceptions.AttributeNotFoundException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5754 <summary>
5755
5756 </summary>
5757 <param name="info"></param>
5758 <param name="ctx"></param>
5759 </member>
5760 <member name="M:QuickGraph.Exceptions.AttributeNotFoundException.ToString">
5761 <summary>
5762
5763 </summary>
5764 <returns></returns>
5765 </member>
5766 <member name="T:QuickGraph.Exceptions.EdgeNotFoundException">
5767 <summary>
5768 Exception throwed when not finding a vertex.
5769 </summary>
5770 </member>
5771 <member name="M:QuickGraph.Exceptions.EdgeNotFoundException.#ctor(System.String)">
5772 <summary>
5773 Construct an <see cref="T:QuickGraph.Exceptions.EdgeNotFoundException"/> instance.
5774 </summary>
5775 <param name="message"></param>
5776 </member>
5777 <member name="M:QuickGraph.Exceptions.EdgeNotFoundException.#ctor">
5778 <summary>
5779 Constructs an empty exception
5780 </summary>
5781 </member>
5782 <member name="M:QuickGraph.Exceptions.EdgeNotFoundException.#ctor(System.String,System.Exception)">
5783 <summary>
5784 Creates an exception with a message
5785 and an inner exception.
5786 </summary>
5787 <param name="message">Error message</param>
5788 <param name="ex">Inner exception</param>
5789 </member>
5790 <member name="M:QuickGraph.Exceptions.EdgeNotFoundException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5791 <summary>
5792
5793 </summary>
5794 <param name="info"></param>
5795 <param name="ctx"></param>
5796 </member>
5797 <member name="P:QuickGraph.Exceptions.EdgeNotFoundException.Message">
5798 <summary>
5799
5800 </summary>
5801 <returns></returns>
5802 </member>
5803 <member name="T:QuickGraph.Exceptions.GraphNotStronglyConnectedException">
5804 <summary>
5805 Not a acyclic graph execption
5806 </summary>
5807 </member>
5808 <member name="M:QuickGraph.Exceptions.GraphNotStronglyConnectedException.#ctor">
5809 <summary>
5810 Default consturctor
5811 </summary>
5812 </member>
5813 <member name="M:QuickGraph.Exceptions.GraphNotStronglyConnectedException.#ctor(System.String)">
5814 <summary>
5815 Constructor with message
5816 </summary>
5817 <param name="name">message</param>
5818 </member>
5819 <member name="M:QuickGraph.Exceptions.GraphNotStronglyConnectedException.#ctor(System.String,System.Exception)">
5820 <summary>
5821
5822 </summary>
5823 <param name="name"></param>
5824 <param name="ex"></param>
5825 </member>
5826 <member name="M:QuickGraph.Exceptions.GraphNotStronglyConnectedException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5827 <summary>
5828
5829 </summary>
5830 <param name="info"></param>
5831 <param name="ctx"></param>
5832 </member>
5833 <member name="T:QuickGraph.Exceptions.MultipleInEdgeException">
5834 <summary>
5835 Multiple In Edge exception
5836 </summary>
5837 </member>
5838 <member name="M:QuickGraph.Exceptions.MultipleInEdgeException.#ctor(System.String)">
5839 <summary>
5840
5841 </summary>
5842 <param name="name">vertex name</param>
5843 </member>
5844 <member name="M:QuickGraph.Exceptions.MultipleInEdgeException.#ctor(System.String,System.Exception)">
5845 <summary>
5846
5847 </summary>
5848 <param name="name"></param>
5849 <param name="ex"></param>
5850 </member>
5851 <member name="M:QuickGraph.Exceptions.MultipleInEdgeException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5852 <summary>
5853
5854 </summary>
5855 <param name="info"></param>
5856 <param name="ctx"></param>
5857 </member>
5858 <member name="T:QuickGraph.Exceptions.NamespaceDoc">
5859 <summary>
5860 The <b>QuickGraph.Exceptions</b> namespace contains graph related
5861 exceptions.
5862 </summary>
5863 </member>
5864 <member name="T:QuickGraph.Exceptions.NegativeCycleException">
5865 <summary>
5866 Negative cycle execption
5867 </summary>
5868 </member>
5869 <member name="M:QuickGraph.Exceptions.NegativeCycleException.#ctor">
5870 <summary>
5871 Default consturctor
5872 </summary>
5873 </member>
5874 <member name="M:QuickGraph.Exceptions.NegativeCycleException.#ctor(System.String)">
5875 <summary>
5876 Constructor with message
5877 </summary>
5878 <param name="name">message</param>
5879 </member>
5880 <member name="M:QuickGraph.Exceptions.NegativeCycleException.#ctor(System.String,System.Exception)">
5881 <summary>
5882
5883 </summary>
5884 <param name="name"></param>
5885 <param name="ex"></param>
5886 </member>
5887 <member name="M:QuickGraph.Exceptions.NegativeCycleException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5888 <summary>
5889
5890 </summary>
5891 <param name="info"></param>
5892 <param name="ctx"></param>
5893 </member>
5894 <member name="T:QuickGraph.Exceptions.NonAcyclicGraphException">
5895 <summary>
5896 Not a acyclic graph execption
5897 </summary>
5898 </member>
5899 <member name="M:QuickGraph.Exceptions.NonAcyclicGraphException.#ctor">
5900 <summary>
5901 Default consturctor
5902 </summary>
5903 </member>
5904 <member name="M:QuickGraph.Exceptions.NonAcyclicGraphException.#ctor(System.String)">
5905 <summary>
5906 Constructor with message
5907 </summary>
5908 <param name="name">message</param>
5909 </member>
5910 <member name="M:QuickGraph.Exceptions.NonAcyclicGraphException.#ctor(System.String,System.Exception)">
5911 <summary>
5912
5913 </summary>
5914 <param name="name"></param>
5915 <param name="ex"></param>
5916 </member>
5917 <member name="M:QuickGraph.Exceptions.NonAcyclicGraphException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5918 <summary>
5919
5920 </summary>
5921 <param name="info"></param>
5922 <param name="ctx"></param>
5923 </member>
5924 <member name="T:QuickGraph.Exceptions.ParrallelEdgeNotAllowedException">
5925 <summary>
5926 ParrallelEdgeNotAllowedException.
5927 </summary>
5928 </member>
5929 <member name="M:QuickGraph.Exceptions.ParrallelEdgeNotAllowedException.#ctor">
5930 <summary>
5931 Default construcotr
5932 </summary>
5933 </member>
5934 <member name="M:QuickGraph.Exceptions.ParrallelEdgeNotAllowedException.#ctor(System.String)">
5935 <summary>
5936 Constructor with message
5937 </summary>
5938 <param name="name">Additional message</param>
5939 </member>
5940 <member name="M:QuickGraph.Exceptions.ParrallelEdgeNotAllowedException.#ctor(System.String,System.Exception)">
5941 <summary>
5942
5943 </summary>
5944 <param name="name"></param>
5945 <param name="ex"></param>
5946 </member>
5947 <member name="M:QuickGraph.Exceptions.ParrallelEdgeNotAllowedException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5948 <summary>
5949
5950 </summary>
5951 <param name="info"></param>
5952 <param name="ctx"></param>
5953 </member>
5954 <member name="T:QuickGraph.Exceptions.VertexNotConnectedByEdgeException">
5955 <summary>
5956 Exception throwed when not finding a vertex.
5957 </summary>
5958 </member>
5959 <member name="M:QuickGraph.Exceptions.VertexNotConnectedByEdgeException.#ctor(System.String)">
5960 <summary>
5961 Build a new exception
5962 </summary>
5963 <param name="name">vertex name</param>
5964 </member>
5965 <member name="M:QuickGraph.Exceptions.VertexNotConnectedByEdgeException.#ctor">
5966 <summary>
5967
5968 </summary>
5969 </member>
5970 <member name="M:QuickGraph.Exceptions.VertexNotConnectedByEdgeException.#ctor(System.String,System.Exception)">
5971 <summary>
5972
5973 </summary>
5974 <param name="name"></param>
5975 <param name="ex"></param>
5976 </member>
5977 <member name="M:QuickGraph.Exceptions.VertexNotConnectedByEdgeException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
5978 <summary>
5979
5980 </summary>
5981 <param name="info"></param>
5982 <param name="ctx"></param>
5983 </member>
5984 <member name="T:QuickGraph.Exceptions.VertexNotFoundException">
5985 <summary>
5986 Exception throwed when not finding a vertex.
5987 </summary>
5988 </member>
5989 <member name="M:QuickGraph.Exceptions.VertexNotFoundException.#ctor(System.String)">
5990 <summary>
5991 Build a new exception
5992 </summary>
5993 <param name="name">vertex name</param>
5994 </member>
5995 <member name="M:QuickGraph.Exceptions.VertexNotFoundException.#ctor">
5996 <summary>
5997 Constructs an empty exception
5998 </summary>
5999 </member>
6000 <member name="M:QuickGraph.Exceptions.VertexNotFoundException.#ctor(System.String,System.Exception)">
6001 <summary>
6002 Creates an exception with a vertex name
6003 and an inner exception.
6004 </summary>
6005 <param name="name">Vertex name</param>
6006 <param name="ex">Inner exception</param>
6007 </member>
6008 <member name="M:QuickGraph.Exceptions.VertexNotFoundException.#ctor(System.Runtime.Serialization.SerializationInfo,System.Runtime.Serialization.StreamingContext)">
6009 <summary>
6010
6011 </summary>
6012 <param name="info"></param>
6013 <param name="ctx"></param>
6014 </member>
6015 <member name="P:QuickGraph.Exceptions.VertexNotFoundException.Message">
6016 <summary>
6017
6018 </summary>
6019 <returns></returns>
6020 </member>
6021 <member name="T:QuickGraph.NamedEdge">
6022 <summary>
6023 A vertex with a name
6024 </summary>
6025 </member>
6026 <member name="M:QuickGraph.NamedEdge.#ctor">
6027 <summary>
6028 Empty constructor. Used internally
6029 </summary>
6030 </member>
6031 <member name="M:QuickGraph.NamedEdge.#ctor(System.Int32,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
6032 <summary>
6033 Constructs a new named edge
6034 </summary>
6035 <param name="id"></param>
6036 <param name="source"></param>
6037 <param name="target"></param>
6038 </member>
6039 <member name="M:QuickGraph.NamedEdge.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
6040 <summary>
6041 Adds nothing to serialization info
6042 </summary>
6043 <param name="info">data holder</param>
6044 <exception cref="T:System.ArgumentNullException">info is null</exception>
6045 <exception cref="T:System.ArgumentException">info is not serializing</exception>
6046 </member>
6047 <member name="M:QuickGraph.NamedEdge.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
6048 <summary>
6049 Reads no data from serialization info
6050 </summary>
6051 <param name="info">data holder</param>
6052 <exception cref="T:System.ArgumentNullException">info is null</exception>
6053 <exception cref="T:System.ArgumentException">info is serializing</exception>
6054 </member>
6055 <member name="P:QuickGraph.NamedEdge.Name">
6056 <summary>
6057 Vertex name
6058 </summary>
6059 </member>
6060 <member name="T:QuickGraph.NamedVertex">
6061 <summary>
6062 A vertex with a name
6063 </summary>
6064 </member>
6065 <member name="M:QuickGraph.NamedVertex.#ctor">
6066 <summary>
6067 Empty constructor
6068 </summary>
6069 </member>
6070 <member name="M:QuickGraph.NamedVertex.#ctor(System.Int32)">
6071 <summary>
6072 Constructor
6073 </summary>
6074 <param name="id"></param>
6075 </member>
6076 <member name="M:QuickGraph.NamedVertex.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
6077 <summary>
6078 Adds nothing to serialization info
6079 </summary>
6080 <param name="info">data holder</param>
6081 <exception cref="T:System.ArgumentNullException">info is null</exception>
6082 <exception cref="T:System.ArgumentException">info is not serializing</exception>
6083 </member>
6084 <member name="M:QuickGraph.NamedVertex.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
6085 <summary>
6086 Reads no data from serialization info
6087 </summary>
6088 <param name="info">data holder</param>
6089 <exception cref="T:System.ArgumentNullException">info is null</exception>
6090 <exception cref="T:System.ArgumentException">info is serializing</exception>
6091 </member>
6092 <member name="P:QuickGraph.NamedVertex.Name">
6093 <summary>
6094 Vertex name
6095 </summary>
6096 </member>
6097 <member name="T:QuickGraph.NameEqualPredicate">
6098 <summary>
6099 Summary description for NameEqualVertexPredicate.
6100 </summary>
6101 </member>
6102 <member name="T:QuickGraph.NamespaceDoc">
6103 <summary>
6104 <para>
6105 The <b>QuickGraph</b> namespace contains default vertex and edge
6106 implementations.
6107 </para>
6108 <para>
6109 <para>
6110 QuickGraph Library License
6111 </para>
6112 <pre>
6113 Copyright (c) 2004 Jonathan de Halleux
6114
6115 This software is provided 'as-is', without any express or implied warranty.
6116
6117 In no event will the authors be held liable for any damages arising from
6118 the use of this software.
6119 Permission is granted to anyone to use this software for any purpose,
6120 including commercial applications, and to alter it and redistribute it
6121 freely, subject to the following restrictions:
6122
6123 1. The origin of this software must not be misrepresented;
6124 you must not claim that you wrote the original software.
6125 If you use this software in a product, an acknowledgment in the product
6126 documentation would be appreciated but is not required.
6127
6128 2. Altered source versions must be plainly marked as such, and must
6129 not be misrepresented as being the original software.
6130
6131 3. This notice may not be removed or altered from any source
6132 distribution.
6133
6134 QuickGraph Library HomePage: http://www.mbunit.com
6135 Author: Jonathan de Halleux
6136 </pre>
6137 </para>
6138 </summary>
6139 </member>
6140 <member name="T:QuickGraph.Predicates.ConnectsEdgePredicate">
6141 <summary>
6142 A predicate that filter edge connecting two vertices
6143 </summary>
6144 </member>
6145 <member name="M:QuickGraph.Predicates.ConnectsEdgePredicate.#ctor(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IGraph)">
6146 <summary>
6147 Constructs a new predicate
6148 </summary>
6149 <param name="src">source vertex</param>
6150 <param name="trg">target vertex</param>
6151 <param name="g">underlying graph</param>
6152 </member>
6153 <member name="M:QuickGraph.Predicates.ConnectsEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6154 <summary>
6155 Test if edge connects source and target vertex
6156 </summary>
6157 <param name="e">edge to test</param>
6158 <returns>true if e connects source and target</returns>
6159 </member>
6160 <member name="T:QuickGraph.Predicates.EdgePredicate">
6161 <summary>
6162 Edge predicate
6163 </summary>
6164 <remarks>
6165 <para>
6166 Applies predicates to an edge, to it's source and to it's target.
6167 </para>
6168 <para>
6169 Given <c>ep</c>, the edge predicate, and <c>vp</c>, the vertex
6170 predicate, the predicate result is computed, for a given edge <c>e</c>,
6171 as:
6172 <code>
6173 ep(e) && vp(e.Source) && vp(e.Target)
6174 </code>
6175 </para>
6176 </remarks>
6177 </member>
6178 <member name="M:QuickGraph.Predicates.EdgePredicate.#ctor(QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
6179 <summary>
6180 Constructs a new edge predicate
6181 </summary>
6182 <param name="ep">the edge predicate object</param>
6183 <param name="vp">the vertex predicate object</param>
6184 <exception cref="T:System.ArgumentNullException">ep or vp are null</exception>
6185 </member>
6186 <member name="M:QuickGraph.Predicates.EdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6187 <summary>
6188 Applies the edge predicate to e and to it's vertices?
6189 </summary>
6190 <param name="e">edge to test</param>
6191 <returns>EdgePredicate(e) && VertexPredicate(e.Source)
6192 && VertexPredicate(e.Target)
6193 </returns>
6194 <exception cref="T:System.ArgumentNullException">e is null</exception>
6195 </member>
6196 <member name="T:QuickGraph.Predicates.InCollectionVertexPredicate">
6197 <summary>
6198 Predicate for checking that a vertex is in a collection
6199 </summary>
6200 <remarks>
6201 </remarks>
6202 </member>
6203 <member name="M:QuickGraph.Predicates.InCollectionVertexPredicate.#ctor(QuickGraph.Concepts.Collections.IVertexCollection)">
6204 <summary>
6205 Creates a predicate that checks if vertices are in
6206 <paramref name="list"/>
6207 </summary>
6208 <param name="list">list of vertices</param>
6209 <exception cref="T:System.ArgumentNullException">list is a null reference</exception>
6210 </member>
6211 <member name="M:QuickGraph.Predicates.InCollectionVertexPredicate.Test(QuickGraph.Concepts.IVertex)">
6212 <summary>
6213 Gets a value indicating if <paramref name="v"/>
6214 is in the collection.
6215 </summary>
6216 <param name="v">vertex to test</param>
6217 <returns>true if <paramref name="v"/> is in the collection,
6218 false otherwize
6219 </returns>
6220 </member>
6221 <member name="T:QuickGraph.Predicates.InDictionaryVertexPredicate">
6222 <summary>
6223 Predicate for checking that a vertex is in a collection
6224 </summary>
6225 <remarks>
6226 </remarks>
6227 </member>
6228 <member name="M:QuickGraph.Predicates.InDictionaryVertexPredicate.#ctor(System.Collections.IDictionary)">
6229 <summary>
6230 Creates a predicate that checks if vertices are in
6231 <paramref name="list"/>
6232 </summary>
6233 <param name="dictionary">dictionary of vertices</param>
6234 <exception cref="T:System.ArgumentNullException">dictionary is a null reference</exception>
6235 </member>
6236 <member name="M:QuickGraph.Predicates.InDictionaryVertexPredicate.Test(QuickGraph.Concepts.IVertex)">
6237 <summary>
6238 Gets a value indicating if <paramref name="v"/>
6239 is in the collection.
6240 </summary>
6241 <param name="v">vertex to test</param>
6242 <returns>true if <paramref name="v"/> is in the collection,
6243 false otherwize
6244 </returns>
6245 </member>
6246 <member name="T:QuickGraph.Predicates.InEdgePredicate">
6247 <summary>
6248 In edge predicate
6249 </summary>
6250 <remarks>
6251 <para>
6252 Applies predicates to an edge and to it's source.
6253 </para>
6254 <para>
6255 Given <c>ep</c>, the edge predicate, and <c>vp</c>, the vertex
6256 predicate, the predicate result is computed, for a given edge <c>e</c>,
6257 as:
6258 <code>
6259 ep(e) && vp(e.Source)
6260 </code>
6261 </para>
6262 </remarks>
6263 </member>
6264 <member name="M:QuickGraph.Predicates.InEdgePredicate.#ctor(QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
6265 <summary>
6266 Construct a new predicate.
6267 </summary>
6268 <param name="ep">the edge predicate</param>
6269 <param name="vp">the source vertex predicate</param>
6270 <exception cref="T:System.ArgumentNullException">ep or vp is null</exception>
6271 </member>
6272 <member name="M:QuickGraph.Predicates.InEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6273 <summary>
6274 Applies the edge predicate to e and to it's source
6275 </summary>
6276 <param name="e">edge to test</param>
6277 <returns>EdgePredicate(e) and VertexPredicate(e.Source)</returns>
6278 <exception cref="T:System.ArgumentNullException">e is null</exception>
6279 </member>
6280 <member name="T:QuickGraph.Predicates.IsAdjacentEdgePredicate">
6281 <summary>
6282 Predicate that checks if a edge is an edge
6283 </summary>
6284 </member>
6285 <member name="M:QuickGraph.Predicates.IsAdjacentEdgePredicate.#ctor(QuickGraph.Concepts.IVertex)">
6286 <summary>
6287
6288 </summary>
6289 <param name="v"></param>
6290 </member>
6291 <member name="M:QuickGraph.Predicates.IsAdjacentEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6292 <summary>
6293
6294 </summary>
6295 <param name="e"></param>
6296 <returns></returns>
6297 </member>
6298 <member name="T:QuickGraph.Predicates.IsInEdgePredicate">
6299 <summary>
6300 Predicate that checks if a edge is an inedge
6301 </summary>
6302 </member>
6303 <member name="M:QuickGraph.Predicates.IsInEdgePredicate.#ctor(QuickGraph.Concepts.IVertex)">
6304 <summary>
6305
6306 </summary>
6307 <param name="v"></param>
6308 </member>
6309 <member name="M:QuickGraph.Predicates.IsInEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6310 <summary>
6311
6312 </summary>
6313 <param name="e"></param>
6314 <returns></returns>
6315 </member>
6316 <member name="T:QuickGraph.Predicates.IsOutEdgePredicate">
6317 <summary>
6318
6319 </summary>
6320 </member>
6321 <member name="M:QuickGraph.Predicates.IsOutEdgePredicate.#ctor(QuickGraph.Concepts.IVertex)">
6322 <summary>
6323
6324 </summary>
6325 <param name="v"></param>
6326 </member>
6327 <member name="M:QuickGraph.Predicates.IsOutEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6328 <summary>
6329
6330 </summary>
6331 <param name="e"></param>
6332 <returns></returns>
6333 </member>
6334 <member name="T:QuickGraph.Predicates.KeepAllEdgesPredicate">
6335 <summary>
6336 Predicate that always returns true
6337 </summary>
6338 <remarks>
6339 <para>
6340 This predicate returns true for any edge.
6341 </para>
6342 </remarks>
6343 </member>
6344 <member name="M:QuickGraph.Predicates.KeepAllEdgesPredicate.Test(QuickGraph.Concepts.IEdge)">
6345 <summary>
6346 Always returns true.
6347 </summary>
6348 <param name="e"></param>
6349 <returns></returns>
6350 </member>
6351 <member name="T:QuickGraph.Predicates.KeepAllVerticesPredicate">
6352 <summary>
6353 Predicate that always returns true
6354 </summary>
6355 <remarks>
6356 <para>
6357 This predicate returns true for any vertex.
6358 </para>
6359 </remarks>
6360 </member>
6361 <member name="M:QuickGraph.Predicates.KeepAllVerticesPredicate.Test(QuickGraph.Concepts.IVertex)">
6362 <summary>
6363 Always returns true.
6364 </summary>
6365 <param name="v"></param>
6366 <returns></returns>
6367 </member>
6368 <member name="T:QuickGraph.Predicates.NamespaceDoc">
6369 <summary>
6370 The <b>QuickGraph.Predicates</b> namespace contains predicate
6371 implementations for filtered graphs.
6372 </summary>
6373 <remarks>
6374 <para>
6375 Predicates can be used to filter the edge set or the vertex set
6376 of graphs.
6377 </para>
6378 <para>
6379 A static helper class, <see cref="T:QuickGraph.Predicates.Preds"/>, is provided to help
6380 the instanciation of predicates.
6381 </para>
6382 </remarks>
6383 </member>
6384 <member name="T:QuickGraph.Predicates.NotInCircuitEdgePredicate">
6385 <summary>
6386 An predicate that checks that the edge is not in both circuit
6387 and temporary circuit.
6388 </summary>
6389 </member>
6390 <member name="M:QuickGraph.Predicates.NotInCircuitEdgePredicate.#ctor(QuickGraph.Concepts.Collections.IEdgeCollection,QuickGraph.Concepts.Collections.IEdgeCollection)">
6391 <summary>
6392 Construct an edge that filters out edge in circuit
6393 and temporary circuit
6394 </summary>
6395 <param name="circuit"></param>
6396 <param name="temporaryCircuit"></param>
6397 </member>
6398 <member name="M:QuickGraph.Predicates.NotInCircuitEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6399 <summary>
6400 Test method
6401 </summary>
6402 <param name="e"></param>
6403 <returns></returns>
6404 </member>
6405 <member name="P:QuickGraph.Predicates.NotInCircuitEdgePredicate.Circuit">
6406 <summary>
6407 Edge circuit
6408 </summary>
6409 </member>
6410 <member name="P:QuickGraph.Predicates.NotInCircuitEdgePredicate.TemporaryCircuit">
6411 <summary>
6412 Temporary circuit
6413 </summary>
6414 </member>
6415 <member name="T:QuickGraph.Predicates.NotVertexPredicate">
6416 <summary>
6417 Not operator to predicate
6418 </summary>
6419 </member>
6420 <member name="M:QuickGraph.Predicates.NotVertexPredicate.#ctor(QuickGraph.Concepts.Predicates.IVertexPredicate)">
6421 <summary>
6422 Constructs a new <see cref="T:QuickGraph.Predicates.NotVertexPredicate"/>.
6423 </summary>
6424 <param name="predicate">predicate to invert</param>
6425 </member>
6426 <member name="M:QuickGraph.Predicates.NotVertexPredicate.Test(QuickGraph.Concepts.IVertex)">
6427 <summary>
6428 </summary>
6429 <param name="v"></param>
6430 <returns></returns>
6431 </member>
6432 <member name="T:QuickGraph.Predicates.OutEdgePredicate">
6433 <summary>
6434 Out-edge predicate
6435 </summary>
6436 <remarks>
6437 <para>
6438 Applies predicates to an edge and to it's target vertex.
6439 </para>
6440 <para>
6441 Given <c>ep</c>, the edge predicate, and <c>vp</c>, the vertex
6442 predicate, for a given edge <c>e</c>, the predicate result is computed
6443 as:
6444 <code>
6445 ep(e) && vp(e.Target)
6446 </code>
6447 </para>
6448 </remarks>
6449 </member>
6450 <member name="M:QuickGraph.Predicates.OutEdgePredicate.#ctor(QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
6451 <summary>
6452 Construct a new predicate.
6453 </summary>
6454 <param name="ep">the edge predicate</param>
6455 <param name="vp">the source vertex predicate</param>
6456 <exception cref="T:System.ArgumentNullException">ep or vp is null</exception>
6457 </member>
6458 <member name="M:QuickGraph.Predicates.OutEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6459 <summary>
6460 Applies the edge predicate to e and to it's target vertex
6461 </summary>
6462 <param name="e">edge to test</param>
6463 <returns>EdgePredicate(e) and VertexPredicate(e.Target)</returns>
6464 <exception cref="T:System.ArgumentNullException">e is null</exception>
6465 </member>
6466 <member name="T:QuickGraph.Predicates.Preds">
6467 <summary>
6468 Static helper class for creating predicates
6469 </summary>
6470 <remarks>
6471 This lets you quickly use the built-in predicates of QuickGraph.
6472 </remarks>
6473 </member>
6474 <member name="M:QuickGraph.Predicates.Preds.Connects(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IGraph)">
6475 <summary>
6476
6477 </summary>
6478 <param name="source"></param>
6479 <param name="target"></param>
6480 <param name="g"></param>
6481 <returns></returns>
6482 </member>
6483 <member name="M:QuickGraph.Predicates.Preds.KeepAllEdges">
6484 <summary>
6485 Returns a edge predicate that always returns true.
6486 </summary>
6487 <returns></returns>
6488 </member>
6489 <member name="M:QuickGraph.Predicates.Preds.KeepAllVertices">
6490 <summary>
6491 Returns a vertex predicate that always returns true.
6492 </summary>
6493 <returns></returns>
6494 </member>
6495 <member name="M:QuickGraph.Predicates.Preds.Edge(QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
6496 <summary>
6497 Checks ep(e) && vp(e.Source) && vp(e.Target)
6498 </summary>
6499 <param name="ep">predicate to apply to edge</param>
6500 <param name="vp">predicate to apply to edge source and target</param>
6501 <returns></returns>
6502 </member>
6503 <member name="M:QuickGraph.Predicates.Preds.InEdge(QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
6504 <summary>
6505 Creates a predicate that check the edge and the edge source
6506 </summary>
6507 <param name="ep">edge predicate to apply to the edge</param>
6508 <param name="vp">vertex predicate to apply to the edge source</param>
6509 <returns>in-edge predicate</returns>
6510 </member>
6511 <member name="M:QuickGraph.Predicates.Preds.OutEdge(QuickGraph.Concepts.Predicates.IEdgePredicate,QuickGraph.Concepts.Predicates.IVertexPredicate)">
6512 <summary>
6513 Creates a predicate that check the edge and the edge target
6514 </summary>
6515 <param name="ep">edge predicate to apply to the edge</param>
6516 <param name="vp">vertex predicate to apply to the edge target</param>
6517 <returns>out-edge predicate</returns>
6518 </member>
6519 <member name="M:QuickGraph.Predicates.Preds.IsAdjacent(QuickGraph.Concepts.IVertex)">
6520 <summary>
6521 Creates a predicate that checks wheter an edge is adjacent to a
6522 given vertex.
6523 </summary>
6524 <param name="v">vertex to test</param>
6525 <returns>is adjacent predicate</returns>
6526 </member>
6527 <member name="M:QuickGraph.Predicates.Preds.IsInEdge(QuickGraph.Concepts.IVertex)">
6528 <summary>
6529 Creates a predicate that checks if an edge is an in-edge of
6530 a vertex.
6531 </summary>
6532 <param name="v">vertex to check</param>
6533 <returns>in-edge predicate</returns>
6534 </member>
6535 <member name="M:QuickGraph.Predicates.Preds.IsOutEge(QuickGraph.Concepts.IVertex)">
6536 <summary>
6537 Creates a predicate that checks if an edge is an out-edge of
6538 a vertex.
6539 </summary>
6540 <param name="v">vertex to check</param>
6541 <returns>out-edge predicate</returns>
6542 </member>
6543 <member name="M:QuickGraph.Predicates.Preds.Equal(QuickGraph.Concepts.IVertex)">
6544 <summary>
6545 Check if a vertex is equal to v
6546 </summary>
6547 <param name="v">vertex to test</param>
6548 <returns>predicate</returns>
6549 </member>
6550 <member name="M:QuickGraph.Predicates.Preds.InCollection(QuickGraph.Concepts.Collections.IVertexCollection)">
6551 <summary>
6552 Check if vertex is in list
6553 </summary>
6554 <param name="list"></param>
6555 <returns></returns>
6556 </member>
6557 <member name="M:QuickGraph.Predicates.Preds.Not(QuickGraph.Concepts.Predicates.IVertexPredicate)">
6558 <summary>
6559 Negates a predicate
6560 </summary>
6561 <param name="predicate"></param>
6562 <returns></returns>
6563 </member>
6564 <member name="M:QuickGraph.Predicates.Preds.SourceVertex(QuickGraph.Concepts.Traversals.IBidirectionalGraph)">
6565 <summary>
6566 Source vertex prodicate
6567 </summary>
6568 <param name="graph"></param>
6569 <returns></returns>
6570 </member>
6571 <member name="T:QuickGraph.Predicates.ResidualEdgePredicate">
6572 <summary>
6573 Predicate that test if an edge is residual
6574 </summary>
6575 <remarks>
6576 <para>
6577 Given a capacity map, the predicate returns true if the edge
6578 capacity is positive: <c>0 < Capacities[e]</c>
6579 </para>
6580 </remarks>
6581 </member>
6582 <member name="M:QuickGraph.Predicates.ResidualEdgePredicate.#ctor(System.Collections.IDictionary)">
6583 <summary>
6584 Constructor.
6585 </summary>
6586 <param name="residualCapacities">Residual Edge capacities map</param>
6587 <exception cref="T:System.ArgumentNullException">residualCapacities is null</exception>
6588 </member>
6589 <member name="M:QuickGraph.Predicates.ResidualEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6590 <summary>
6591 Test if edge e has a positive residual capacity
6592 </summary>
6593 <param name="e">edge to test</param>
6594 <returns>0 < ResidualCapacities[e]</returns>
6595 <exception cref="T:System.ArgumentNullException">e is null</exception>
6596 </member>
6597 <member name="P:QuickGraph.Predicates.ResidualEdgePredicate.ResidualCapacities">
6598 <summary>
6599 Residual capacities map
6600 </summary>
6601 </member>
6602 <member name="T:QuickGraph.Predicates.ReversedResidualEdgePredicate">
6603 <summary>
6604 Predicate that test if an edge's reverse is residual
6605 </summary>
6606 <remarks>
6607 <para>
6608 Given a capacity map and reversed edge map, the predicate returns true if the
6609 reversed edge's capacity is positive: <c>0 < Capacities[ReversedEdges[e]]</c>
6610 </para>
6611 </remarks>
6612 </member>
6613 <member name="M:QuickGraph.Predicates.ReversedResidualEdgePredicate.#ctor(System.Collections.IDictionary,System.Collections.IDictionary)">
6614 <summary>
6615 Constructor.
6616 </summary>
6617 <param name="residualCapacities">Residual Edge capacities map</param>
6618 <param name="reversedEdges">Reversed Edge map</param>
6619 <exception cref="T:System.ArgumentNullException">residualCapacities is null</exception>
6620 </member>
6621 <member name="M:QuickGraph.Predicates.ReversedResidualEdgePredicate.Test(QuickGraph.Concepts.IEdge)">
6622 <summary>
6623 Test if edge e has a positive residual capacity
6624 </summary>
6625 <param name="e">edge to test</param>
6626 <returns>0 < ResidualCapacities[e]</returns>
6627 <exception cref="T:System.ArgumentNullException">e is null</exception>
6628 </member>
6629 <member name="P:QuickGraph.Predicates.ReversedResidualEdgePredicate.ResidualCapacities">
6630 <summary>
6631 Residual capacities map
6632 </summary>
6633 </member>
6634 <member name="P:QuickGraph.Predicates.ReversedResidualEdgePredicate.ReversedEdges">
6635 <summary>
6636 Reversed edges map
6637 </summary>
6638 </member>
6639 <member name="T:QuickGraph.Predicates.SinkVertexPredicate">
6640 <summary>
6641 A predicate to test if a <see cref="T:QuickGraph.Concepts.IVertex"/> is a root vertex (no
6642 in-edges).
6643 </summary>
6644 <remarks>
6645 This predicate can be used to iterate over the root vertices of a
6646 graph.
6647 </remarks>
6648 </member>
6649 <member name="M:QuickGraph.Predicates.SinkVertexPredicate.#ctor(QuickGraph.Concepts.Traversals.IImplicitGraph)">
6650 <summary>
6651 Create the predicate over <paramref name="graph"/>.
6652 </summary>
6653 <param name="graph">graph to visit</param>
6654 </member>
6655 <member name="M:QuickGraph.Predicates.SinkVertexPredicate.Test(QuickGraph.Concepts.IVertex)">
6656 <summary>
6657 Tests if the vertex is a root
6658 </summary>
6659 <param name="v">vertex to test</param>
6660 <returns>true is the vertex has no in-edges, false otherwise</returns>
6661 </member>
6662 <member name="T:QuickGraph.Predicates.SourceVertexPredicate">
6663 <summary>
6664 A predicate to test if a <see cref="T:QuickGraph.Concepts.IVertex"/> is a root vertex (no
6665 in-edges).
6666 </summary>
6667 <remarks>
6668 This predicate can be used to iterate over the root vertices of a
6669 graph.
6670 </remarks>
6671 </member>
6672 <member name="M:QuickGraph.Predicates.SourceVertexPredicate.#ctor(QuickGraph.Concepts.Traversals.IBidirectionalGraph)">
6673 <summary>
6674 Create the predicate over <paramref name="graph"/>.
6675 </summary>
6676 <param name="graph">graph to visit</param>
6677 </member>
6678 <member name="M:QuickGraph.Predicates.SourceVertexPredicate.Test(QuickGraph.Concepts.IVertex)">
6679 <summary>
6680 Tests if the vertex is a root
6681 </summary>
6682 <param name="v">vertex to test</param>
6683 <returns>true is the vertex has no in-edges, false otherwise</returns>
6684 </member>
6685 <member name="T:QuickGraph.Predicates.VertexEqualPredicate">
6686 <summary>
6687 Predicate that checks to two vertex are equal
6688 </summary>
6689 </member>
6690 <member name="M:QuickGraph.Predicates.VertexEqualPredicate.#ctor(QuickGraph.Concepts.IVertex)">
6691 <summary>
6692 Constructor
6693 </summary>
6694 <param name="u">reference vertex</param>
6695 <exception cref="T:System.ArgumentNullException">u is null</exception>
6696 </member>
6697 <member name="M:QuickGraph.Predicates.VertexEqualPredicate.Test(QuickGraph.Concepts.IVertex)">
6698 <summary>
6699 Test if v == u
6700 </summary>
6701 <param name="v">vertex to test</param>
6702 <returns>v == u</returns>
6703 </member>
6704 <member name="P:QuickGraph.Predicates.VertexEqualPredicate.ReferenceVertex">
6705 <summary>
6706 Reference vertex
6707 </summary>
6708 </member>
6709 <member name="T:QuickGraph.Providers.CustomEdgeProvider">
6710 <summary>
6711 Custom edge provider
6712 </summary>
6713 </member>
6714 <member name="M:QuickGraph.Providers.CustomEdgeProvider.ProvideEdge(QuickGraph.Vertex,QuickGraph.Vertex)">
6715 <summary>
6716 Creates a new edge
6717 </summary>
6718 <param name="u"></param>
6719 <param name="v"></param>
6720 <returns></returns>
6721 </member>
6722 <member name="M:QuickGraph.Providers.CustomEdgeProvider.UpdateEdge(QuickGraph.CustomEdge)">
6723 <summary>
6724 Updates an edge that has not been created with the provider
6725 </summary>
6726 <param name="e">vertex to update</param>
6727 </member>
6728 <member name="M:QuickGraph.Providers.CustomEdgeProvider.QuickGraph#Concepts#Providers#IEdgeProvider#UpdateEdge(QuickGraph.Concepts.IEdge)">
6729 <summary>
6730 Updates vertex
6731 </summary>
6732 <param name="e"></param>
6733 </member>
6734 <member name="P:QuickGraph.Providers.CustomEdgeProvider.EdgeType">
6735 <summary>
6736 Returns typeof(CustomEdge)
6737 </summary>
6738 </member>
6739 <member name="T:QuickGraph.Providers.CustomVertexProvider">
6740 <summary>
6741 Default custom vertex provider
6742 </summary>
6743 </member>
6744 <member name="M:QuickGraph.Providers.CustomVertexProvider.ProvideVertex">
6745 <summary>
6746 Creates a new vertex
6747 </summary>
6748 <returns></returns>
6749 </member>
6750 <member name="M:QuickGraph.Providers.CustomVertexProvider.UpdateVertex(QuickGraph.CustomVertex)">
6751 <summary>
6752 Updates a vertex that has not been created with the provider
6753 </summary>
6754 <param name="v">vertex to update</param>
6755 </member>
6756 <member name="M:QuickGraph.Providers.CustomVertexProvider.QuickGraph#Concepts#Providers#IVertexProvider#UpdateVertex(QuickGraph.Concepts.IVertex)">
6757 <summary>
6758 Updates vertex
6759 </summary>
6760 <param name="v"></param>
6761 </member>
6762 <member name="P:QuickGraph.Providers.CustomVertexProvider.VertexType">
6763 <summary>
6764 Returns typeof(CustomVertex)
6765 </summary>
6766 </member>
6767 <member name="T:QuickGraph.Providers.EdgeProvider">
6768 <summary>
6769 Default edge provider
6770 </summary>
6771 </member>
6772 <member name="M:QuickGraph.Providers.EdgeProvider.ProvideEdge(QuickGraph.Vertex,QuickGraph.Vertex)">
6773 <summary>
6774 Creates a new edge
6775 </summary>
6776 <param name="u"></param>
6777 <param name="v"></param>
6778 <returns></returns>
6779 </member>
6780 <member name="M:QuickGraph.Providers.EdgeProvider.UpdateEdge(QuickGraph.Edge)">
6781 <summary>
6782 Updates an edge that has not been created with the provider
6783 </summary>
6784 <param name="e">edge to update</param>
6785 </member>
6786 <member name="M:QuickGraph.Providers.EdgeProvider.QuickGraph#Concepts#Providers#IEdgeProvider#UpdateEdge(QuickGraph.Concepts.IEdge)">
6787 <summary>
6788 Updates vertex
6789 </summary>
6790 <param name="e"></param>
6791 </member>
6792 <member name="P:QuickGraph.Providers.EdgeProvider.EdgeType">
6793 <summary>
6794 Edge type.
6795 </summary>
6796 </member>
6797 <member name="T:QuickGraph.Providers.NamedEdgeProvider">
6798 <summary>
6799 Named edge provider
6800 </summary>
6801 </member>
6802 <member name="M:QuickGraph.Providers.NamedEdgeProvider.ProvideEdge(QuickGraph.Vertex,QuickGraph.Vertex)">
6803 <summary>
6804 Creates a new edge
6805 </summary>
6806 <param name="u"></param>
6807 <param name="v"></param>
6808 <returns></returns>
6809 </member>
6810 <member name="M:QuickGraph.Providers.NamedEdgeProvider.UpdateEdge(QuickGraph.NamedEdge)">
6811 <summary>
6812 Updates an edge that has not been created with the provider
6813 </summary>
6814 <param name="e">edge to update</param>
6815 </member>
6816 <member name="M:QuickGraph.Providers.NamedEdgeProvider.QuickGraph#Concepts#Providers#IEdgeProvider#UpdateEdge(QuickGraph.Concepts.IEdge)">
6817 <summary>
6818 Updates vertex
6819 </summary>
6820 <param name="e"></param>
6821 </member>
6822 <member name="P:QuickGraph.Providers.NamedEdgeProvider.EdgeType">
6823 <summary>
6824 Returns typeof(NamedEdge)
6825 </summary>
6826 </member>
6827 <member name="T:QuickGraph.Providers.NamedVertexProvider">
6828 <summary>
6829 Default custom vertex provider
6830 </summary>
6831 </member>
6832 <member name="M:QuickGraph.Providers.NamedVertexProvider.ProvideVertex">
6833 <summary>
6834 Creates a new vertex
6835 </summary>
6836 <returns></returns>
6837 </member>
6838 <member name="M:QuickGraph.Providers.NamedVertexProvider.UpdateVertex(QuickGraph.NamedVertex)">
6839 <summary>
6840 Updates a vertex that has not been created with the provider
6841 </summary>
6842 <param name="v">vertex to update</param>
6843 </member>
6844 <member name="M:QuickGraph.Providers.NamedVertexProvider.QuickGraph#Concepts#Providers#IVertexProvider#UpdateVertex(QuickGraph.Concepts.IVertex)">
6845 <summary>
6846 Updates vertex
6847 </summary>
6848 <param name="v"></param>
6849 </member>
6850 <member name="P:QuickGraph.Providers.NamedVertexProvider.VertexType">
6851 <summary>
6852 Returns typeof(NamedVertex)
6853 </summary>
6854 </member>
6855 <member name="T:QuickGraph.Providers.NamespaceDoc">
6856 <summary>
6857 The <b>QuickGraph.Providers</b> contains providers for the default
6858 vertex and edge implementations.
6859 </summary>
6860 </member>
6861 <member name="T:QuickGraph.Providers.TypedEdgeProvider">
6862 <summary>
6863 Default custom edge provider
6864 </summary>
6865 </member>
6866 <member name="M:QuickGraph.Providers.TypedEdgeProvider.ProvideEdge(QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
6867 <summary>
6868 Creates a new edge
6869 </summary>
6870 <returns></returns>
6871 </member>
6872 <member name="M:QuickGraph.Providers.TypedEdgeProvider.UpdateEdge(QuickGraph.Concepts.IEdge)">
6873 <summary>
6874 Updates a edge that has not been created with the provider
6875 </summary>
6876 <param name="e">edge to update</param>
6877 </member>
6878 <member name="P:QuickGraph.Providers.TypedEdgeProvider.EdgeType">
6879 <summary>
6880 Returns typeof(CustomEdge)
6881 </summary>
6882 </member>
6883 <member name="T:QuickGraph.Providers.TypedVertexProvider">
6884 <summary>
6885 Default custom vertex provider
6886 </summary>
6887 </member>
6888 <member name="M:QuickGraph.Providers.TypedVertexProvider.ProvideVertex">
6889 <summary>
6890 Creates a new vertex
6891 </summary>
6892 <returns></returns>
6893 </member>
6894 <member name="M:QuickGraph.Providers.TypedVertexProvider.UpdateVertex(QuickGraph.Concepts.IVertex)">
6895 <summary>
6896 Updates a vertex that has not been created with the provider
6897 </summary>
6898 <param name="v">vertex to update</param>
6899 </member>
6900 <member name="P:QuickGraph.Providers.TypedVertexProvider.VertexType">
6901 <summary>
6902 Returns typeof(CustomVertex)
6903 </summary>
6904 </member>
6905 <member name="T:QuickGraph.Providers.VertexProvider">
6906 <summary>
6907 Vertex provider
6908 </summary>
6909 </member>
6910 <member name="M:QuickGraph.Providers.VertexProvider.ProvideVertex">
6911 <summary>
6912 Creates a new vertex
6913 </summary>
6914 <returns></returns>
6915 </member>
6916 <member name="M:QuickGraph.Providers.VertexProvider.QuickGraph#Concepts#Providers#IVertexProvider#ProvideVertex">
6917 <summary>
6918
6919 </summary>
6920 <returns></returns>
6921 </member>
6922 <member name="M:QuickGraph.Providers.VertexProvider.UpdateVertex(QuickGraph.Vertex)">
6923 <summary>
6924 Updates a vertex that has not been created with the provider
6925 </summary>
6926 <param name="v">vertex to update</param>
6927 </member>
6928 <member name="M:QuickGraph.Providers.VertexProvider.QuickGraph#Concepts#Providers#IVertexProvider#UpdateVertex(QuickGraph.Concepts.IVertex)">
6929 <summary>
6930 Updates vertex
6931 </summary>
6932 <param name="v"></param>
6933 </member>
6934 <member name="P:QuickGraph.Providers.VertexProvider.VertexType">
6935 <summary>
6936 Vertex type.
6937 </summary>
6938 </member>
6939 <member name="T:QuickGraph.Serialization.GraphML.DataExtensionType">
6940 <summary />
6941 <remarks />
6942 </member>
6943 <member name="F:QuickGraph.Serialization.GraphML.DataExtensionType._text">
6944 <summary />
6945 <remarks />
6946 </member>
6947 <member name="P:QuickGraph.Serialization.GraphML.DataExtensionType.Text">
6948 <summary />
6949 <remarks />
6950 </member>
6951 <member name="M:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.#ctor">
6952 <summary />
6953 <remarks />
6954 </member>
6955 <member name="M:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.Add(System.Object)">
6956 <summary />
6957 <remarks />
6958 </member>
6959 <member name="M:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.AddString(System.String)">
6960 <summary />
6961 <remarks />
6962 </member>
6963 <member name="M:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.ContainsString(System.String)">
6964 <summary />
6965 <remarks />
6966 </member>
6967 <member name="M:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.RemoveString(System.String)">
6968 <summary />
6969 <remarks />
6970 </member>
6971 <member name="M:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.ToString">
6972 <summary />
6973 <remarks />
6974 </member>
6975 <member name="P:QuickGraph.Serialization.GraphML.DataExtensionType.Textcollection.Item(System.Int32)">
6976 <summary />
6977 <remarks />
6978 </member>
6979 <member name="T:QuickGraph.Serialization.GraphML.DataType">
6980 <summary />
6981 <remarks />
6982 </member>
6983 <member name="F:QuickGraph.Serialization.GraphML.DataType._text">
6984 <summary />
6985 <remarks />
6986 </member>
6987 <member name="F:QuickGraph.Serialization.GraphML.DataType._key">
6988 <summary />
6989 <remarks />
6990 </member>
6991 <member name="F:QuickGraph.Serialization.GraphML.DataType.id">
6992 <summary />
6993 <remarks />
6994 </member>
6995 <member name="P:QuickGraph.Serialization.GraphML.DataType.Key">
6996 <summary />
6997 <remarks />
6998 </member>
6999 <member name="P:QuickGraph.Serialization.GraphML.DataType.ID">
7000 <summary />
7001 <remarks />
7002 </member>
7003 <member name="P:QuickGraph.Serialization.GraphML.DataType.Text">
7004 <summary />
7005 <remarks />
7006 </member>
7007 <member name="M:QuickGraph.Serialization.GraphML.DataType.Textcollection.#ctor">
7008 <summary />
7009 <remarks />
7010 </member>
7011 <member name="M:QuickGraph.Serialization.GraphML.DataType.Textcollection.Add(System.Object)">
7012 <summary />
7013 <remarks />
7014 </member>
7015 <member name="M:QuickGraph.Serialization.GraphML.DataType.Textcollection.AddString(System.String)">
7016 <summary />
7017 <remarks />
7018 </member>
7019 <member name="M:QuickGraph.Serialization.GraphML.DataType.Textcollection.ContainsString(System.String)">
7020 <summary />
7021 <remarks />
7022 </member>
7023 <member name="M:QuickGraph.Serialization.GraphML.DataType.Textcollection.RemoveString(System.String)">
7024 <summary />
7025 <remarks />
7026 </member>
7027 <member name="M:QuickGraph.Serialization.GraphML.DataType.Textcollection.ToString">
7028 <summary />
7029 <remarks />
7030 </member>
7031 <member name="P:QuickGraph.Serialization.GraphML.DataType.Textcollection.Item(System.Int32)">
7032 <summary />
7033 <remarks />
7034 </member>
7035 <member name="T:QuickGraph.Serialization.GraphML.DefaultType">
7036 <summary />
7037 <remarks />
7038 </member>
7039 <member name="F:QuickGraph.Serialization.GraphML.DefaultType._text">
7040 <summary />
7041 <remarks />
7042 </member>
7043 <member name="P:QuickGraph.Serialization.GraphML.DefaultType.Text">
7044 <summary />
7045 <remarks />
7046 </member>
7047 <member name="M:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.#ctor">
7048 <summary />
7049 <remarks />
7050 </member>
7051 <member name="M:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.Add(System.Object)">
7052 <summary />
7053 <remarks />
7054 </member>
7055 <member name="M:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.AddString(System.String)">
7056 <summary />
7057 <remarks />
7058 </member>
7059 <member name="M:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.ContainsString(System.String)">
7060 <summary />
7061 <remarks />
7062 </member>
7063 <member name="M:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.RemoveString(System.String)">
7064 <summary />
7065 <remarks />
7066 </member>
7067 <member name="M:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.ToString">
7068 <summary />
7069 <remarks />
7070 </member>
7071 <member name="P:QuickGraph.Serialization.GraphML.DefaultType.Textcollection.Item(System.Int32)">
7072 <summary />
7073 <remarks />
7074 </member>
7075 <member name="T:QuickGraph.Serialization.GraphML.EdgeType">
7076 <summary />
7077 <remarks />
7078 </member>
7079 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._directed">
7080 <summary />
7081 <remarks />
7082 </member>
7083 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._data">
7084 <summary />
7085 <remarks />
7086 </member>
7087 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._source">
7088 <summary />
7089 <remarks />
7090 </member>
7091 <member name="F:QuickGraph.Serialization.GraphML.EdgeType.id">
7092 <summary />
7093 <remarks />
7094 </member>
7095 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._sourceport">
7096 <summary />
7097 <remarks />
7098 </member>
7099 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._targetport">
7100 <summary />
7101 <remarks />
7102 </member>
7103 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._directedspecified">
7104 <summary />
7105 <remarks />
7106 </member>
7107 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._target">
7108 <summary />
7109 <remarks />
7110 </member>
7111 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._graph">
7112 <summary />
7113 <remarks />
7114 </member>
7115 <member name="F:QuickGraph.Serialization.GraphML.EdgeType._desc">
7116 <summary />
7117 <remarks />
7118 </member>
7119 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Desc">
7120 <summary />
7121 <remarks />
7122 </member>
7123 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Data">
7124 <summary />
7125 <remarks />
7126 </member>
7127 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Graph">
7128 <summary />
7129 <remarks />
7130 </member>
7131 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.ID">
7132 <summary />
7133 <remarks />
7134 </member>
7135 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Directed">
7136 <summary />
7137 <remarks />
7138 </member>
7139 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Directedspecified">
7140 <summary />
7141 <remarks />
7142 </member>
7143 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Source">
7144 <summary />
7145 <remarks />
7146 </member>
7147 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Target">
7148 <summary />
7149 <remarks />
7150 </member>
7151 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Sourceport">
7152 <summary />
7153 <remarks />
7154 </member>
7155 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.Targetport">
7156 <summary />
7157 <remarks />
7158 </member>
7159 <member name="M:QuickGraph.Serialization.GraphML.EdgeType.DataCollection.#ctor">
7160 <summary />
7161 <remarks />
7162 </member>
7163 <member name="M:QuickGraph.Serialization.GraphML.EdgeType.DataCollection.Add(System.Object)">
7164 <summary />
7165 <remarks />
7166 </member>
7167 <member name="M:QuickGraph.Serialization.GraphML.EdgeType.DataCollection.AddDataType(QuickGraph.Serialization.GraphML.DataType)">
7168 <summary />
7169 <remarks />
7170 </member>
7171 <member name="M:QuickGraph.Serialization.GraphML.EdgeType.DataCollection.ContainsDataType(QuickGraph.Serialization.GraphML.DataType)">
7172 <summary />
7173 <remarks />
7174 </member>
7175 <member name="M:QuickGraph.Serialization.GraphML.EdgeType.DataCollection.RemoveDataType(QuickGraph.Serialization.GraphML.DataType)">
7176 <summary />
7177 <remarks />
7178 </member>
7179 <member name="P:QuickGraph.Serialization.GraphML.EdgeType.DataCollection.Item(System.Int32)">
7180 <summary />
7181 <remarks />
7182 </member>
7183 <member name="T:QuickGraph.Serialization.GraphML.EndPointType">
7184 <summary />
7185 <remarks />
7186 </member>
7187 <member name="F:QuickGraph.Serialization.GraphML.EndPointType._node">
7188 <summary />
7189 <remarks />
7190 </member>
7191 <member name="F:QuickGraph.Serialization.GraphML.EndPointType.id">
7192 <summary />
7193 <remarks />
7194 </member>
7195 <member name="F:QuickGraph.Serialization.GraphML.EndPointType._port">
7196 <summary />
7197 <remarks />
7198 </member>
7199 <member name="F:QuickGraph.Serialization.GraphML.EndPointType._desc">
7200 <summary />
7201 <remarks />
7202 </member>
7203 <member name="F:QuickGraph.Serialization.GraphML.EndPointType._type">
7204 <summary />
7205 <remarks />
7206 </member>
7207 <member name="P:QuickGraph.Serialization.GraphML.EndPointType.Desc">
7208 <summary />
7209 <remarks />
7210 </member>
7211 <member name="P:QuickGraph.Serialization.GraphML.EndPointType.ID">
7212 <summary />
7213 <remarks />
7214 </member>
7215 <member name="P:QuickGraph.Serialization.GraphML.EndPointType.Port">
7216 <summary />
7217 <remarks />
7218 </member>
7219 <member name="P:QuickGraph.Serialization.GraphML.EndPointType.Node">
7220 <summary />
7221 <remarks />
7222 </member>
7223 <member name="P:QuickGraph.Serialization.GraphML.EndPointType.Type">
7224 <summary />
7225 <remarks />
7226 </member>
7227 <member name="T:QuickGraph.Serialization.GraphML.EndPointTypeType">
7228 <summary />
7229 <remarks />
7230 </member>
7231 <member name="F:QuickGraph.Serialization.GraphML.EndPointTypeType.IN">
7232 <summary />
7233 <remarks />
7234 </member>
7235 <member name="F:QuickGraph.Serialization.GraphML.EndPointTypeType.Out">
7236 <summary />
7237 <remarks />
7238 </member>
7239 <member name="F:QuickGraph.Serialization.GraphML.EndPointTypeType.Undir">
7240 <summary />
7241 <remarks />
7242 </member>
7243 <member name="T:QuickGraph.Serialization.GraphML.GraphEdgeDefaultType">
7244 <summary />
7245 <remarks />
7246 </member>
7247 <member name="F:QuickGraph.Serialization.GraphML.GraphEdgeDefaultType.Directed">
7248 <summary />
7249 <remarks />
7250 </member>
7251 <member name="F:QuickGraph.Serialization.GraphML.GraphEdgeDefaultType.Undirected">
7252 <summary />
7253 <remarks />
7254 </member>
7255 <member name="T:QuickGraph.Serialization.GraphML.GraphMltype">
7256 <summary />
7257 <remarks />
7258 </member>
7259 <member name="F:QuickGraph.Serialization.GraphML.GraphMltype._key">
7260 <summary />
7261 <remarks />
7262 </member>
7263 <member name="F:QuickGraph.Serialization.GraphML.GraphMltype._desc">
7264 <summary />
7265 <remarks />
7266 </member>
7267 <member name="F:QuickGraph.Serialization.GraphML.GraphMltype._items">
7268 <summary />
7269 <remarks />
7270 </member>
7271 <member name="P:QuickGraph.Serialization.GraphML.GraphMltype.Desc">
7272 <summary />
7273 <remarks />
7274 </member>
7275 <member name="P:QuickGraph.Serialization.GraphML.GraphMltype.Key">
7276 <summary />
7277 <remarks />
7278 </member>
7279 <member name="P:QuickGraph.Serialization.GraphML.GraphMltype.Items">
7280 <summary />
7281 <remarks />
7282 </member>
7283 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.#ctor">
7284 <summary />
7285 <remarks />
7286 </member>
7287 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.Add(System.Object)">
7288 <summary />
7289 <remarks />
7290 </member>
7291 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.AddGraph(QuickGraph.Serialization.GraphML.GraphType)">
7292 <summary />
7293 <remarks />
7294 </member>
7295 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.ContainsGraph(QuickGraph.Serialization.GraphML.GraphType)">
7296 <summary />
7297 <remarks />
7298 </member>
7299 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.RemoveGraph(QuickGraph.Serialization.GraphML.GraphType)">
7300 <summary />
7301 <remarks />
7302 </member>
7303 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.AddData(QuickGraph.Serialization.GraphML.DataType)">
7304 <summary />
7305 <remarks />
7306 </member>
7307 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.ContainsData(QuickGraph.Serialization.GraphML.DataType)">
7308 <summary />
7309 <remarks />
7310 </member>
7311 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.RemoveData(QuickGraph.Serialization.GraphML.DataType)">
7312 <summary />
7313 <remarks />
7314 </member>
7315 <member name="P:QuickGraph.Serialization.GraphML.GraphMltype.ItemCollection.Item(System.Int32)">
7316 <summary />
7317 <remarks />
7318 </member>
7319 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.KeyCollection.#ctor">
7320 <summary />
7321 <remarks />
7322 </member>
7323 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.KeyCollection.Add(System.Object)">
7324 <summary />
7325 <remarks />
7326 </member>
7327 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.KeyCollection.AddKeyType(QuickGraph.Serialization.GraphML.KeyType)">
7328 <summary />
7329 <remarks />
7330 </member>
7331 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.KeyCollection.ContainsKeyType(QuickGraph.Serialization.GraphML.KeyType)">
7332 <summary />
7333 <remarks />
7334 </member>
7335 <member name="M:QuickGraph.Serialization.GraphML.GraphMltype.KeyCollection.RemoveKeyType(QuickGraph.Serialization.GraphML.KeyType)">
7336 <summary />
7337 <remarks />
7338 </member>
7339 <member name="P:QuickGraph.Serialization.GraphML.GraphMltype.KeyCollection.Item(System.Int32)">
7340 <summary />
7341 <remarks />
7342 </member>
7343 <member name="T:QuickGraph.Serialization.GraphML.GraphType">
7344 <summary />
7345 <remarks />
7346 </member>
7347 <member name="F:QuickGraph.Serialization.GraphML.GraphType._items">
7348 <summary />
7349 <remarks />
7350 </member>
7351 <member name="F:QuickGraph.Serialization.GraphML.GraphType._edgeDefault">
7352 <summary />
7353 <remarks />
7354 </member>
7355 <member name="F:QuickGraph.Serialization.GraphML.GraphType._desc">
7356 <summary />
7357 <remarks />
7358 </member>
7359 <member name="F:QuickGraph.Serialization.GraphML.GraphType.id">
7360 <summary />
7361 <remarks />
7362 </member>
7363 <member name="P:QuickGraph.Serialization.GraphML.GraphType.Desc">
7364 <summary />
7365 <remarks />
7366 </member>
7367 <member name="P:QuickGraph.Serialization.GraphML.GraphType.Items">
7368 <summary />
7369 <remarks />
7370 </member>
7371 <member name="P:QuickGraph.Serialization.GraphML.GraphType.ID">
7372 <summary />
7373 <remarks />
7374 </member>
7375 <member name="P:QuickGraph.Serialization.GraphML.GraphType.EdgeDefault">
7376 <summary />
7377 <remarks />
7378 </member>
7379 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.#ctor">
7380 <summary />
7381 <remarks />
7382 </member>
7383 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.Add(System.Object)">
7384 <summary />
7385 <remarks />
7386 </member>
7387 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.AddLocator(QuickGraph.Serialization.GraphML.LocatorType)">
7388 <summary />
7389 <remarks />
7390 </member>
7391 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.ContainsLocator(QuickGraph.Serialization.GraphML.LocatorType)">
7392 <summary />
7393 <remarks />
7394 </member>
7395 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.RemoveLocator(QuickGraph.Serialization.GraphML.LocatorType)">
7396 <summary />
7397 <remarks />
7398 </member>
7399 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.AddEdge(QuickGraph.Serialization.GraphML.EdgeType)">
7400 <summary />
7401 <remarks />
7402 </member>
7403 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.ContainsEdge(QuickGraph.Serialization.GraphML.EdgeType)">
7404 <summary />
7405 <remarks />
7406 </member>
7407 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.RemoveEdge(QuickGraph.Serialization.GraphML.EdgeType)">
7408 <summary />
7409 <remarks />
7410 </member>
7411 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.AddNode(QuickGraph.Serialization.GraphML.NodeType)">
7412 <summary />
7413 <remarks />
7414 </member>
7415 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.ContainsNode(QuickGraph.Serialization.GraphML.NodeType)">
7416 <summary />
7417 <remarks />
7418 </member>
7419 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.RemoveNode(QuickGraph.Serialization.GraphML.NodeType)">
7420 <summary />
7421 <remarks />
7422 </member>
7423 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.AddData(QuickGraph.Serialization.GraphML.DataType)">
7424 <summary />
7425 <remarks />
7426 </member>
7427 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.ContainsData(QuickGraph.Serialization.GraphML.DataType)">
7428 <summary />
7429 <remarks />
7430 </member>
7431 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.RemoveData(QuickGraph.Serialization.GraphML.DataType)">
7432 <summary />
7433 <remarks />
7434 </member>
7435 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.AddHyperEdge(QuickGraph.Serialization.GraphML.HyperEdgeType)">
7436 <summary />
7437 <remarks />
7438 </member>
7439 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.ContainsHyperEdge(QuickGraph.Serialization.GraphML.HyperEdgeType)">
7440 <summary />
7441 <remarks />
7442 </member>
7443 <member name="M:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.RemoveHyperEdge(QuickGraph.Serialization.GraphML.HyperEdgeType)">
7444 <summary />
7445 <remarks />
7446 </member>
7447 <member name="P:QuickGraph.Serialization.GraphML.GraphType.ItemCollection.Item(System.Int32)">
7448 <summary />
7449 <remarks />
7450 </member>
7451 <member name="T:QuickGraph.Serialization.GraphML.HyperEdgeType">
7452 <summary />
7453 <remarks />
7454 </member>
7455 <member name="F:QuickGraph.Serialization.GraphML.HyperEdgeType._items">
7456 <summary />
7457 <remarks />
7458 </member>
7459 <member name="F:QuickGraph.Serialization.GraphML.HyperEdgeType._desc">
7460 <summary />
7461 <remarks />
7462 </member>
7463 <member name="F:QuickGraph.Serialization.GraphML.HyperEdgeType.id">
7464 <summary />
7465 <remarks />
7466 </member>
7467 <member name="F:QuickGraph.Serialization.GraphML.HyperEdgeType._graph">
7468 <summary />
7469 <remarks />
7470 </member>
7471 <member name="P:QuickGraph.Serialization.GraphML.HyperEdgeType.Desc">
7472 <summary />
7473 <remarks />
7474 </member>
7475 <member name="P:QuickGraph.Serialization.GraphML.HyperEdgeType.Items">
7476 <summary />
7477 <remarks />
7478 </member>
7479 <member name="P:QuickGraph.Serialization.GraphML.HyperEdgeType.Graph">
7480 <summary />
7481 <remarks />
7482 </member>
7483 <member name="P:QuickGraph.Serialization.GraphML.HyperEdgeType.ID">
7484 <summary />
7485 <remarks />
7486 </member>
7487 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.#ctor">
7488 <summary />
7489 <remarks />
7490 </member>
7491 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.Add(System.Object)">
7492 <summary />
7493 <remarks />
7494 </member>
7495 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.AddData(QuickGraph.Serialization.GraphML.DataType)">
7496 <summary />
7497 <remarks />
7498 </member>
7499 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.ContainsData(QuickGraph.Serialization.GraphML.DataType)">
7500 <summary />
7501 <remarks />
7502 </member>
7503 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.RemoveData(QuickGraph.Serialization.GraphML.DataType)">
7504 <summary />
7505 <remarks />
7506 </member>
7507 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.AddEndPoint(QuickGraph.Serialization.GraphML.EndPointType)">
7508 <summary />
7509 <remarks />
7510 </member>
7511 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.ContainsEndPoint(QuickGraph.Serialization.GraphML.EndPointType)">
7512 <summary />
7513 <remarks />
7514 </member>
7515 <member name="M:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.RemoveEndPoint(QuickGraph.Serialization.GraphML.EndPointType)">
7516 <summary />
7517 <remarks />
7518 </member>
7519 <member name="P:QuickGraph.Serialization.GraphML.HyperEdgeType.ItemCollection.Item(System.Int32)">
7520 <summary />
7521 <remarks />
7522 </member>
7523 <member name="T:QuickGraph.Serialization.GraphML.KeyForType">
7524 <summary />
7525 <remarks />
7526 </member>
7527 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.All">
7528 <summary />
7529 <remarks />
7530 </member>
7531 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.Graph">
7532 <summary />
7533 <remarks />
7534 </member>
7535 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.Node">
7536 <summary />
7537 <remarks />
7538 </member>
7539 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.Edge">
7540 <summary />
7541 <remarks />
7542 </member>
7543 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.HyperEdge">
7544 <summary />
7545 <remarks />
7546 </member>
7547 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.Port">
7548 <summary />
7549 <remarks />
7550 </member>
7551 <member name="F:QuickGraph.Serialization.GraphML.KeyForType.EndPoint">
7552 <summary />
7553 <remarks />
7554 </member>
7555 <member name="T:QuickGraph.Serialization.GraphML.KeyType">
7556 <summary />
7557 <remarks />
7558 </member>
7559 <member name="F:QuickGraph.Serialization.GraphML.KeyType._default">
7560 <summary />
7561 <remarks />
7562 </member>
7563 <member name="F:QuickGraph.Serialization.GraphML.KeyType.id">
7564 <summary />
7565 <remarks />
7566 </member>
7567 <member name="F:QuickGraph.Serialization.GraphML.KeyType._desc">
7568 <summary />
7569 <remarks />
7570 </member>
7571 <member name="F:QuickGraph.Serialization.GraphML.KeyType._for">
7572 <summary />
7573 <remarks />
7574 </member>
7575 <member name="P:QuickGraph.Serialization.GraphML.KeyType.Desc">
7576 <summary />
7577 <remarks />
7578 </member>
7579 <member name="P:QuickGraph.Serialization.GraphML.KeyType.Default">
7580 <summary />
7581 <remarks />
7582 </member>
7583 <member name="P:QuickGraph.Serialization.GraphML.KeyType.ID">
7584 <summary />
7585 <remarks />
7586 </member>
7587 <member name="P:QuickGraph.Serialization.GraphML.KeyType.For">
7588 <summary />
7589 <remarks />
7590 </member>
7591 <member name="T:QuickGraph.Serialization.GraphML.LocatorType">
7592 <summary />
7593 <remarks />
7594 </member>
7595 <member name="T:QuickGraph.Serialization.GraphML.NamespaceDoc">
7596 <summary>
7597 The <b>QuickGraph.Serialization.GraphML</b> contains the classes
7598 that map the GraphML schema.
7599 </summary>
7600 </member>
7601 <member name="T:QuickGraph.Serialization.GraphML.NodeType">
7602 <summary />
7603 <remarks />
7604 </member>
7605 <member name="F:QuickGraph.Serialization.GraphML.NodeType._items">
7606 <summary />
7607 <remarks />
7608 </member>
7609 <member name="F:QuickGraph.Serialization.GraphML.NodeType._desc">
7610 <summary />
7611 <remarks />
7612 </member>
7613 <member name="F:QuickGraph.Serialization.GraphML.NodeType.id">
7614 <summary />
7615 <remarks />
7616 </member>
7617 <member name="P:QuickGraph.Serialization.GraphML.NodeType.Desc">
7618 <summary />
7619 <remarks />
7620 </member>
7621 <member name="P:QuickGraph.Serialization.GraphML.NodeType.Items">
7622 <summary />
7623 <remarks />
7624 </member>
7625 <member name="P:QuickGraph.Serialization.GraphML.NodeType.ID">
7626 <summary />
7627 <remarks />
7628 </member>
7629 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.#ctor">
7630 <summary />
7631 <remarks />
7632 </member>
7633 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.Add(System.Object)">
7634 <summary />
7635 <remarks />
7636 </member>
7637 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.AddLocator(QuickGraph.Serialization.GraphML.LocatorType)">
7638 <summary />
7639 <remarks />
7640 </member>
7641 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.ContainsLocator(QuickGraph.Serialization.GraphML.LocatorType)">
7642 <summary />
7643 <remarks />
7644 </member>
7645 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.RemoveLocator(QuickGraph.Serialization.GraphML.LocatorType)">
7646 <summary />
7647 <remarks />
7648 </member>
7649 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.AddGraph(QuickGraph.Serialization.GraphML.GraphType)">
7650 <summary />
7651 <remarks />
7652 </member>
7653 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.ContainsGraph(QuickGraph.Serialization.GraphML.GraphType)">
7654 <summary />
7655 <remarks />
7656 </member>
7657 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.RemoveGraph(QuickGraph.Serialization.GraphML.GraphType)">
7658 <summary />
7659 <remarks />
7660 </member>
7661 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.AddData(QuickGraph.Serialization.GraphML.DataType)">
7662 <summary />
7663 <remarks />
7664 </member>
7665 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.ContainsData(QuickGraph.Serialization.GraphML.DataType)">
7666 <summary />
7667 <remarks />
7668 </member>
7669 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.RemoveData(QuickGraph.Serialization.GraphML.DataType)">
7670 <summary />
7671 <remarks />
7672 </member>
7673 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.AddPort(QuickGraph.Serialization.GraphML.PortType)">
7674 <summary />
7675 <remarks />
7676 </member>
7677 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.ContainsPort(QuickGraph.Serialization.GraphML.PortType)">
7678 <summary />
7679 <remarks />
7680 </member>
7681 <member name="M:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.RemovePort(QuickGraph.Serialization.GraphML.PortType)">
7682 <summary />
7683 <remarks />
7684 </member>
7685 <member name="P:QuickGraph.Serialization.GraphML.NodeType.ItemCollection.Item(System.Int32)">
7686 <summary />
7687 <remarks />
7688 </member>
7689 <member name="T:QuickGraph.Serialization.GraphML.PortType">
7690 <summary />
7691 <remarks />
7692 </member>
7693 <member name="F:QuickGraph.Serialization.GraphML.PortType._items">
7694 <summary />
7695 <remarks />
7696 </member>
7697 <member name="F:QuickGraph.Serialization.GraphML.PortType._name">
7698 <summary />
7699 <remarks />
7700 </member>
7701 <member name="F:QuickGraph.Serialization.GraphML.PortType._desc">
7702 <summary />
7703 <remarks />
7704 </member>
7705 <member name="P:QuickGraph.Serialization.GraphML.PortType.Desc">
7706 <summary />
7707 <remarks />
7708 </member>
7709 <member name="P:QuickGraph.Serialization.GraphML.PortType.Items">
7710 <summary />
7711 <remarks />
7712 </member>
7713 <member name="P:QuickGraph.Serialization.GraphML.PortType.Name">
7714 <summary />
7715 <remarks />
7716 </member>
7717 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.#ctor">
7718 <summary />
7719 <remarks />
7720 </member>
7721 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.Add(System.Object)">
7722 <summary />
7723 <remarks />
7724 </member>
7725 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.AddPort(QuickGraph.Serialization.GraphML.PortType)">
7726 <summary />
7727 <remarks />
7728 </member>
7729 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.ContainsPort(QuickGraph.Serialization.GraphML.PortType)">
7730 <summary />
7731 <remarks />
7732 </member>
7733 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.RemovePort(QuickGraph.Serialization.GraphML.PortType)">
7734 <summary />
7735 <remarks />
7736 </member>
7737 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.AddData(QuickGraph.Serialization.GraphML.DataType)">
7738 <summary />
7739 <remarks />
7740 </member>
7741 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.ContainsData(QuickGraph.Serialization.GraphML.DataType)">
7742 <summary />
7743 <remarks />
7744 </member>
7745 <member name="M:QuickGraph.Serialization.GraphML.PortType.ItemCollection.RemoveData(QuickGraph.Serialization.GraphML.DataType)">
7746 <summary />
7747 <remarks />
7748 </member>
7749 <member name="P:QuickGraph.Serialization.GraphML.PortType.ItemCollection.Item(System.Int32)">
7750 <summary />
7751 <remarks />
7752 </member>
7753 <member name="T:QuickGraph.Serialization.GraphMLGraphSerializer">
7754 <summary>
7755 Graph serializer to the GraphML format.
7756 </summary>
7757 <remarks>
7758 <para>
7759 This object serializes outputs to the GraphML
7760 (http://graphml.graphdrawing.org/) format.
7761 </para>
7762 </remarks>
7763 <example name="SaveGraphML">
7764<para>
7765The following example takes a graph and serializes it to GraphML format to the Console window.
7766All <see cref="T:QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph"/> instance are serializable
7767(<see cref="!:Serialization.Representation.AdjacencyGraph"/> implements this type).
7768</para>
7769<code>
7770using System.Xml;
7771using QuickGraph.Serialization;
7772...
7773
7774// create human readable xml writer
7775XmlTextWriter writer = new XmlTextWriter(Console.Out);
7776writer.Formatting = Formatting.Indented;
7777
7778// the graph to serialize
7779ISerializableVertexAndEdgeListGraph g = ...;
7780
7781// create serializer
7782GraphMLGraphSerializer ser = new GraphMLGraphSerializer();
7783// serialize graph
7784ser.Serialize(writer,g);
7785</code>
7786</example>
7787 </member>
7788 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.#ctor">
7789 <summary>
7790 Default constructor
7791 </summary>
7792 </member>
7793 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.Serialize(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
7794 <summary>
7795 Serializes g to xml
7796 </summary>
7797 <param name="writer">xml writer</param>
7798 <param name="g">graph to serialize</param>
7799 <exception cref="T:System.ArgumentNullException">writer or g are null</exception>
7800 <exception cref="T:System.ArgumentException">g vertex or edge does not
7801 implement <see cref="T:QuickGraph.Concepts.Serialization.IGraphSerializable"/>.
7802 </exception>
7803 </member>
7804 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.Serialize(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph,QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph)">
7805 <summary>
7806 Serializes the filtered graph g to xml
7807 </summary>
7808 <param name="writer">xml writer</param>
7809 <param name="baseGraph">"base" graph of g</param>
7810 <param name="g">graph to serialize</param>
7811 <exception cref="T:System.ArgumentNullException">writer or g are null</exception>
7812 <exception cref="T:System.ArgumentException">g vertex or edge does not
7813 implement <see cref="T:QuickGraph.Concepts.Serialization.IGraphSerializable"/>.
7814 </exception>
7815 </member>
7816 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.FormatID(QuickGraph.Concepts.IVertex)">
7817 <summary>
7818 Formats the vertex ID number
7819 </summary>
7820 <param name="v">vertex</param>
7821 <returns>v.ID formatted</returns>
7822 </member>
7823 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.FormatID(QuickGraph.Concepts.IEdge)">
7824 <summary>
7825 Formats the edge ID number
7826 </summary>
7827 <param name="e">edge</param>
7828 <returns>e.ID formatted</returns>
7829 </member>
7830 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.GetTypeQualifiedName(System.Object)">
7831 <summary>
7832 Returns qualifed type name of o
7833 </summary>
7834 <param name="o"></param>
7835 <returns></returns>
7836 </member>
7837 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.GetTypeQualifiedName(System.Type)">
7838 <summary>
7839
7840 </summary>
7841 <param name="t"></param>
7842 <returns></returns>
7843 </member>
7844 <member name="M:QuickGraph.Serialization.GraphMLGraphSerializer.CreateGraph(System.Type,System.Type,System.Type,QuickGraph.Serialization.GraphML.GraphEdgeDefaultType,System.Boolean)">
7845 <summary>
7846
7847 </summary>
7848 <param name="graphType"></param>
7849 <param name="vertexProviderType"></param>
7850 <param name="edgeProviderType"></param>
7851 <param name="directed"></param>
7852 <param name="allowParallelEdges"></param>
7853 <returns></returns>
7854 </member>
7855 <member name="P:QuickGraph.Serialization.GraphMLGraphSerializer.CreatedVertices">
7856 <summary>
7857 Created vertices table
7858 </summary>
7859 </member>
7860 <member name="P:QuickGraph.Serialization.GraphMLGraphSerializer.CreatedEdges">
7861 <summary>
7862 Created vertices table
7863 </summary>
7864 </member>
7865 <member name="T:QuickGraph.Serialization.GraphSerializationInfo">
7866 <summary>
7867 A data holder class
7868 </summary>
7869 </member>
7870 <member name="M:QuickGraph.Serialization.GraphSerializationInfo.#ctor(System.Boolean)">
7871 <summary>
7872 Creates a new data holder class.
7873 </summary>
7874 <param name="isSerializing">true if it is used for serialization,
7875 false otherwize</param>
7876 </member>
7877 <member name="M:QuickGraph.Serialization.GraphSerializationInfo.Add(System.String,System.Object)">
7878 <summary>
7879 Adds a new key-value pair
7880 </summary>
7881 <param name="key">value identifier</param>
7882 <param name="value">value</param>
7883 <exception cref="T:System.ArgumentNullException">key</exception>
7884 </member>
7885 <member name="M:QuickGraph.Serialization.GraphSerializationInfo.Contains(System.String)">
7886 <summary>
7887 Gets a value indicating if the key is in the data entries.
7888 </summary>
7889 <param name="key">key to test</param>
7890 <returns>
7891 true if key is in the data collection, false otherwise
7892 </returns>
7893 </member>
7894 <member name="P:QuickGraph.Serialization.GraphSerializationInfo.IsSerializing">
7895 <summary>
7896 True if serializing
7897 </summary>
7898 </member>
7899 <member name="P:QuickGraph.Serialization.GraphSerializationInfo.Count">
7900 <summary>
7901 Number of key-value pair in the data bag.
7902 </summary>
7903 </member>
7904 <member name="P:QuickGraph.Serialization.GraphSerializationInfo.Item(System.String)">
7905 <summary>
7906 Gets or sets a data entry in the graph info collection
7907 </summary>
7908 <exception cref="T:System.InvalidOperationException">
7909 set property,set a value while the graph info is deserializing
7910 </exception>
7911 <exception cref="T:System.MissingFieldException">
7912 get property, the requested key is not found
7913 </exception>
7914 </member>
7915 <member name="T:QuickGraph.Serialization.GraphSerializer">
7916 <summary>
7917 Base class for Graph serializers.
7918 </summary>
7919 <example>
7920 This example takes an AdjacencyGraph and serializes it to GraphML
7921 format:
7922 <code>
7923 // getting xml writer
7924 XmlTextWriter writer = new XmlTextWriter(Console.Out);
7925 writer.Formatting = Formatting.Indented;
7926 // gettin graph
7927 AdjacencyGraph g = ...;
7928 GraphSerializer ser = new GraphMlSerializer();
7929 // serialize to GraphML
7930 ser.Serialize(writer,g);
7931 </code>
7932 </example>
7933 </member>
7934 <member name="M:QuickGraph.Serialization.GraphSerializer.#ctor">
7935 <summary>
7936 Default constructor
7937 </summary>
7938 </member>
7939 <member name="M:QuickGraph.Serialization.GraphSerializer.Serialize(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
7940 <summary>
7941 Serializes g to xml
7942 </summary>
7943 <param name="writer">xml writer</param>
7944 <param name="g">graph to serialize</param>
7945 <exception cref="T:System.ArgumentNullException">writer or g are null</exception>
7946 <exception cref="T:System.ArgumentException">g vertex or edge does not
7947 implement <see cref="T:QuickGraph.Concepts.Serialization.IGraphSerializable"/>.
7948 </exception>
7949 </member>
7950 <member name="M:QuickGraph.Serialization.GraphSerializer.Serialize(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph,QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph)">
7951 <summary>
7952 Serializes the filtered graph g to xml
7953 </summary>
7954 <param name="writer">xml writer</param>
7955 <param name="baseGraph">"base" graph of g</param>
7956 <param name="g">graph to serialize</param>
7957 <exception cref="T:System.ArgumentNullException">writer or g are null</exception>
7958 <exception cref="T:System.ArgumentException">g vertex or edge does not
7959 implement <see cref="T:QuickGraph.Concepts.Serialization.IGraphSerializable"/>.
7960 </exception>
7961 </member>
7962 <member name="M:QuickGraph.Serialization.GraphSerializer.Deserialize(System.Xml.XmlReader)">
7963 <summary>
7964 Deserializes data from Xml stream.
7965 </summary>
7966 <param name="reader">xml stream</param>
7967 <returns>deserialized data</returns>
7968 </member>
7969 <member name="M:QuickGraph.Serialization.GraphSerializer.WriteGraphElem(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph,QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph)">
7970 <summary>
7971 Create the graph element and stores graph level data.
7972 </summary>
7973 <param name="writer">xml writer</param>
7974 <param name="baseGraph">"base" graph of g</param>
7975 <param name="g">graph to serialize</param>
7976 </member>
7977 <member name="M:QuickGraph.Serialization.GraphSerializer.WriteEndGraphElem(System.Xml.XmlWriter)">
7978 <summary>
7979 Closes the graph element.
7980 </summary>
7981 <param name="writer">xml writer</param>
7982 </member>
7983 <member name="M:QuickGraph.Serialization.GraphSerializer.WriteVertexElem(System.Xml.XmlWriter,QuickGraph.Concepts.IVertex,QuickGraph.Serialization.GraphSerializationInfo)">
7984 <summary>
7985 Writes a vertex element and it's custom data stored in info.
7986 </summary>
7987 <param name="writer">xml writer</param>
7988 <param name="v">vertex to store</param>
7989 <param name="info">vertex custom data</param>
7990 </member>
7991 <member name="M:QuickGraph.Serialization.GraphSerializer.WriteEdgeElem(System.Xml.XmlWriter,QuickGraph.Concepts.IEdge,QuickGraph.Serialization.GraphSerializationInfo)">
7992 <summary>
7993 Writes a vertex element and it's custom data stored in info.
7994 </summary>
7995 <param name="writer">xml writer</param>
7996 <param name="e">edge to store</param>
7997 <param name="info">edge custom data</param>
7998 </member>
7999 <member name="M:QuickGraph.Serialization.GraphSerializer.ReadGraphElem(System.Xml.XmlReader)">
8000 <summary>
8001 Reads graph data and creates new graph instance
8002 </summary>
8003 <param name="reader">xml reader opened on graph data</param>
8004 <returns>created graph instance</returns>
8005 </member>
8006 <member name="M:QuickGraph.Serialization.GraphSerializer.ReadEndGraphElem(System.Xml.XmlReader)">
8007 <summary>
8008
8009 </summary>
8010 <param name="reader"></param>
8011 </member>
8012 <member name="M:QuickGraph.Serialization.GraphSerializer.ReadVertexOrEdge(System.Xml.XmlReader,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
8013 <summary>
8014 Reads vertex or edge data
8015 </summary>
8016 <param name="reader"></param>
8017 <param name="g"></param>
8018 </member>
8019 <member name="M:QuickGraph.Serialization.GraphSerializer.FormatID(QuickGraph.Concepts.IEdge)">
8020 <summary>
8021 Formats the edge ID number
8022 </summary>
8023 <param name="e">edge</param>
8024 <returns>e.ID formatted</returns>
8025 </member>
8026 <member name="M:QuickGraph.Serialization.GraphSerializer.ParseVertexID(System.String)">
8027 <summary>
8028 Parses vertex id of the form 'vdd' where dd is the id number
8029 </summary>
8030 <param name="id">id identifier</param>
8031 <returns>id number</returns>
8032 </member>
8033 <member name="M:QuickGraph.Serialization.GraphSerializer.ParseEdgeID(System.String)">
8034 <summary>
8035 Parses edge id of the form 'edd' where dd is the id number
8036 </summary>
8037 <param name="id">id identifier</param>
8038 <returns>id number</returns>
8039 </member>
8040 <member name="M:QuickGraph.Serialization.GraphSerializer.FormatID(QuickGraph.Concepts.IVertex)">
8041 <summary>
8042 Formats the vertex ID number
8043 </summary>
8044 <param name="v">vertex</param>
8045 <returns>v.ID formatted</returns>
8046 </member>
8047 <member name="M:QuickGraph.Serialization.GraphSerializer.GetTypeQualifiedName(System.Object)">
8048 <summary>
8049 Returns qualifed type name of o
8050 </summary>
8051 <param name="o"></param>
8052 <returns></returns>
8053 </member>
8054 <member name="M:QuickGraph.Serialization.GraphSerializer.GetTypeQualifiedName(System.Type)">
8055 <summary>
8056
8057 </summary>
8058 <param name="t"></param>
8059 <returns></returns>
8060 </member>
8061 <member name="M:QuickGraph.Serialization.GraphSerializer.MoveToAttribute(System.Xml.XmlReader,System.String,System.Boolean)">
8062 <summary>
8063
8064 </summary>
8065 <param name="reader"></param>
8066 <param name="name"></param>
8067 </member>
8068 <member name="M:QuickGraph.Serialization.GraphSerializer.MoveNextElement(System.Xml.XmlReader)">
8069 <summary>
8070 Moves reader to element with name = name
8071 </summary>
8072 <param name="reader"></param>
8073 </member>
8074 <member name="M:QuickGraph.Serialization.GraphSerializer.MoveToElement(System.Xml.XmlReader,System.String)">
8075 <summary>
8076 Moves reader to element with name = name
8077 </summary>
8078 <param name="reader"></param>
8079 <param name="name"></param>
8080 </member>
8081 <member name="M:QuickGraph.Serialization.GraphSerializer.MoveToElement(System.Xml.XmlReader,System.String,System.String)">
8082 <summary>
8083
8084 </summary>
8085 <param name="reader"></param>
8086 <param name="name"></param>
8087 <param name="name2"></param>
8088 <returns></returns>
8089 </member>
8090 <member name="M:QuickGraph.Serialization.GraphSerializer.MovePastEndElement(System.Xml.XmlReader,System.String)">
8091 <summary>
8092
8093 </summary>
8094 <param name="reader"></param>
8095 <param name="name"></param>
8096 </member>
8097 <member name="M:QuickGraph.Serialization.GraphSerializer.CreateGraph(System.Type,System.Type,System.Type,System.Boolean,System.Boolean)">
8098 <summary>
8099
8100 </summary>
8101 <param name="graphType"></param>
8102 <param name="vertexProviderType"></param>
8103 <param name="edgeProviderType"></param>
8104 <param name="directed"></param>
8105 <param name="allowParallelEdges"></param>
8106 <returns></returns>
8107 </member>
8108 <member name="P:QuickGraph.Serialization.GraphSerializer.CreatedVertices">
8109 <summary>
8110 Created vertices table
8111 </summary>
8112 </member>
8113 <member name="P:QuickGraph.Serialization.GraphSerializer.CreatedEdges">
8114 <summary>
8115 Created vertices table
8116 </summary>
8117 </member>
8118 <member name="T:QuickGraph.Serialization.GxlGraphSerializer">
8119 <summary>
8120 Graph serializer to the GXL format.
8121 </summary>
8122 <remarks>
8123 <para>
8124 This object serializes outputs to the GXL (http://www.gupro.de/GXL/)
8125 format.
8126 </para>
8127 </remarks>
8128 </member>
8129 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.WriteGraphElem(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph,QuickGraph.Concepts.Traversals.IVertexAndEdgeListGraph)">
8130 <summary>
8131 Create the graph element and stores graph level data.
8132 </summary>
8133 <param name="writer">xml writer</param>
8134 <param name="baseGraph">"base" graph of g</param>
8135 <param name="g">graph to serialize</param>
8136 </member>
8137 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.WriteEndGraphElem(System.Xml.XmlWriter)">
8138 <summary>
8139 Closes the graph element.
8140 </summary>
8141 <param name="writer">xml writer</param>
8142 </member>
8143 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.WriteVertexElem(System.Xml.XmlWriter,QuickGraph.Concepts.IVertex,QuickGraph.Serialization.GraphSerializationInfo)">
8144 <summary>
8145 Writes a vertex element and it's custom data stored in info.
8146 </summary>
8147 <param name="writer">xml writer</param>
8148 <param name="v">vertex to store</param>
8149 <param name="info">vertex custom data</param>
8150 </member>
8151 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.WriteEdgeElem(System.Xml.XmlWriter,QuickGraph.Concepts.IEdge,QuickGraph.Serialization.GraphSerializationInfo)">
8152 <summary>
8153 Writes a vertex element and it's custom data stored in info.
8154 </summary>
8155 <param name="writer">xml writer</param>
8156 <param name="e">edge to store</param>
8157 <param name="info">edge custom data</param>
8158 </member>
8159 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.ReadGraphElem(System.Xml.XmlReader)">
8160 <summary>
8161 Reads graph data and creates new graph instance
8162 </summary>
8163 <param name="reader">xml reader opened on graph data</param>
8164 <returns>created graph instance</returns>
8165 </member>
8166 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.ReadEndGraphElem(System.Xml.XmlReader)">
8167 <summary>
8168
8169 </summary>
8170 <param name="reader"></param>
8171 </member>
8172 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.ReadVertexOrEdge(System.Xml.XmlReader,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
8173 <summary>
8174 Reads vertex or edge data
8175 </summary>
8176 <param name="reader"></param>
8177 <param name="g"></param>
8178 </member>
8179 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.ReadVertex(System.Xml.XmlReader,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
8180 <summary>
8181
8182 </summary>
8183 <param name="reader"></param>
8184 <param name="g"></param>
8185 </member>
8186 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.ReadEdge(System.Xml.XmlReader,QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
8187 <summary>
8188
8189 </summary>
8190 <param name="reader"></param>
8191 <param name="g"></param>
8192 </member>
8193 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.WriteInfo(System.Xml.XmlWriter,QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
8194 <summary>
8195 Writes custom info to GraphMl
8196 </summary>
8197 <param name="writer">xml writer</param>
8198 <param name="info">custom data</param>
8199 </member>
8200 <member name="M:QuickGraph.Serialization.GxlGraphSerializer.ReadInfo(System.Xml.XmlReader)">
8201 <summary>
8202 Reads custom info from GraphMl
8203 </summary>
8204 <param name="reader">xml reader</param>
8205 <returns>custom data</returns>
8206 </member>
8207 <member name="T:QuickGraph.Serialization.SerializableEdge">
8208 <summary>
8209 Summary description for SerializableEdge.
8210 </summary>
8211 </member>
8212 <member name="M:QuickGraph.Serialization.SerializableEdge.#ctor(System.Int32,QuickGraph.Concepts.IVertex,QuickGraph.Concepts.IVertex)">
8213 <summary>
8214 Default constructor
8215 </summary>
8216 <param name="id"></param>
8217 </member>
8218 <member name="M:QuickGraph.Serialization.SerializableEdge.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
8219 <summary>
8220 Adds nothing to serialization info
8221 </summary>
8222 <param name="info">data holder</param>
8223 <exception cref="T:System.ArgumentNullException">info is null</exception>
8224 <exception cref="T:System.ArgumentException">info is not serializing</exception>
8225 </member>
8226 <member name="M:QuickGraph.Serialization.SerializableEdge.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
8227 <summary>
8228 Reads no data from serialization info
8229 </summary>
8230 <param name="info">data holder</param>
8231 <exception cref="T:System.ArgumentNullException">info is null</exception>
8232 <exception cref="T:System.ArgumentException">info is serializing</exception>
8233 </member>
8234 <member name="P:QuickGraph.Serialization.SerializableEdge.Entries">
8235 <summary>
8236 Gets the dictionary of key-and-value pairs
8237 </summary>
8238 <value>
8239 Data entries
8240 </value>
8241 </member>
8242 <member name="T:QuickGraph.Serialization.SerializableVertex">
8243 <summary>
8244 Summary description for SerializableVertex.
8245 </summary>
8246 </member>
8247 <member name="M:QuickGraph.Serialization.SerializableVertex.#ctor(System.Int32)">
8248 <summary>
8249 Default constructor
8250 </summary>
8251 <param name="id"></param>
8252 </member>
8253 <member name="M:QuickGraph.Serialization.SerializableVertex.WriteGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
8254 <summary>
8255 Adds nothing to serialization info
8256 </summary>
8257 <param name="info">data holder</param>
8258 <exception cref="T:System.ArgumentNullException">info is null</exception>
8259 <exception cref="T:System.ArgumentException">info is not serializing</exception>
8260 </member>
8261 <member name="M:QuickGraph.Serialization.SerializableVertex.ReadGraphData(QuickGraph.Concepts.Serialization.IGraphSerializationInfo)">
8262 <summary>
8263 Reads no data from serialization info
8264 </summary>
8265 <param name="info">data holder</param>
8266 <exception cref="T:System.ArgumentNullException">info is null</exception>
8267 <exception cref="T:System.ArgumentException">info is serializing</exception>
8268 </member>
8269 <member name="P:QuickGraph.Serialization.SerializableVertex.Entries">
8270 <summary>
8271 Gets the dictionary of key-and-value pairs
8272 </summary>
8273 <value>
8274 Data entries
8275 </value>
8276 </member>
8277 <member name="T:QuickGraph.Serialization.XmlGraphSerializer">
8278 <summary>
8279 A wrapper for serializings graphs
8280 </summary>
8281 <remarks>
8282 <para>
8283 This class lets you serialize to xml your graphs, even if you are using
8284 custom vertex and edges.
8285 </para>
8286 <para>
8287 </para>
8288 </remarks>
8289 <example>
8290 In this example, a AdjacencyGraph is created with
8291 custom providers. It is serialized and deserialized to xml:
8292 <code>
8293 AdjacencyGraph g = new AdjacencyGraph(
8294 new NamedVertexProvider(),
8295 new NamedEdgeProvider(),
8296 true
8297 );
8298
8299 NamedEdge u = (NamedVertex)Graph.AddVertex(); u.Name = "u";
8300 NamedEdge v = (NamedVertex)Graph.AddVertex(); v.Name = "v";
8301 NamedEdge w = (NamedVertex)Graph.AddVertex(); w.Name = "w";
8302
8303 NamedEdge uv = (NamedEdge)Graph.AddEdge(u,v); uv.Name = "uv";
8304 NamedEdge uw = (NamedEdge)Graph.AddEdge(u,w); uw.Name = "uw";
8305
8306 StringWriter sw = new StringWriter();
8307 XmlTextWriter writer = new XmlTextWriter(sw);
8308 writer.Formatting = Formatting.Indented;
8309
8310 GraphSerializer ser = new GraphSerializer(Graph);
8311 ser.WriteXml(writer);
8312
8313 Console.WriteLine(sw.ToString());
8314
8315 StringReader sr = new StringReader(sw.ToString());
8316 XmlTextReader reader = new XmlTextReader(sr);
8317 ser.ReadXml(reader);
8318
8319 sw = new StringWriter();
8320 writer = new XmlTextWriter(sw);
8321 writer.Formatting = Formatting.Indented;
8322 ser.WriteXml(writer);
8323 Console.WriteLine(sw.ToString());
8324 </code>
8325 </example>
8326 </member>
8327 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.#ctor">
8328 <summary>
8329 Empty constructor
8330 </summary>
8331 </member>
8332 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.#ctor(QuickGraph.Concepts.Serialization.ISerializableVertexAndEdgeListGraph)">
8333 <summary>
8334 Constructs a serializer around g
8335 </summary>
8336 <param name="g">graph to serialize</param>
8337 <exception cref="T:System.ArgumentNullException">g is null</exception>
8338 </member>
8339 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.Serialize(System.Xml.XmlWriter)">
8340 <summary>
8341 Serializes graph to xml. <see cref="M:QuickGraph.Serialization.XmlGraphSerializer.WriteXml(System.Xml.XmlWriter)"/>
8342 </summary>
8343 <param name="writer"></param>
8344 </member>
8345 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.WriteXml(System.Xml.XmlWriter)">
8346 <summary>
8347 Serializes the graph to xml
8348 </summary>
8349 <param name="writer">opened xml writer</param>
8350 <remarks>
8351 <para>
8352 The edge and vertex class must be serializable.
8353 </para>
8354 </remarks>
8355 </member>
8356 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.ReadXml(System.Xml.XmlReader)">
8357 <summary>
8358 Reads graph data from Xml and create the graph object.
8359 </summary>
8360 <remarks>
8361 <para>
8362 Deserializes a graph from Xml.
8363 </para>
8364 </remarks>
8365 <param name="reader">opened xml reader</param>
8366 <returns>deserialized graph</returns>
8367 </member>
8368 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.GetTypeQualifiedName(System.Type)">
8369 <summary>
8370
8371 </summary>
8372 <param name="t"></param>
8373 <returns></returns>
8374 </member>
8375 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.MoveToAttribute(System.Xml.XmlReader,System.String)">
8376 <summary>
8377
8378 </summary>
8379 <param name="reader"></param>
8380 <param name="name"></param>
8381 </member>
8382 <member name="M:QuickGraph.Serialization.XmlGraphSerializer.ReadGraphXml(System.Xml.XmlReader)">
8383 <summary>
8384
8385 </summary>
8386 <param name="reader"></param>
8387 </member>
8388 <member name="P:QuickGraph.Serialization.XmlGraphSerializer.Graph">
8389 <summary>
8390 Serialized graph
8391 </summary>
8392 </member>
8393 </members>
8394</doc>