Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: ALL PAIRS SHORTEST PATH |
| Specialty definitions using "ALL PAIRS SHORTEST PATH": Floyd-Warshall algorithm ♦ Johnson's algorithm. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)41 4C 4C 50 41 49 52 53 53 48 4F 52 54 45 53 54 50 41 54 48 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000001 01001100 01001100 00100000 01010000 01000001 01001001 01010010 01010011 00100000 01010011 01001000 01001111 01010010 01010100 01000101 01010011 01010100 00100000 01010000 01000001 01010100 01001000 |
HTML Code (1990) (references)A L L   P A I R S   S H O R T E S T   P A T H |
ISO 10646 (1991-1993) (references)0041 004C 004C 0050 0041 0049 0052 0053 0053 0048 004F 0052 0054 0045 0053 0054 0050 0041 0054 0048 |
Encryption (beginner's substitution cypher): (references)3546462503543525325342495254395354250355442 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
