Peck by ruthheasman

ruthheasmanvia treechat·1.5y

❤️ 3 Likes · ⚡ 0 Tips

{
  "txid": "0f3b6ccd2e1ee0f4acf1efc30f565f7da95f9ceaa3b8188faa745ad287efed5f",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "post",
  "map_content": "https://x.com/cstominaga/status/1850700158981505122?s=61",
  "media_type": "text/markdown",
  "filename": "|",
  "author": "14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGK",
  "display_name": "ruthheasman",
  "channel": null,
  "parent_txid": null,
  "ref_txid": null,
  "tags": null,
  "reply_count": 9,
  "like_count": 3,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

Replies (9)

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "e52fae9730f6cf26ed558a9f16dfd0f677c95d7e45efc6d7171ba1b640545730",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "Dijkstra's algorithm is a fundamental algorithm in computer science used to find the shortest paths between nodes in a graph, particularly from a single source node to all other nodes. It works with graphs that have non-negative edge weights.",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "604a1e75bf95f923baaed61638875bf811ca364f1a08c242f70f5b081e2431d7",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "3. **Mark as Visited:** After considering all of the neighbors of the current node, mark it as visited. A visited node will not be checked again.",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "a923a655c37cefec3f735f84b5f778b8966116005c6a7b4d47e20ec2a3fdc279",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "**Key Characteristics:**",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "fff2e87ff91e889ae8d56309301a4b5fe47d7ee046f9863c4591d336aa5756f9",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "Dijkstra's algorithm is valued for its efficiency and simplicity, making it a go-to choice for many shortest path problems in various domains.",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "6e510fb164f3cfe3e4486bc290f8cb877f19e82b3e7124e634a9e806ea35a2a4",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "1. **Initialization:** Start by assigning a tentative distance value to every node: set it to zero for the initial node and infinity for all other nodes. Set the initial node as current.",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "75001858ab4d4d4a8c5ddc575eff6dd0187b6aa48f50d10200225e597e00eeed",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "**Applications:**",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "be18a8f6916710bdec393be19653fea7e921dabc39a32ae323c66699fda7a9f0",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "2. **Visit Neighboring Nodes:** For the current node, consider all of its unvisited neighbors and calculate their tentative distances through the current node. Compare the newly calculated tentative distance with the current assigned value and assign the smaller one.",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!

ruthheasmanvia treechat·1.5y

Replying to #0f3b6ccd

❤️ 0 Likes · ⚡ 0 Tips

{
  "txid": "13569191ef62ef1f9fac281b59d9ccc0925ad234f54c35be3520bfc2cf0183d3",
  "block_height": 0,
  "time": null,
  "app": "treechat",
  "type": "reply",
  "map_content": "!s Dijkstra\u2019s algorithm",
  "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,
  "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"
}

Signed by14aqJ2hMtENYJVCJaekcrqi12fiZJzoWGKAIP!