Johnson's algorithm
From Wiktionary, the free dictionary
Jump to navigation
Jump to search
English
[
edit
]
English
Wikipedia
has an article on:
Johnson's algorithm
Wikipedia
Etymology
[
edit
]
Published in 1977 by Donald B. Johnson.
Proper noun
[
edit
]
Johnson
's
algorithm
(
graph theory
)
An algorithm for finding the shortest
paths
between all
pairs
of
vertices
in an edge-weighted
directed graph
.
Categories
:
English lemmas
English proper nouns
English uncountable nouns
English multiword terms
en:Graph theory
English eponyms
Hidden categories:
Pages with entries
Pages with 1 entry
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Entry
Discussion
English
Views
Read
Edit
History
More
Search
Navigation
Main Page
Community portal
Requested entries
Recent changes
Random entry
Help
Glossary
Donations
Contact us
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Print/export
Create a book
Download as PDF
Printable version
In other projects
In other languages