{
  "txid": "49e73898bf5d12096ed1fe3adada88baeb5ad189b880d1e01cc33239dfeb46c3",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "post",
  "map_content": "Dijkstra's Shortest Path Algorithm\n\n\u2022 Dijkstra's algorithm, developed by Edsger Dijkstra in 1959, identifies the shortest path from a starting node to a target node in a weighted graph, creating a tree of shortest paths.  \n\u2022 The algorithm is applicable to both directed and undirected graphs, as long as all edge weights are nonnegative.  \n\u2022 In real-world applications, such as navigating congested roads, Dijkstra's algorithm focuses on lower-weight paths to determine the shortest route.  \n\u2022 Key components of the algorithm include an array of distances from the source node, a queue of all nodes, and a set of visited nodes.  \n\u2022 The algorithm works by selecting the unvisited node with the smallest distance, updating the distances of its adjacent nodes, and marking it as visited until all nodes are processed.  \n\u2022 The output of Dijkstra's algorithm is a shortest path tree, which shows the minimum distances from the source to all other nodes in the graph.  \n\u2022 Pseudocode for Dijkstra's algorithm is available for implementation in various programming languages, resembling Python syntax.  \n\u2022 The algorithm can be illustrated through examples, where distances are calculated step-by-step to arrive at the final shortest-path tree.  \n\u2022 In practical scenarios, such as navigating an ice rink, the algorithm can determine the least number of moves needed to reach a specific position while avoiding obstacles.  \n\u2022 The effectiveness of the algorithm can be evaluated across multiple scenarios, including calculating the sum of shortest paths in various ice rinks of defined dimensions.",
  "media_type": "text/markdown",
  "filename": "|",
  "author": "14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGK",
  "display_name": "ruthheasman",
  "channel": null,
  "parent_txid": null,
  "ref_txid": null,
  "tags": null,
  "reply_count": 0,
  "like_count": 0,
  "timestamp": "2024-10-28T01:23:35.000Z",
  "media_url": null,
  "aip_verified": true,
  "has_access": true,
  "attachments": [],
  "ui_name": "ruthheasman",
  "ui_display_name": "ruthheasman",
  "ui_handle": "ruthheasman",
  "ui_display_raw": "ruthheasman",
  "ui_signer": "14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGK",
  "ref_ui_name": "unknown",
  "ref_ui_signer": "unknown"
}