← Home ← Codex ← DEBT ← Engine
Browse by Category
+ added · updated 7d
🤖 AI Guestbook — #graphs educational data only
| |
Last 30 days
7 pings — 2026-08-26 W 3 pings — 2026-08-27 T 4 pings — 2026-08-28 F 2 pings — 2026-08-29 S 7 pings — 2026-08-30 S 6 pings — 2026-08-31 M 1 ping — 2026-09-01 T 2 pings — 2026-09-02 W 2 pings — 2026-09-03 T 5 pings — 2026-09-04 F 1 ping — 2026-09-05 S 6 pings — 2026-09-06 S 3 pings — 2026-09-07 M 2 pings — 2026-09-08 T 3 pings — 2026-09-09 W 6 pings — 2026-09-10 T 1 ping — 2026-09-11 F 2 pings — 2026-09-12 S 6 pings — 2026-09-13 S 4 pings — 2026-09-14 M 3 pings — 2026-09-15 T 4 pings — 2026-09-16 W 0 pings — 2026-09-17 T 3 pings — 2026-09-18 F 2 pings — 2026-09-19 S 2 pings — 2026-09-20 S 3 pings — 2026-09-21 M 3 pings — 2026-09-22 T 0 pings — Yesterday W 3 pings — Today T
Google 2Claude 1
No pings yesterday
Amazonbot 117PetalBot 68Perplexity 66Ahrefs 57ChatGPT 53SEMrush 51Google 46Bing 35Scrapy 30Claude 22Applebot 16Unknown AI 13Meta AI 9Baidu 9Brave Search 8Majestic 6Twitter/X 6Common Crawl 6Sogou 5Qwen 1
crawler 602 crawler_json 21 pre-tracking 1
Tag total624 pings Terms pinged7 / 7 Distinct agents19
Level All Beginner Intermediate Advanced Tag: graphs
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Diagram: Bellman-Ford Algorithm Bellman-Ford Algorithm PHP 7.1+
Single-source shortest path algorithm that handles negative edge weights and detects negative cycles by relaxing all edges V-1 times.
2mo ago Algorithms advanced
Diagram: Topological Sort Topological Sort PHP 7.4+
An ordering of nodes in a directed acyclic graph (DAG) such that for every directed edge u→v, node u appears before v in the ordering.
6mo ago Algorithms intermediate
A* Pathfinding Algorithm 🧠 4
Heuristic search algorithm that finds the lowest-cost path using f(n)=g(n)+h(n), widely used in maps and game AI.
6mo ago Algorithms advanced
Adjacency Matrix vs Adjacency List 🧠 1
Two ways to represent a graph — adjacency matrix (2D array, O(1) edge lookup, O(V²) space) vs adjacency list (array of lists, O(V+E) space, better for sparse graphs).
6mo ago Data Structures intermediate
Disjoint Set / Union-Find
A data structure tracking which elements belong to the same group — supporting near-O(1) union and find operations. Used for network connectivity, Kruskal's MST, and cycle detection.
6mo ago Data Structures advanced
Graphs 🧠 3
A collection of nodes (vertices) connected by edges — directed or undirected, weighted or unweighted. The most general data structure, modelling networks, dependencies, and relationships.
6mo ago Data Structures intermediate
Diagram: Graph Algorithms Graph Algorithms PHP 5.0+ 🧠 2
Algorithms for traversing, searching, and finding paths in graphs — BFS for shortest hops, DFS for exploration, Dijkstra for weighted shortest paths.
6mo ago Algorithms advanced
✓ schema.org compliant