{
  "txid": "58083f6549b080ce1d3f55dedf7d0e614b177ad88564e1c66642e5c06449b53c",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "- **Greedy Approach:** The algorithm always selects the node with the smallest known distance from the starting node.\n- **Non-negative Weights:** It requires that all edge weights be non-negative; negative weights can lead to incorrect results.\n- **Single-Source Shortest Path:** Primarily used to compute the shortest paths from one node to all other nodes in the graph.",
  "media_type": "text/markdown",
  "filename": "|",
  "author": "14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGK",
  "display_name": "ruthheasman",
  "channel": null,
  "parent_txid": "0f3b6ccd2e1ee0f4acf1efc30f565f7da95f9ceaa3b8188faa745ad287efed5f",
  "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"
}