File:Bhandari's Shortest Pair of Edge-Disjoint Shortest Paths Algorithm.jpg
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
Size of this preview: 800 × 450 pixels. Other resolutions: 320 × 180 pixels | 640 × 360 pixels | 1,280 × 720 pixels.
Original file (1,280 × 720 pixels, file size: 85 KB, MIME type: image/jpeg)
File information
Structured data
Captions
Summary
[edit]DescriptionBhandari's Shortest Pair of Edge-Disjoint Shortest Paths Algorithm.jpg |
English: Main steps of the Bhandari's shortest pair of edge-disjoint paths algorithm illustrated sequentially in six figures: A) Given undirected graph G(V, E) with edge weights B) Shortest path ABCZ from A to Z (in bold lines) C) Reversal of arcs of the shortest path and making their weights negative. D) Shortest path ADCBZ (bold lines) in the new transformed graph of figure C (this may be determined using a modified form of Dijklstra algorithm valid for such negative arcs; note there are no negative cycles). E) Shortest path ADCBZ in the original graph F) Shortest pair of edge-disjoint paths (ABZ, ADCZ) found after erasing the edge BC common to paths ABCZ (figure B) and ADCBZ (figure E), and grouping the remaining edges suitably. |
Date | |
Source | Own work |
Author | Scientist11111 |
Licensing
[edit]I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
This media file is uncategorized.
Please help improve this media file by adding it to one or more categories, so it may be associated with related media files (how?), and so that it can be more easily found.
Please notify the uploader with {{subst:Please link images|File:Bhandari's Shortest Pair of Edge-Disjoint Shortest Paths Algorithm.jpg}} ~~~~ |
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 00:57, 22 October 2021 | 1,280 × 720 (85 KB) | Scientist11111 (talk | contribs) | Uploaded own work with UploadWizard |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on en.wikipedia.org