{
"graph_search": {
"name": "Graph Search",
"list": {
"dfs": "DFS",
"bfs": "BFS",
"dijkstra": "Dijkstra",
"bellman_ford": "Bellman-Ford",
"floyd_warshall": "Floyd-Warshall",
"topological_sort": "Topological-Sort"
}
},
"mst": {
"name": "Minimum Spanning Tree",
"list": {
"prim": "Prim's Algorithm"
}
},
"search": {
"name": "Search",
"list": {
"binary_search": "Binary Search"
}
},
"sorting": {
"name": "Sorting",
"list": {
"insertion": "Insertion Sort",
"selection": "Selection Sort",
"bubble": "Bubble Sort",
"quick": "Quicksort",
"merge": "Mergesort",
"heap" : "Heap Sort"
}
},
"string": {
"name": "String",
"list": {
"edit_distance": "Edit Distance"
}
},
"etc": {
"name": "Uncategorized",
"list": {
"dp": "Dynamic Programming",
"scratch_paper": " Scratch Paper"
}
}
}