1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
|
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>networkx.utils.mapped_queue — NetworkX 3.1rc1.dev0 documentation</title>
<script data-cfasync="false">
document.documentElement.dataset.mode = localStorage.getItem("mode") || "light";
document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
</script>
<!-- Loaded before other Sphinx assets -->
<link href="../../../_static/styles/theme.css?digest=796348d33e8b1d947c94" rel="stylesheet">
<link href="../../../_static/styles/bootstrap.css?digest=796348d33e8b1d947c94" rel="stylesheet">
<link href="../../../_static/styles/pydata-sphinx-theme.css?digest=796348d33e8b1d947c94" rel="stylesheet">
<link href="../../../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=796348d33e8b1d947c94" rel="stylesheet">
<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2">
<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2">
<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2">
<link rel="stylesheet" type="text/css" href="../../../_static/pygments.css" />
<link rel="stylesheet" type="text/css" href="../../../_static/custom.css" />
<link rel="stylesheet" type="text/css" href="../../../_static/sg_gallery.css" />
<link rel="stylesheet" type="text/css" href="../../../_static/sg_gallery-binder.css" />
<link rel="stylesheet" type="text/css" href="../../../_static/sg_gallery-dataframe.css" />
<link rel="stylesheet" type="text/css" href="../../../_static/sg_gallery-rendered-html.css" />
<!-- Pre-loaded scripts that we'll load fully later -->
<link rel="preload" as="script" href="../../../_static/scripts/bootstrap.js?digest=796348d33e8b1d947c94">
<link rel="preload" as="script" href="../../../_static/scripts/pydata-sphinx-theme.js?digest=796348d33e8b1d947c94">
<script data-url_root="../../../" id="documentation_options" src="../../../_static/documentation_options.js"></script>
<script src="../../../_static/jquery.js"></script>
<script src="../../../_static/underscore.js"></script>
<script src="../../../_static/_sphinx_javascript_frameworks_compat.js"></script>
<script src="../../../_static/doctools.js"></script>
<script src="../../../_static/sphinx_highlight.js"></script>
<script src="../../../_static/copybutton.js"></script>
<script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/utils/mapped_queue';</script>
<link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/utils/mapped_queue.html" />
<link rel="search" type="application/opensearchdescription+xml"
title="Search within NetworkX 3.1rc1.dev0 documentation"
href="../../../_static/opensearch.xml"/>
<link rel="index" title="Index" href="../../../genindex.html" />
<link rel="search" title="Search" href="../../../search.html" />
<script
defer
data-domain="networkx.org"
src="https://views.scientific-python.org/js/script.js"
></script>
<meta name="viewport" content="width=device-width, initial-scale=1" />
<meta name="docsearch:language" content="en">
</head>
<body data-spy="scroll" data-target="#bd-toc-nav" data-offset="180" data-default-mode="light">
<a class="skip-link" href="#main-content">Skip to main content</a>
<div class="container-fluid version-alert devbar">
<div class="row no-gutters">
<div class="col-12 text-center">
This page is documentation for a DEVELOPMENT / PRE-RELEASE version.
<a
class="btn version-stable font-weight-bold ml-3 my-3 align-baseline"
href="https://networkx.org/documentation/stable/"
>Switch to stable version</a
>
</div>
</div>
</div>
<input type="checkbox" class="sidebar-toggle" name="__primary" id="__primary">
<label class="overlay overlay-primary" for="__primary"></label>
<input type="checkbox" class="sidebar-toggle" name="__secondary" id="__secondary">
<label class="overlay overlay-secondary" for="__secondary"></label>
<div class="search-button__wrapper">
<div class="search-button__overlay"></div>
<div class="search-button__search-container">
<form class="bd-search d-flex align-items-center" action="../../../search.html" method="get">
<i class="fa-solid fa-magnifying-glass"></i>
<input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false">
<span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
</form>
</div>
</div><div class="bd-header-announcement container-fluid" id="header-announcement">
<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div>
</div>
<nav class="bd-header navbar navbar-expand-lg bd-navbar" id="navbar-main"><div class="bd-header__inner bd-page-width">
<label class="sidebar-toggle primary-toggle" for="__primary">
<span class="fa-solid fa-bars"></span>
</label>
<div id="navbar-start">
<a class="navbar-brand logo" href="../../../index.html">
<img src="../../../_static/networkx_banner.svg" class="logo__image only-light" alt="Logo image">
<img src="../../../_static/networkx_banner.svg" class="logo__image only-dark" alt="Logo image">
</a>
</div>
<div class="col-lg-9 navbar-header-items">
<div id="navbar-center" class="mr-auto">
<div class="navbar-center-item">
<nav class="navbar-nav">
<p class="sidebar-header-items__title" role="heading" aria-level="1" aria-label="Site Navigation">
Site Navigation
</p>
<ul id="navbar-main-elements" class="navbar-nav">
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../install.html">
Install
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../tutorial.html">
Tutorial
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../reference/index.html">
Reference
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../auto_examples/index.html">
Gallery
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../developer/index.html">
Developer
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../release/index.html">
Releases
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-external" href="https://networkx.org/nx-guides/">
Guides
</a>
</li>
</ul>
</nav>
</div>
</div>
<div id="navbar-end">
<div class="navbar-end-item navbar-persistent--container">
<button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-toggle="tooltip">
<i class="fa-solid fa-magnifying-glass"></i>
</button>
</div>
<div class="navbar-end-item">
<button class="theme-switch-button btn btn-sm btn-outline-primary navbar-btn rounded-circle" title="light/dark" aria-label="light/dark" data-toggle="tooltip">
<span class="theme-switch" data-mode="light"><i class="fa-solid fa-sun"></i></span>
<span class="theme-switch" data-mode="dark"><i class="fa-solid fa-moon"></i></span>
<span class="theme-switch" data-mode="auto"><i class="fa-solid fa-circle-half-stroke"></i></span>
</button>
</div>
<div class="navbar-end-item">
<ul id="navbar-icon-links" class="navbar-nav" aria-label="Icon Links">
<li class="nav-item">
<a href="https://networkx.org" title="Home Page" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fas fa-home"></i></span>
<label class="sr-only">Home Page</label></a>
</li>
<li class="nav-item">
<a href="https://github.com/networkx/networkx" title="GitHub" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fab fa-github-square"></i></span>
<label class="sr-only">GitHub</label></a>
</li>
</ul>
</div>
<div class="navbar-end-item">
<ul class="navbar-nav">
<li class="mr-2 dropdown">
<button
type="button"
class="btn btn-version btn-sm navbar-btn dropdown-toggle"
id="dLabelMore"
data-toggle="dropdown"
>
v3.1rc1.dev0
<span class="caret"></span>
</button>
<ul class="dropdown-menu" aria-labelledby="dLabelMore">
<li>
<a href="https://networkx.org/documentation/latest/index.html"
>devel (latest)</a
>
</li>
<li>
<a href="https://networkx.org/documentation/stable/index.html"
>current (stable)</a
>
</li>
</ul>
</li>
</ul>
</div>
</div>
</div>
<div class="navbar-persistent--mobile">
<button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-toggle="tooltip">
<i class="fa-solid fa-magnifying-glass"></i>
</button>
</div>
<label class="sidebar-toggle secondary-toggle" for="__secondary">
<span class="fa-solid fa-outdent"></span>
</label>
</div>
</nav>
<div class="bd-container">
<div class="bd-container__inner bd-page-width">
<div class="bd-sidebar-primary bd-sidebar">
<div class="sidebar-header-items sidebar-primary__section">
<div class="sidebar-header-items__center">
<div class="navbar-center-item">
<nav class="navbar-nav">
<p class="sidebar-header-items__title" role="heading" aria-level="1" aria-label="Site Navigation">
Site Navigation
</p>
<ul id="navbar-main-elements" class="navbar-nav">
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../install.html">
Install
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../tutorial.html">
Tutorial
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../reference/index.html">
Reference
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../auto_examples/index.html">
Gallery
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../developer/index.html">
Developer
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-internal" href="../../../release/index.html">
Releases
</a>
</li>
<li class="nav-item">
<a class="nav-link nav-external" href="https://networkx.org/nx-guides/">
Guides
</a>
</li>
</ul>
</nav>
</div>
</div>
<div class="sidebar-header-items__end">
<div class="navbar-end-item">
<button class="theme-switch-button btn btn-sm btn-outline-primary navbar-btn rounded-circle" title="light/dark" aria-label="light/dark" data-toggle="tooltip">
<span class="theme-switch" data-mode="light"><i class="fa-solid fa-sun"></i></span>
<span class="theme-switch" data-mode="dark"><i class="fa-solid fa-moon"></i></span>
<span class="theme-switch" data-mode="auto"><i class="fa-solid fa-circle-half-stroke"></i></span>
</button>
</div>
<div class="navbar-end-item">
<ul id="navbar-icon-links" class="navbar-nav" aria-label="Icon Links">
<li class="nav-item">
<a href="https://networkx.org" title="Home Page" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fas fa-home"></i></span>
<label class="sr-only">Home Page</label></a>
</li>
<li class="nav-item">
<a href="https://github.com/networkx/networkx" title="GitHub" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fab fa-github-square"></i></span>
<label class="sr-only">GitHub</label></a>
</li>
</ul>
</div>
<div class="navbar-end-item">
<ul class="navbar-nav">
<li class="mr-2 dropdown">
<button
type="button"
class="btn btn-version btn-sm navbar-btn dropdown-toggle"
id="dLabelMore"
data-toggle="dropdown"
>
v3.1rc1.dev0
<span class="caret"></span>
</button>
<ul class="dropdown-menu" aria-labelledby="dLabelMore">
<li>
<a href="https://networkx.org/documentation/latest/index.html"
>devel (latest)</a
>
</li>
<li>
<a href="https://networkx.org/documentation/stable/index.html"
>current (stable)</a
>
</li>
</ul>
</li>
</ul>
</div>
</div>
</div>
<div class="sidebar-start-items sidebar-primary__section">
<div class="sidebar-start-items__item">
</div>
</div>
<div class="sidebar-end-items sidebar-primary__section">
<div class="sidebar-end-items__item">
</div>
</div>
<div id="rtd-footer-container"></div>
</div>
<main id="main-content" class="bd-main">
<div class="bd-content">
<div class="bd-article-container">
<div class="bd-header-article">
</div>
<article class="bd-article" role="main">
<h1>Source code for networkx.utils.mapped_queue</h1><div class="highlight"><pre>
<span></span><span class="sd">"""Priority queue class with updatable priorities.</span>
<span class="sd">"""</span>
<span class="kn">import</span> <span class="nn">heapq</span>
<span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s2">"MappedQueue"</span><span class="p">]</span>
<span class="k">class</span> <span class="nc">_HeapElement</span><span class="p">:</span>
<span class="w"> </span><span class="sd">"""This proxy class separates the heap element from its priority.</span>
<span class="sd"> The idea is that using a 2-tuple (priority, element) works</span>
<span class="sd"> for sorting, but not for dict lookup because priorities are</span>
<span class="sd"> often floating point values so round-off can mess up equality.</span>
<span class="sd"> So, we need inequalities to look at the priority (for sorting)</span>
<span class="sd"> and equality (and hash) to look at the element to enable</span>
<span class="sd"> updates to the priority.</span>
<span class="sd"> Unfortunately, this class can be tricky to work with if you forget that</span>
<span class="sd"> `__lt__` compares the priority while `__eq__` compares the element.</span>
<span class="sd"> In `greedy_modularity_communities()` the following code is</span>
<span class="sd"> used to check that two _HeapElements differ in either element or priority:</span>
<span class="sd"> if d_oldmax != row_max or d_oldmax.priority != row_max.priority:</span>
<span class="sd"> If the priorities are the same, this implementation uses the element</span>
<span class="sd"> as a tiebreaker. This provides compatibility with older systems that</span>
<span class="sd"> use tuples to combine priority and elements.</span>
<span class="sd"> """</span>
<span class="vm">__slots__</span> <span class="o">=</span> <span class="p">[</span><span class="s2">"priority"</span><span class="p">,</span> <span class="s2">"element"</span><span class="p">,</span> <span class="s2">"_hash"</span><span class="p">]</span>
<span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">priority</span><span class="p">,</span> <span class="n">element</span><span class="p">):</span>
<span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o">=</span> <span class="n">priority</span>
<span class="bp">self</span><span class="o">.</span><span class="n">element</span> <span class="o">=</span> <span class="n">element</span>
<span class="bp">self</span><span class="o">.</span><span class="n">_hash</span> <span class="o">=</span> <span class="nb">hash</span><span class="p">(</span><span class="n">element</span><span class="p">)</span>
<span class="k">def</span> <span class="fm">__lt__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">other</span><span class="p">):</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">other_priority</span> <span class="o">=</span> <span class="n">other</span><span class="o">.</span><span class="n">priority</span>
<span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o"><</span> <span class="n">other</span>
<span class="c1"># assume comparing to another _HeapElement</span>
<span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o">==</span> <span class="n">other_priority</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span> <span class="o"><</span> <span class="n">other</span><span class="o">.</span><span class="n">element</span>
<span class="k">except</span> <span class="ne">TypeError</span> <span class="k">as</span> <span class="n">err</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span>
<span class="s2">"Consider using a tuple, with a priority value that can be compared."</span>
<span class="p">)</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o"><</span> <span class="n">other_priority</span>
<span class="k">def</span> <span class="fm">__gt__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">other</span><span class="p">):</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">other_priority</span> <span class="o">=</span> <span class="n">other</span><span class="o">.</span><span class="n">priority</span>
<span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o">></span> <span class="n">other</span>
<span class="c1"># assume comparing to another _HeapElement</span>
<span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o">==</span> <span class="n">other_priority</span><span class="p">:</span>
<span class="k">try</span><span class="p">:</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span> <span class="o">></span> <span class="n">other</span><span class="o">.</span><span class="n">element</span>
<span class="k">except</span> <span class="ne">TypeError</span> <span class="k">as</span> <span class="n">err</span><span class="p">:</span>
<span class="k">raise</span> <span class="ne">TypeError</span><span class="p">(</span>
<span class="s2">"Consider using a tuple, with a priority value that can be compared."</span>
<span class="p">)</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="o">></span> <span class="n">other_priority</span>
<span class="k">def</span> <span class="fm">__eq__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">other</span><span class="p">):</span>
<span class="k">try</span><span class="p">:</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span> <span class="o">==</span> <span class="n">other</span><span class="o">.</span><span class="n">element</span>
<span class="k">except</span> <span class="ne">AttributeError</span><span class="p">:</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span> <span class="o">==</span> <span class="n">other</span>
<span class="k">def</span> <span class="fm">__hash__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">_hash</span>
<span class="k">def</span> <span class="fm">__getitem__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">indx</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span> <span class="k">if</span> <span class="n">indx</span> <span class="o">==</span> <span class="mi">0</span> <span class="k">else</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span><span class="p">[</span><span class="n">indx</span> <span class="o">-</span> <span class="mi">1</span><span class="p">]</span>
<span class="k">def</span> <span class="fm">__iter__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="k">yield</span> <span class="bp">self</span><span class="o">.</span><span class="n">priority</span>
<span class="k">try</span><span class="p">:</span>
<span class="k">yield from</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span>
<span class="k">except</span> <span class="ne">TypeError</span><span class="p">:</span>
<span class="k">yield</span> <span class="bp">self</span><span class="o">.</span><span class="n">element</span>
<span class="k">def</span> <span class="fm">__repr__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="k">return</span> <span class="sa">f</span><span class="s2">"_HeapElement(</span><span class="si">{</span><span class="bp">self</span><span class="o">.</span><span class="n">priority</span><span class="si">}</span><span class="s2">, </span><span class="si">{</span><span class="bp">self</span><span class="o">.</span><span class="n">element</span><span class="si">}</span><span class="s2">)"</span>
<div class="viewcode-block" id="MappedQueue"><a class="viewcode-back" href="../../../reference/generated/networkx.utils.mapped_queue.MappedQueue.html#networkx.utils.mapped_queue.MappedQueue">[docs]</a><span class="k">class</span> <span class="nc">MappedQueue</span><span class="p">:</span>
<span class="w"> </span><span class="sd">"""The MappedQueue class implements a min-heap with removal and update-priority.</span>
<span class="sd"> The min heap uses heapq as well as custom written _siftup and _siftdown</span>
<span class="sd"> methods to allow the heap positions to be tracked by an additional dict</span>
<span class="sd"> keyed by element to position. The smallest element can be popped in O(1) time,</span>
<span class="sd"> new elements can be pushed in O(log n) time, and any element can be removed</span>
<span class="sd"> or updated in O(log n) time. The queue cannot contain duplicate elements</span>
<span class="sd"> and an attempt to push an element already in the queue will have no effect.</span>
<span class="sd"> MappedQueue complements the heapq package from the python standard</span>
<span class="sd"> library. While MappedQueue is designed for maximum compatibility with</span>
<span class="sd"> heapq, it adds element removal, lookup, and priority update.</span>
<span class="sd"> Parameters</span>
<span class="sd"> ----------</span>
<span class="sd"> data : dict or iterable</span>
<span class="sd"> Examples</span>
<span class="sd"> --------</span>
<span class="sd"> A `MappedQueue` can be created empty, or optionally, given a dictionary</span>
<span class="sd"> of initial elements and priorities. The methods `push`, `pop`,</span>
<span class="sd"> `remove`, and `update` operate on the queue.</span>
<span class="sd"> >>> colors_nm = {'red':665, 'blue': 470, 'green': 550}</span>
<span class="sd"> >>> q = MappedQueue(colors_nm)</span>
<span class="sd"> >>> q.remove('red')</span>
<span class="sd"> >>> q.update('green', 'violet', 400)</span>
<span class="sd"> >>> q.push('indigo', 425)</span>
<span class="sd"> True</span>
<span class="sd"> >>> [q.pop().element for i in range(len(q.heap))]</span>
<span class="sd"> ['violet', 'indigo', 'blue']</span>
<span class="sd"> A `MappedQueue` can also be initialized with a list or other iterable. The priority is assumed</span>
<span class="sd"> to be the sort order of the items in the list.</span>
<span class="sd"> >>> q = MappedQueue([916, 50, 4609, 493, 237])</span>
<span class="sd"> >>> q.remove(493)</span>
<span class="sd"> >>> q.update(237, 1117)</span>
<span class="sd"> >>> [q.pop() for i in range(len(q.heap))]</span>
<span class="sd"> [50, 916, 1117, 4609]</span>
<span class="sd"> An exception is raised if the elements are not comparable.</span>
<span class="sd"> >>> q = MappedQueue([100, 'a'])</span>
<span class="sd"> Traceback (most recent call last):</span>
<span class="sd"> ...</span>
<span class="sd"> TypeError: '<' not supported between instances of 'int' and 'str'</span>
<span class="sd"> To avoid the exception, use a dictionary to assign priorities to the elements.</span>
<span class="sd"> >>> q = MappedQueue({100: 0, 'a': 1 })</span>
<span class="sd"> References</span>
<span class="sd"> ----------</span>
<span class="sd"> .. [1] Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001).</span>
<span class="sd"> Introduction to algorithms second edition.</span>
<span class="sd"> .. [2] Knuth, D. E. (1997). The art of computer programming (Vol. 3).</span>
<span class="sd"> Pearson Education.</span>
<span class="sd"> """</span>
<div class="viewcode-block" id="MappedQueue.__init__"><a class="viewcode-back" href="../../../reference/generated/networkx.utils.mapped_queue.MappedQueue.html#networkx.utils.mapped_queue.MappedQueue.__init__">[docs]</a> <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">data</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Priority queue class with updatable priorities."""</span>
<span class="k">if</span> <span class="n">data</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span> <span class="o">=</span> <span class="p">[]</span>
<span class="k">elif</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">data</span><span class="p">,</span> <span class="nb">dict</span><span class="p">):</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span> <span class="o">=</span> <span class="p">[</span><span class="n">_HeapElement</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="n">k</span><span class="p">)</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">data</span><span class="o">.</span><span class="n">items</span><span class="p">()]</span>
<span class="k">else</span><span class="p">:</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">data</span><span class="p">)</span>
<span class="bp">self</span><span class="o">.</span><span class="n">position</span> <span class="o">=</span> <span class="p">{}</span>
<span class="bp">self</span><span class="o">.</span><span class="n">_heapify</span><span class="p">()</span></div>
<span class="k">def</span> <span class="nf">_heapify</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Restore heap invariant and recalculate map."""</span>
<span class="n">heapq</span><span class="o">.</span><span class="n">heapify</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)</span>
<span class="bp">self</span><span class="o">.</span><span class="n">position</span> <span class="o">=</span> <span class="p">{</span><span class="n">elt</span><span class="p">:</span> <span class="n">pos</span> <span class="k">for</span> <span class="n">pos</span><span class="p">,</span> <span class="n">elt</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)}</span>
<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">):</span>
<span class="k">raise</span> <span class="ne">AssertionError</span><span class="p">(</span><span class="s2">"Heap contains duplicate elements"</span><span class="p">)</span>
<span class="k">def</span> <span class="fm">__len__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)</span>
<div class="viewcode-block" id="MappedQueue.push"><a class="viewcode-back" href="../../../reference/generated/generated/networkx.utils.mapped_queue.MappedQueue.push.html#networkx.utils.mapped_queue.MappedQueue.push">[docs]</a> <span class="k">def</span> <span class="nf">push</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">elt</span><span class="p">,</span> <span class="n">priority</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Add an element to the queue."""</span>
<span class="k">if</span> <span class="n">priority</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
<span class="n">elt</span> <span class="o">=</span> <span class="n">_HeapElement</span><span class="p">(</span><span class="n">priority</span><span class="p">,</span> <span class="n">elt</span><span class="p">)</span>
<span class="c1"># If element is already in queue, do nothing</span>
<span class="k">if</span> <span class="n">elt</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">:</span>
<span class="k">return</span> <span class="kc">False</span>
<span class="c1"># Add element to heap and dict</span>
<span class="n">pos</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">elt</span><span class="p">)</span>
<span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">elt</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="c1"># Restore invariant by sifting down</span>
<span class="bp">self</span><span class="o">.</span><span class="n">_siftdown</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">pos</span><span class="p">)</span>
<span class="k">return</span> <span class="kc">True</span></div>
<div class="viewcode-block" id="MappedQueue.pop"><a class="viewcode-back" href="../../../reference/generated/generated/networkx.utils.mapped_queue.MappedQueue.pop.html#networkx.utils.mapped_queue.MappedQueue.pop">[docs]</a> <span class="k">def</span> <span class="nf">pop</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Remove and return the smallest element in the queue."""</span>
<span class="c1"># Remove smallest element</span>
<span class="n">elt</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span>
<span class="k">del</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">elt</span><span class="p">]</span>
<span class="c1"># If elt is last item, remove and return</span>
<span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>
<span class="k">return</span> <span class="n">elt</span>
<span class="c1"># Replace root with last element</span>
<span class="n">last</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="n">last</span>
<span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">last</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
<span class="c1"># Restore invariant by sifting up</span>
<span class="bp">self</span><span class="o">.</span><span class="n">_siftup</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
<span class="c1"># Return smallest element</span>
<span class="k">return</span> <span class="n">elt</span></div>
<div class="viewcode-block" id="MappedQueue.update"><a class="viewcode-back" href="../../../reference/generated/generated/networkx.utils.mapped_queue.MappedQueue.update.html#networkx.utils.mapped_queue.MappedQueue.update">[docs]</a> <span class="k">def</span> <span class="nf">update</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">elt</span><span class="p">,</span> <span class="n">new</span><span class="p">,</span> <span class="n">priority</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Replace an element in the queue with a new one."""</span>
<span class="k">if</span> <span class="n">priority</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span>
<span class="n">new</span> <span class="o">=</span> <span class="n">_HeapElement</span><span class="p">(</span><span class="n">priority</span><span class="p">,</span> <span class="n">new</span><span class="p">)</span>
<span class="c1"># Replace</span>
<span class="n">pos</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">elt</span><span class="p">]</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">new</span>
<span class="k">del</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">elt</span><span class="p">]</span>
<span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">new</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="c1"># Restore invariant by sifting up</span>
<span class="bp">self</span><span class="o">.</span><span class="n">_siftup</span><span class="p">(</span><span class="n">pos</span><span class="p">)</span></div>
<div class="viewcode-block" id="MappedQueue.remove"><a class="viewcode-back" href="../../../reference/generated/generated/networkx.utils.mapped_queue.MappedQueue.remove.html#networkx.utils.mapped_queue.MappedQueue.remove">[docs]</a> <span class="k">def</span> <span class="nf">remove</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">elt</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Remove an element from the queue."""</span>
<span class="c1"># Find and remove element</span>
<span class="k">try</span><span class="p">:</span>
<span class="n">pos</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">elt</span><span class="p">]</span>
<span class="k">del</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">elt</span><span class="p">]</span>
<span class="k">except</span> <span class="ne">KeyError</span><span class="p">:</span>
<span class="c1"># Not in queue</span>
<span class="k">raise</span>
<span class="c1"># If elt is last item, remove and return</span>
<span class="k">if</span> <span class="n">pos</span> <span class="o">==</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">)</span> <span class="o">-</span> <span class="mi">1</span><span class="p">:</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>
<span class="k">return</span>
<span class="c1"># Replace elt with last element</span>
<span class="n">last</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span>
<span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">last</span>
<span class="bp">self</span><span class="o">.</span><span class="n">position</span><span class="p">[</span><span class="n">last</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="c1"># Restore invariant by sifting up</span>
<span class="bp">self</span><span class="o">.</span><span class="n">_siftup</span><span class="p">(</span><span class="n">pos</span><span class="p">)</span></div>
<span class="k">def</span> <span class="nf">_siftup</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">pos</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Move smaller child up until hitting a leaf.</span>
<span class="sd"> Built to mimic code for heapq._siftup</span>
<span class="sd"> only updating position dict too.</span>
<span class="sd"> """</span>
<span class="n">heap</span><span class="p">,</span> <span class="n">position</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">,</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span>
<span class="n">end_pos</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">heap</span><span class="p">)</span>
<span class="n">startpos</span> <span class="o">=</span> <span class="n">pos</span>
<span class="n">newitem</span> <span class="o">=</span> <span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span>
<span class="c1"># Shift up the smaller child until hitting a leaf</span>
<span class="n">child_pos</span> <span class="o">=</span> <span class="p">(</span><span class="n">pos</span> <span class="o"><<</span> <span class="mi">1</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span> <span class="c1"># start with leftmost child position</span>
<span class="k">while</span> <span class="n">child_pos</span> <span class="o"><</span> <span class="n">end_pos</span><span class="p">:</span>
<span class="c1"># Set child_pos to index of smaller child.</span>
<span class="n">child</span> <span class="o">=</span> <span class="n">heap</span><span class="p">[</span><span class="n">child_pos</span><span class="p">]</span>
<span class="n">right_pos</span> <span class="o">=</span> <span class="n">child_pos</span> <span class="o">+</span> <span class="mi">1</span>
<span class="k">if</span> <span class="n">right_pos</span> <span class="o"><</span> <span class="n">end_pos</span><span class="p">:</span>
<span class="n">right</span> <span class="o">=</span> <span class="n">heap</span><span class="p">[</span><span class="n">right_pos</span><span class="p">]</span>
<span class="k">if</span> <span class="ow">not</span> <span class="n">child</span> <span class="o"><</span> <span class="n">right</span><span class="p">:</span>
<span class="n">child</span> <span class="o">=</span> <span class="n">right</span>
<span class="n">child_pos</span> <span class="o">=</span> <span class="n">right_pos</span>
<span class="c1"># Move the smaller child up.</span>
<span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">child</span>
<span class="n">position</span><span class="p">[</span><span class="n">child</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="n">pos</span> <span class="o">=</span> <span class="n">child_pos</span>
<span class="n">child_pos</span> <span class="o">=</span> <span class="p">(</span><span class="n">pos</span> <span class="o"><<</span> <span class="mi">1</span><span class="p">)</span> <span class="o">+</span> <span class="mi">1</span>
<span class="c1"># pos is a leaf position. Put newitem there, and bubble it up</span>
<span class="c1"># to its final resting place (by sifting its parents down).</span>
<span class="k">while</span> <span class="n">pos</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span>
<span class="n">parent_pos</span> <span class="o">=</span> <span class="p">(</span><span class="n">pos</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">>></span> <span class="mi">1</span>
<span class="n">parent</span> <span class="o">=</span> <span class="n">heap</span><span class="p">[</span><span class="n">parent_pos</span><span class="p">]</span>
<span class="k">if</span> <span class="ow">not</span> <span class="n">newitem</span> <span class="o"><</span> <span class="n">parent</span><span class="p">:</span>
<span class="k">break</span>
<span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">parent</span>
<span class="n">position</span><span class="p">[</span><span class="n">parent</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="n">pos</span> <span class="o">=</span> <span class="n">parent_pos</span>
<span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">newitem</span>
<span class="n">position</span><span class="p">[</span><span class="n">newitem</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="k">def</span> <span class="nf">_siftdown</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">start_pos</span><span class="p">,</span> <span class="n">pos</span><span class="p">):</span>
<span class="w"> </span><span class="sd">"""Restore invariant. keep swapping with parent until smaller.</span>
<span class="sd"> Built to mimic code for heapq._siftdown</span>
<span class="sd"> only updating position dict too.</span>
<span class="sd"> """</span>
<span class="n">heap</span><span class="p">,</span> <span class="n">position</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">heap</span><span class="p">,</span> <span class="bp">self</span><span class="o">.</span><span class="n">position</span>
<span class="n">newitem</span> <span class="o">=</span> <span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span>
<span class="c1"># Follow the path to the root, moving parents down until finding a place</span>
<span class="c1"># newitem fits.</span>
<span class="k">while</span> <span class="n">pos</span> <span class="o">></span> <span class="n">start_pos</span><span class="p">:</span>
<span class="n">parent_pos</span> <span class="o">=</span> <span class="p">(</span><span class="n">pos</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">>></span> <span class="mi">1</span>
<span class="n">parent</span> <span class="o">=</span> <span class="n">heap</span><span class="p">[</span><span class="n">parent_pos</span><span class="p">]</span>
<span class="k">if</span> <span class="ow">not</span> <span class="n">newitem</span> <span class="o"><</span> <span class="n">parent</span><span class="p">:</span>
<span class="k">break</span>
<span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">parent</span>
<span class="n">position</span><span class="p">[</span><span class="n">parent</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span>
<span class="n">pos</span> <span class="o">=</span> <span class="n">parent_pos</span>
<span class="n">heap</span><span class="p">[</span><span class="n">pos</span><span class="p">]</span> <span class="o">=</span> <span class="n">newitem</span>
<span class="n">position</span><span class="p">[</span><span class="n">newitem</span><span class="p">]</span> <span class="o">=</span> <span class="n">pos</span></div>
</pre></div>
</article>
</div>
<div class="bd-sidebar-secondary bd-toc">
<div class="toc-item">
<form class="bd-search d-flex align-items-center" action="../../../search.html" method="get">
<i class="fa-solid fa-magnifying-glass"></i>
<input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false">
<span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
</form>
</div>
<div class="toc-item">
</div>
</div>
</div>
<footer class="bd-footer-content">
<div class="bd-footer-content__inner">
</div>
</footer>
</main>
</div>
</div>
<!-- Scripts loaded after <body> so the DOM is not blocked -->
<script src="../../../_static/scripts/bootstrap.js?digest=796348d33e8b1d947c94"></script>
<script src="../../../_static/scripts/pydata-sphinx-theme.js?digest=796348d33e8b1d947c94"></script>
<footer class="bd-footer"><div class="bd-footer__inner container">
<div class="footer-item">
<p class="copyright">
© Copyright 2004-2023, NetworkX Developers.<br>
</p>
</div>
<div class="footer-item">
<p class="theme-version">
Built with the
<a href="https://pydata-sphinx-theme.readthedocs.io/en/stable/index.html">
PyData Sphinx Theme
</a>
0.12.0.
</p>
</div>
<div class="footer-item">
<p class="sphinx-version">
Created using <a href="http://sphinx-doc.org/">Sphinx</a> 5.2.3.<br>
</p>
</div>
</div>
</footer>
</body>
</html>
|
