DMGA: A Distributed Shortest Path Algorithm for Multistage Graph

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg1"><tr><td> </td><td><b>Require</b>: A large-scale multistage graph <svg height="11.5564pt" id="M46" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 71.5892 11.5564" width="71.5892pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M673 297H417L411 270C517 261 522 258 506 183L487 92C476 38 428 19 360 19C207 19 123 132 123 287C123 472 243 631 441 631C557 631 617 583 617 469L647 472C650 545 655 604 658 632C625 643 554 666 467 666C201 666 23 502 23 278C23 90 156 -16 339 -16C410 -16 501 6 569 24C566 43 567 70 573 101L589 183C604 259 607 262 667 271L673 297Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.524,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,23.787,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,28.285,0)"><path d="M697 650H468L461 623L492 619C539 613 547 605 518 546C481 471 367 264 278 116H276C239 278 197 500 186 567C180 604 185 613 226 619L252 623L260 650H24L17 623C78 617 92 613 108 533L216 -11H247C365 200 515 462 560 529C616 612 624 615 689 623L697 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,35.813,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z"></path></g><g transform="matrix(.013,0,0,-0.013,40.956,0)"><path d="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,48.964,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z"></path></g><g transform="matrix(.013,0,0,-0.013,54.107,0)"><path d="M962 650H739L732 622L760 619C812 613 819 604 798 552C760 457 671 267 606 131H604L511 638H480L237 131H233L183 554C177 607 183 614 226 619L248 622L257 650H24L17 622C88 615 92 611 103 524L173 -11H203L450 491H453L543 -11H575L839 529C882 609 886 613 953 622L962 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,66.776,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"></path></g></svg></td></tr><tr><td colspan="2"> Ensure: The shortest path from v1,1 to vm,1</td></tr><tr><td>(1)</td><td>Partition G</td></tr><tr><td>(2)</td><td>Get the local shortest path of each partition</td></tr><tr><td>(3)</td><td>Get the global shortest path of the whole graph</td></tr></table></td></tr></table>

Scientific Programming

alg1

Algorithm 1

Algorithm 1: DMGA: A Distributed Shortest Path Algorithm for Multistage Graph 