{ "index": { "links": { "/": [ { "source": "/", "target": "/setup/setup", "text": "Setup your own Amethyst instance" }, { "source": "/", "target": "/setup/editing", "text": "Editing Notes in Amethyst" }, { "source": "/", "target": "/setup/obsidian", "text": "How to setup your Obsidian Vault to work with Amethyst" }, { "source": "/", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/", "target": "/setup/config", "text": "Customizing Amethyst" }, { "source": "/", "target": "/setup/updating", "text": "update" }, { "source": "/", "target": "/tags/setup", "text": "setup-related notes" }, { "source": "/", "target": "/setup/troubleshooting", "text": "Troubleshooting and FAQ" } ], "/cs61b/": [ { "source": "/cs61b/", "target": "/oop/access-control", "text": "Access Control" }, { "source": "/cs61b/", "target": "/oop/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/", "target": "/oop/generics", "text": "Generic Types" }, { "source": "/cs61b/", "target": "/asymptotics/asymptotics-practice", "text": "Asymptotics Practice" }, { "source": "/cs61b/", "target": "/abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/sets", "text": "Sets" }, { "source": "/cs61b/", "target": "/sorting/sorting-basics", "text": "Sorting" }, { "source": "/cs61b/", "target": "/algorithms/searching/", "text": "Searching" }, { "source": "/cs61b/", "target": "/algorithms/searching/binary-search", "text": "Binary Search" }, { "source": "/cs61b/", "target": "/algorithms/shortest-paths/", "text": "Shortest Paths" }, { "source": "/cs61b/", "target": "/misc-topics/exceptions", "text": "Exceptions" } ], "/cs61b/SUMMARY": [ { "source": "/cs61b/SUMMARY", "target": "/CS61B-Index", "text": "Welcome" }, { "source": "/cs61b/SUMMARY", "target": "/oop/inheritance", "text": "Inheritance" }, { "source": "/cs61b/SUMMARY", "target": "/oop/access-control", "text": "Access Control" }, { "source": "/cs61b/SUMMARY", "target": "/oop/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/SUMMARY", "target": "/oop/objects", "text": "Java Objects" }, { "source": "/cs61b/SUMMARY", "target": "/oop/generics", "text": "Generic Types" }, { "source": "/cs61b/SUMMARY", "target": "/asymptotics/asymptotics", "text": "Asymptotic Analysis Basics" }, { "source": "/cs61b/SUMMARY", "target": "/asymptotics/amortization", "text": "Amortization" }, { "source": "/cs61b/SUMMARY", "target": "/asymptotics/asymptotics-practice", "text": "Asymptotics Practice" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/README", "text": "Collections" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/arrays", "text": "Arrays" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/sets", "text": "Sets" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/README", "text": "Binary Trees" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/heaps", "text": "Heaps" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/balanced-search-structures", "text": "Balanced BSTs" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/tries", "text": "Tries" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/graphs", "text": "Graphs" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/comparables-and-comparators", "text": "Comparables and Comparators" }, { "source": "/cs61b/SUMMARY", "target": "/sorting/sorting-basics", "text": "Sorting" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimax", "text": "Minimax Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/README", "text": "Searching" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/binary-search", "text": "Binary Search" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/depth-first-search-dfs", "text": "Depth First Search (DFS)" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/breadth-first-search-bfs", "text": "Breadth First Search (BFS)" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/README", "text": "Shortest Paths" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/a-search", "text": "A* Search" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/README", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/prims-algorithm", "text": "Prim's Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/misc-topics/modular-arithmetic", "text": "Modular Arithmetic and Bit Manipulation" }, { "source": "/cs61b/SUMMARY", "target": "/misc-topics/exceptions", "text": "Exceptions" }, { "source": "/cs61b/SUMMARY", "target": "/misc-topics/more-resources", "text": "More Resources" } ], "/cs61b/abstract-data-types/binary-trees/README": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/binary-search", "text": "binary-search.md" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/balanced-search-structures", "text": "Balanced BSTs" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../graphs", "text": "Graphs" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/tries", "text": "Tries" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../hashing", "text": "Hash Tables" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/depth-first-search-dfs", "text": "depth-first-search-dfs.md" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/breadth-first-search-bfs", "text": "breadth-first-search-bfs.md" } ], "/cs61b/abstract-data-types/binary-trees/balanced-search-structures": [ { "source": "/cs61b/abstract-data-types/binary-trees/balanced-search-structures", "target": "/./", "text": "Binary Trees" } ], "/cs61b/abstract-data-types/binary-trees/tries": [ { "source": "/cs61b/abstract-data-types/binary-trees/tries", "target": "/../hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/abstract-data-types/binary-trees/tries", "target": "/../collections/sets", "text": "Sets" } ], "/cs61b/abstract-data-types/collections/README": [ { "source": "/cs61b/abstract-data-types/collections/README", "target": "/arrays", "text": "ArrayLists" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/sets", "text": "Sets" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/../hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/stacks-and-queues", "text": "Stacks and Queues" } ], "/cs61b/abstract-data-types/collections/arrays": [ { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../oop/objects", "text": "Java Objects" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../asymptotics/amortization", "text": "Amortization" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../oop/generics", "text": "Generic Types" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/./", "text": "Collections" } ], "/cs61b/abstract-data-types/collections/linked-lists": [ { "source": "/cs61b/abstract-data-types/collections/linked-lists", "target": "/arrays", "text": "Arrays" } ], "/cs61b/abstract-data-types/collections/sets": [ { "source": "/cs61b/abstract-data-types/collections/sets", "target": "/../../asymptotics/amortization", "text": "resized" } ], "/cs61b/abstract-data-types/collections/stacks-and-queues": [ { "source": "/cs61b/abstract-data-types/collections/stacks-and-queues", "target": "/../../algorithms/shortest-paths/dijkstras-algorithm", "text": "finding shortest paths using Dijkstra's Algorithm" }, { "source": "/cs61b/abstract-data-types/collections/stacks-and-queues", "target": "/stacks-and-queues", "text": "Priority Queues" } ], "/cs61b/abstract-data-types/graphs": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/searching/depth-first-search-dfs", "text": "Depth First Search (DFS)" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/searching/breadth-first-search-bfs", "text": "Breadth First Search (BFS)" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/", "text": "Shortest Paths" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/a-search", "text": "A* Search" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/prims-algorithm", "text": "Prim's Algorithm" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" } ], "/cs61b/abstract-data-types/hashing": [ { "source": "/cs61b/abstract-data-types/hashing", "target": "/../asymptotics/amortization", "text": "Amortization" } ], "/cs61b/abstract-data-types/union-find-disjoint-sets": [ { "source": "/cs61b/abstract-data-types/union-find-disjoint-sets", "target": "/../algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" } ], "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm": [ { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/./", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "PriorityQueue" } ], "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm": [ { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/./README", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "PriorityQueue" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/../shortest-paths/dijkstras-algorithm", "text": "Dijkstra's" } ], "/cs61b/algorithms/searching/README": [ { "source": "/cs61b/algorithms/searching/README", "target": "/binary-search", "text": "binary-search.md" }, { "source": "/cs61b/algorithms/searching/README", "target": "/depth-first-search-dfs", "text": "depth-first-search-dfs.md" }, { "source": "/cs61b/algorithms/searching/README", "target": "/breadth-first-search-bfs", "text": "breadth-first-search-bfs.md" } ], "/cs61b/algorithms/searching/binary-search": [ { "source": "/cs61b/algorithms/searching/binary-search", "target": "/../../abstract-data-types/binary-trees/", "text": "binary trees" } ], "/cs61b/algorithms/searching/breadth-first-search-bfs": [ { "source": "/cs61b/algorithms/searching/breadth-first-search-bfs", "target": "/depth-first-search-dfs", "text": "Depth First Search (DFS)" }, { "source": "/cs61b/algorithms/searching/breadth-first-search-bfs", "target": "/../shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" } ], "/cs61b/algorithms/shortest-paths/a-search": [ { "source": "/cs61b/algorithms/shortest-paths/a-search", "target": "/dijkstras-algorithm", "text": "Dijkstra's Algorithm" } ], "/cs61b/algorithms/shortest-paths/dijkstras-algorithm": [ { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/../../abstract-data-types/graphs", "text": "Graphs" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/./", "text": "Shortest Paths" } ], "/cs61b/asymptotics/amortization": [ { "source": "/cs61b/asymptotics/amortization", "target": "/asymptotics", "text": "Asymptotic Analysis Basics" } ], "/cs61b/asymptotics/asymptotics": [ { "source": "/cs61b/asymptotics/asymptotics", "target": "/asymptotics-practice", "text": "try some problems!" }, { "source": "/cs61b/asymptotics/asymptotics", "target": "/asymptotics", "text": "Simplify" } ], "/cs61b/asymptotics/asymptotics-practice": [ { "source": "/cs61b/asymptotics/asymptotics-practice", "target": "/asymptotics", "text": "Asymptotic Analysis Basics" } ], "/cs61b/misc-topics/modular-arithmetic": [ { "source": "/cs61b/misc-topics/modular-arithmetic", "target": "/../oop/objects", "text": "Java Objects" } ], "/cs61b/oop/dynamic-method-selection": [ { "source": "/cs61b/oop/dynamic-method-selection", "target": "/inheritance", "text": "inheritance" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/access-control", "text": "access control" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/inheritance", "text": "Interfaces" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/../abstract-data-types/collections/", "text": "Collections" } ], "/cs61b/oop/generics": [ { "source": "/cs61b/oop/generics", "target": "/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/oop/generics", "target": "/inheritance", "text": "inheritance rules" } ], "/cs61b/oop/inheritance": [ { "source": "/cs61b/oop/inheritance", "target": "/access-control", "text": "Access Control" }, { "source": "/cs61b/oop/inheritance", "target": "/objects", "text": "References, Objects, and Types in Java" }, { "source": "/cs61b/oop/inheritance", "target": "/generics", "text": "Generic Types" }, { "source": "/cs61b/oop/inheritance", "target": "/dynamic-method-selection", "text": "Dynamic Method Selection" } ], "/cs61b/oop/objects": [ { "source": "/cs61b/oop/objects", "target": "/../misc-topics/modular-arithmetic", "text": "Modular Arithmetic and Bit Manipulation" }, { "source": "/cs61b/oop/objects", "target": "/../abstract-data-types/collections/", "text": "collections" } ], "/features/languages": [ { "source": "/features/languages", "target": "/setup/config", "text": "config" } ], "/setup/config": [ { "source": "/setup/config", "target": "/features/language", "text": "Chinese, Japanese, and Korean support" }, { "source": "/setup/config", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" } ], "/setup/editing": [ { "source": "/setup/editing", "target": "/setup/obsidian", "text": "How to setup your Obsidian Vault to work with Amethyst" }, { "source": "/setup/editing", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/setup/editing", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/setup/editing", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" } ], "/setup/hosting": [ { "source": "/setup/hosting", "target": "/setup/custom-Domain", "text": "Learn how to set it up with Amethyst" }, { "source": "/setup/hosting", "target": "/setup/ignore-notes", "text": "Excluding pages from being published" }, { "source": "/setup/hosting", "target": "/setup/config", "text": "Customizing Amethyst" }, { "source": "/setup/hosting", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" } ], "/setup/obsidian": [ { "source": "/setup/obsidian", "target": "/setup/setup", "text": "setup" }, { "source": "/setup/obsidian", "target": "/setup/preview-changes", "text": "Preview Changes" } ], "/setup/preview-changes": [ { "source": "/setup/preview-changes", "target": "/setup/hosting", "text": "Hosting Amethyst online!" } ], "/setup/setup": [ { "source": "/setup/setup", "target": "/setup/editing", "text": "Editing Notes in Amethyst" }, { "source": "/setup/setup", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" } ], "/setup/troubleshooting": [ { "source": "/setup/troubleshooting", "target": "/features/latex", "text": "LaTeX" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "hosting" }, { "source": "/setup/troubleshooting", "target": "/setup/ignore-notes", "text": "excluding pages from being published" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "hosting" }, { "source": "/setup/troubleshooting", "target": "/setup/obsidian", "text": "Obsidian" }, { "source": "/setup/troubleshooting", "target": "/setup/editing", "text": "the 'how to edit' guide" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "the hosting guide" }, { "source": "/setup/troubleshooting", "target": "/setup/config", "text": "customization guide" }, { "source": "/setup/troubleshooting", "target": "/setup/editing", "text": "local editing" } ] }, "backlinks": { "/../../abstract-data-types/binary-trees/": [ { "source": "/cs61b/algorithms/searching/binary-search", "target": "/../../abstract-data-types/binary-trees/", "text": "binary trees" } ], "/../../abstract-data-types/collections/stacks-and-queues": [ { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "PriorityQueue" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "PriorityQueue" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" } ], "/../../abstract-data-types/graphs": [ { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/../../abstract-data-types/graphs", "text": "Graphs" } ], "/../../abstract-data-types/union-find-disjoint-sets": [ { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" } ], "/../../algorithms/searching/binary-search": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/binary-search", "text": "binary-search.md" } ], "/../../algorithms/searching/breadth-first-search-bfs": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/breadth-first-search-bfs", "text": "breadth-first-search-bfs.md" } ], "/../../algorithms/searching/depth-first-search-dfs": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/depth-first-search-dfs", "text": "depth-first-search-dfs.md" } ], "/../../algorithms/shortest-paths/dijkstras-algorithm": [ { "source": "/cs61b/abstract-data-types/collections/stacks-and-queues", "target": "/../../algorithms/shortest-paths/dijkstras-algorithm", "text": "finding shortest paths using Dijkstra's Algorithm" } ], "/../../asymptotics/amortization": [ { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../asymptotics/amortization", "text": "Amortization" }, { "source": "/cs61b/abstract-data-types/collections/sets", "target": "/../../asymptotics/amortization", "text": "resized" } ], "/../../oop/generics": [ { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../oop/generics", "text": "Generic Types" } ], "/../../oop/objects": [ { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../oop/objects", "text": "Java Objects" } ], "/../abstract-data-types/collections/": [ { "source": "/cs61b/oop/dynamic-method-selection", "target": "/../abstract-data-types/collections/", "text": "Collections" }, { "source": "/cs61b/oop/objects", "target": "/../abstract-data-types/collections/", "text": "collections" } ], "/../algorithms/minimum-spanning-trees/": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/", "text": "Minimum Spanning Trees" } ], "/../algorithms/minimum-spanning-trees/kruskals-algorithm": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" }, { "source": "/cs61b/abstract-data-types/union-find-disjoint-sets", "target": "/../algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" } ], "/../algorithms/minimum-spanning-trees/prims-algorithm": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/prims-algorithm", "text": "Prim's Algorithm" } ], "/../algorithms/searching/breadth-first-search-bfs": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/searching/breadth-first-search-bfs", "text": "Breadth First Search (BFS)" } ], "/../algorithms/searching/depth-first-search-dfs": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/searching/depth-first-search-dfs", "text": "Depth First Search (DFS)" } ], "/../algorithms/shortest-paths/": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/", "text": "Shortest Paths" } ], "/../algorithms/shortest-paths/a-search": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/a-search", "text": "A* Search" } ], "/../algorithms/shortest-paths/dijkstras-algorithm": [ { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" } ], "/../asymptotics/amortization": [ { "source": "/cs61b/abstract-data-types/hashing", "target": "/../asymptotics/amortization", "text": "Amortization" } ], "/../collections/sets": [ { "source": "/cs61b/abstract-data-types/binary-trees/tries", "target": "/../collections/sets", "text": "Sets" } ], "/../graphs": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../graphs", "text": "Graphs" } ], "/../hashing": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../hashing", "text": "Hash Tables" }, { "source": "/cs61b/abstract-data-types/binary-trees/tries", "target": "/../hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/../hashing", "text": "Hashing and Hash Tables" } ], "/../misc-topics/modular-arithmetic": [ { "source": "/cs61b/oop/objects", "target": "/../misc-topics/modular-arithmetic", "text": "Modular Arithmetic and Bit Manipulation" } ], "/../oop/objects": [ { "source": "/cs61b/misc-topics/modular-arithmetic", "target": "/../oop/objects", "text": "Java Objects" } ], "/../shortest-paths/dijkstras-algorithm": [ { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/../shortest-paths/dijkstras-algorithm", "text": "Dijkstra's" }, { "source": "/cs61b/algorithms/searching/breadth-first-search-bfs", "target": "/../shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" } ], "/./": [ { "source": "/cs61b/abstract-data-types/binary-trees/balanced-search-structures", "target": "/./", "text": "Binary Trees" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/./", "text": "Collections" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/./", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/./", "text": "Shortest Paths" } ], "/./README": [ { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/./README", "text": "Minimum Spanning Trees" } ], "/CS61B-Index": [ { "source": "/cs61b/SUMMARY", "target": "/CS61B-Index", "text": "Welcome" } ], "/abstract-data-types/binary-trees/README": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/README", "text": "Binary Trees" } ], "/abstract-data-types/binary-trees/balanced-search-structures": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/balanced-search-structures", "text": "Balanced BSTs" } ], "/abstract-data-types/binary-trees/heaps": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/heaps", "text": "Heaps" } ], "/abstract-data-types/binary-trees/tries": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/tries", "text": "Tries" } ], "/abstract-data-types/collections/README": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/README", "text": "Collections" } ], "/abstract-data-types/collections/arrays": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/arrays", "text": "Arrays" } ], "/abstract-data-types/collections/linked-lists": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/linked-lists", "text": "Linked Lists" } ], "/abstract-data-types/collections/sets": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/sets", "text": "Sets" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/sets", "text": "Sets" } ], "/abstract-data-types/collections/stacks-and-queues": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" } ], "/abstract-data-types/comparables-and-comparators": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/comparables-and-comparators", "text": "Comparables and Comparators" } ], "/abstract-data-types/graphs": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/graphs", "text": "Graphs" } ], "/abstract-data-types/hashing": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/hashing", "text": "Hashing and Hash Tables" } ], "/abstract-data-types/union-find-disjoint-sets": [ { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/", "target": "/abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" } ], "/access-control": [ { "source": "/cs61b/oop/dynamic-method-selection", "target": "/access-control", "text": "access control" }, { "source": "/cs61b/oop/inheritance", "target": "/access-control", "text": "Access Control" } ], "/algorithms/minimax": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimax", "text": "Minimax Algorithm" } ], "/algorithms/minimum-spanning-trees/README": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/README", "text": "Minimum Spanning Trees" } ], "/algorithms/minimum-spanning-trees/kruskals-algorithm": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" } ], "/algorithms/minimum-spanning-trees/prims-algorithm": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/prims-algorithm", "text": "Prim's Algorithm" } ], "/algorithms/searching/": [ { "source": "/cs61b/", "target": "/algorithms/searching/", "text": "Searching" } ], "/algorithms/searching/README": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/README", "text": "Searching" } ], "/algorithms/searching/binary-search": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/binary-search", "text": "Binary Search" }, { "source": "/cs61b/", "target": "/algorithms/searching/binary-search", "text": "Binary Search" } ], "/algorithms/searching/breadth-first-search-bfs": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/breadth-first-search-bfs", "text": "Breadth First Search (BFS)" } ], "/algorithms/searching/depth-first-search-dfs": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/depth-first-search-dfs", "text": "Depth First Search (DFS)" } ], "/algorithms/shortest-paths/": [ { "source": "/cs61b/", "target": "/algorithms/shortest-paths/", "text": "Shortest Paths" } ], "/algorithms/shortest-paths/README": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/README", "text": "Shortest Paths" } ], "/algorithms/shortest-paths/a-search": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/a-search", "text": "A* Search" } ], "/algorithms/shortest-paths/dijkstras-algorithm": [ { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" } ], "/arrays": [ { "source": "/cs61b/abstract-data-types/collections/README", "target": "/arrays", "text": "ArrayLists" }, { "source": "/cs61b/abstract-data-types/collections/linked-lists", "target": "/arrays", "text": "Arrays" } ], "/asymptotics": [ { "source": "/cs61b/asymptotics/amortization", "target": "/asymptotics", "text": "Asymptotic Analysis Basics" }, { "source": "/cs61b/asymptotics/asymptotics-practice", "target": "/asymptotics", "text": "Asymptotic Analysis Basics" }, { "source": "/cs61b/asymptotics/asymptotics", "target": "/asymptotics", "text": "Simplify" } ], "/asymptotics-practice": [ { "source": "/cs61b/asymptotics/asymptotics", "target": "/asymptotics-practice", "text": "try some problems!" } ], "/asymptotics/amortization": [ { "source": "/cs61b/SUMMARY", "target": "/asymptotics/amortization", "text": "Amortization" } ], "/asymptotics/asymptotics": [ { "source": "/cs61b/SUMMARY", "target": "/asymptotics/asymptotics", "text": "Asymptotic Analysis Basics" } ], "/asymptotics/asymptotics-practice": [ { "source": "/cs61b/SUMMARY", "target": "/asymptotics/asymptotics-practice", "text": "Asymptotics Practice" }, { "source": "/cs61b/", "target": "/asymptotics/asymptotics-practice", "text": "Asymptotics Practice" } ], "/balanced-search-structures": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/balanced-search-structures", "text": "Balanced BSTs" } ], "/binary-search": [ { "source": "/cs61b/algorithms/searching/README", "target": "/binary-search", "text": "binary-search.md" } ], "/breadth-first-search-bfs": [ { "source": "/cs61b/algorithms/searching/README", "target": "/breadth-first-search-bfs", "text": "breadth-first-search-bfs.md" } ], "/depth-first-search-dfs": [ { "source": "/cs61b/algorithms/searching/README", "target": "/depth-first-search-dfs", "text": "depth-first-search-dfs.md" }, { "source": "/cs61b/algorithms/searching/breadth-first-search-bfs", "target": "/depth-first-search-dfs", "text": "Depth First Search (DFS)" } ], "/dijkstras-algorithm": [ { "source": "/cs61b/algorithms/shortest-paths/a-search", "target": "/dijkstras-algorithm", "text": "Dijkstra's Algorithm" } ], "/dynamic-method-selection": [ { "source": "/cs61b/oop/generics", "target": "/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/oop/inheritance", "target": "/dynamic-method-selection", "text": "Dynamic Method Selection" } ], "/features/language": [ { "source": "/setup/config", "target": "/features/language", "text": "Chinese, Japanese, and Korean support" } ], "/features/latex": [ { "source": "/setup/troubleshooting", "target": "/features/latex", "text": "LaTeX" } ], "/generics": [ { "source": "/cs61b/oop/inheritance", "target": "/generics", "text": "Generic Types" } ], "/inheritance": [ { "source": "/cs61b/oop/dynamic-method-selection", "target": "/inheritance", "text": "inheritance" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/inheritance", "text": "Interfaces" }, { "source": "/cs61b/oop/generics", "target": "/inheritance", "text": "inheritance rules" } ], "/linked-lists": [ { "source": "/cs61b/abstract-data-types/collections/README", "target": "/linked-lists", "text": "Linked Lists" } ], "/misc-topics/exceptions": [ { "source": "/cs61b/SUMMARY", "target": "/misc-topics/exceptions", "text": "Exceptions" }, { "source": "/cs61b/", "target": "/misc-topics/exceptions", "text": "Exceptions" } ], "/misc-topics/modular-arithmetic": [ { "source": "/cs61b/SUMMARY", "target": "/misc-topics/modular-arithmetic", "text": "Modular Arithmetic and Bit Manipulation" } ], "/misc-topics/more-resources": [ { "source": "/cs61b/SUMMARY", "target": "/misc-topics/more-resources", "text": "More Resources" } ], "/objects": [ { "source": "/cs61b/oop/inheritance", "target": "/objects", "text": "References, Objects, and Types in Java" } ], "/oop/access-control": [ { "source": "/cs61b/SUMMARY", "target": "/oop/access-control", "text": "Access Control" }, { "source": "/cs61b/", "target": "/oop/access-control", "text": "Access Control" } ], "/oop/dynamic-method-selection": [ { "source": "/cs61b/SUMMARY", "target": "/oop/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/", "target": "/oop/dynamic-method-selection", "text": "Dynamic Method Selection" } ], "/oop/generics": [ { "source": "/cs61b/SUMMARY", "target": "/oop/generics", "text": "Generic Types" }, { "source": "/cs61b/", "target": "/oop/generics", "text": "Generic Types" } ], "/oop/inheritance": [ { "source": "/cs61b/SUMMARY", "target": "/oop/inheritance", "text": "Inheritance" } ], "/oop/objects": [ { "source": "/cs61b/SUMMARY", "target": "/oop/objects", "text": "Java Objects" } ], "/sets": [ { "source": "/cs61b/abstract-data-types/collections/README", "target": "/sets", "text": "Sets" } ], "/setup/config": [ { "source": "/", "target": "/setup/config", "text": "Customizing Amethyst" }, { "source": "/features/languages", "target": "/setup/config", "text": "config" }, { "source": "/setup/hosting", "target": "/setup/config", "text": "Customizing Amethyst" }, { "source": "/setup/troubleshooting", "target": "/setup/config", "text": "customization guide" } ], "/setup/custom-Domain": [ { "source": "/setup/hosting", "target": "/setup/custom-Domain", "text": "Learn how to set it up with Amethyst" } ], "/setup/editing": [ { "source": "/", "target": "/setup/editing", "text": "Editing Notes in Amethyst" }, { "source": "/setup/setup", "target": "/setup/editing", "text": "Editing Notes in Amethyst" }, { "source": "/setup/troubleshooting", "target": "/setup/editing", "text": "the 'how to edit' guide" }, { "source": "/setup/troubleshooting", "target": "/setup/editing", "text": "local editing" } ], "/setup/hosting": [ { "source": "/", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/setup/editing", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/setup/preview-changes", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "hosting" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "hosting" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "the hosting guide" } ], "/setup/ignore-notes": [ { "source": "/setup/hosting", "target": "/setup/ignore-notes", "text": "Excluding pages from being published" }, { "source": "/setup/troubleshooting", "target": "/setup/ignore-notes", "text": "excluding pages from being published" } ], "/setup/obsidian": [ { "source": "/", "target": "/setup/obsidian", "text": "How to setup your Obsidian Vault to work with Amethyst" }, { "source": "/setup/editing", "target": "/setup/obsidian", "text": "How to setup your Obsidian Vault to work with Amethyst" }, { "source": "/setup/troubleshooting", "target": "/setup/obsidian", "text": "Obsidian" } ], "/setup/preview-changes": [ { "source": "/", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/setup/editing", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/setup/obsidian", "target": "/setup/preview-changes", "text": "Preview Changes" } ], "/setup/setup": [ { "source": "/", "target": "/setup/setup", "text": "Setup your own Amethyst instance" }, { "source": "/setup/obsidian", "target": "/setup/setup", "text": "setup" } ], "/setup/troubleshooting": [ { "source": "/", "target": "/setup/troubleshooting", "text": "Troubleshooting and FAQ" }, { "source": "/setup/config", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/editing", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/hosting", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/setup", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" } ], "/setup/updating": [ { "source": "/", "target": "/setup/updating", "text": "update" } ], "/sorting/sorting-basics": [ { "source": "/cs61b/SUMMARY", "target": "/sorting/sorting-basics", "text": "Sorting" }, { "source": "/cs61b/", "target": "/sorting/sorting-basics", "text": "Sorting" } ], "/stacks-and-queues": [ { "source": "/cs61b/abstract-data-types/collections/README", "target": "/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/abstract-data-types/collections/stacks-and-queues", "target": "/stacks-and-queues", "text": "Priority Queues" } ], "/tags/setup": [ { "source": "/", "target": "/tags/setup", "text": "setup-related notes" } ], "/tries": [ { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/tries", "text": "Tries" } ] } }, "links": [ { "source": "/", "target": "/setup/setup", "text": "Setup your own Amethyst instance" }, { "source": "/", "target": "/setup/editing", "text": "Editing Notes in Amethyst" }, { "source": "/", "target": "/setup/obsidian", "text": "How to setup your Obsidian Vault to work with Amethyst" }, { "source": "/", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/", "target": "/setup/config", "text": "Customizing Amethyst" }, { "source": "/", "target": "/setup/updating", "text": "update" }, { "source": "/", "target": "/tags/setup", "text": "setup-related notes" }, { "source": "/", "target": "/setup/troubleshooting", "text": "Troubleshooting and FAQ" }, { "source": "/cs61b/SUMMARY", "target": "/CS61B-Index", "text": "Welcome" }, { "source": "/cs61b/SUMMARY", "target": "/oop/inheritance", "text": "Inheritance" }, { "source": "/cs61b/SUMMARY", "target": "/oop/access-control", "text": "Access Control" }, { "source": "/cs61b/SUMMARY", "target": "/oop/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/SUMMARY", "target": "/oop/objects", "text": "Java Objects" }, { "source": "/cs61b/SUMMARY", "target": "/oop/generics", "text": "Generic Types" }, { "source": "/cs61b/SUMMARY", "target": "/asymptotics/asymptotics", "text": "Asymptotic Analysis Basics" }, { "source": "/cs61b/SUMMARY", "target": "/asymptotics/amortization", "text": "Amortization" }, { "source": "/cs61b/SUMMARY", "target": "/asymptotics/asymptotics-practice", "text": "Asymptotics Practice" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/README", "text": "Collections" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/arrays", "text": "Arrays" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/sets", "text": "Sets" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/README", "text": "Binary Trees" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/heaps", "text": "Heaps" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/balanced-search-structures", "text": "Balanced BSTs" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/binary-trees/tries", "text": "Tries" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/graphs", "text": "Graphs" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/SUMMARY", "target": "/abstract-data-types/comparables-and-comparators", "text": "Comparables and Comparators" }, { "source": "/cs61b/SUMMARY", "target": "/sorting/sorting-basics", "text": "Sorting" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimax", "text": "Minimax Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/README", "text": "Searching" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/binary-search", "text": "Binary Search" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/depth-first-search-dfs", "text": "Depth First Search (DFS)" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/searching/breadth-first-search-bfs", "text": "Breadth First Search (BFS)" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/README", "text": "Shortest Paths" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/shortest-paths/a-search", "text": "A* Search" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/README", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/prims-algorithm", "text": "Prim's Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" }, { "source": "/cs61b/SUMMARY", "target": "/misc-topics/modular-arithmetic", "text": "Modular Arithmetic and Bit Manipulation" }, { "source": "/cs61b/SUMMARY", "target": "/misc-topics/exceptions", "text": "Exceptions" }, { "source": "/cs61b/SUMMARY", "target": "/misc-topics/more-resources", "text": "More Resources" }, { "source": "/cs61b/", "target": "/oop/access-control", "text": "Access Control" }, { "source": "/cs61b/", "target": "/oop/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/", "target": "/oop/generics", "text": "Generic Types" }, { "source": "/cs61b/", "target": "/asymptotics/asymptotics-practice", "text": "Asymptotics Practice" }, { "source": "/cs61b/", "target": "/abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/", "target": "/abstract-data-types/collections/sets", "text": "Sets" }, { "source": "/cs61b/", "target": "/sorting/sorting-basics", "text": "Sorting" }, { "source": "/cs61b/", "target": "/algorithms/searching/", "text": "Searching" }, { "source": "/cs61b/", "target": "/algorithms/searching/binary-search", "text": "Binary Search" }, { "source": "/cs61b/", "target": "/algorithms/shortest-paths/", "text": "Shortest Paths" }, { "source": "/cs61b/", "target": "/misc-topics/exceptions", "text": "Exceptions" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/binary-search", "text": "binary-search.md" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/balanced-search-structures", "text": "Balanced BSTs" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../graphs", "text": "Graphs" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/tries", "text": "Tries" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../hashing", "text": "Hash Tables" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/depth-first-search-dfs", "text": "depth-first-search-dfs.md" }, { "source": "/cs61b/abstract-data-types/binary-trees/README", "target": "/../../algorithms/searching/breadth-first-search-bfs", "text": "breadth-first-search-bfs.md" }, { "source": "/cs61b/abstract-data-types/binary-trees/balanced-search-structures", "target": "/./", "text": "Binary Trees" }, { "source": "/cs61b/abstract-data-types/binary-trees/tries", "target": "/../hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/abstract-data-types/binary-trees/tries", "target": "/../collections/sets", "text": "Sets" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/arrays", "text": "ArrayLists" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/linked-lists", "text": "Linked Lists" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/sets", "text": "Sets" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/../hashing", "text": "Hashing and Hash Tables" }, { "source": "/cs61b/abstract-data-types/collections/README", "target": "/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../oop/objects", "text": "Java Objects" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../asymptotics/amortization", "text": "Amortization" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/../../oop/generics", "text": "Generic Types" }, { "source": "/cs61b/abstract-data-types/collections/arrays", "target": "/./", "text": "Collections" }, { "source": "/cs61b/abstract-data-types/collections/linked-lists", "target": "/arrays", "text": "Arrays" }, { "source": "/cs61b/abstract-data-types/collections/sets", "target": "/../../asymptotics/amortization", "text": "resized" }, { "source": "/cs61b/abstract-data-types/collections/stacks-and-queues", "target": "/../../algorithms/shortest-paths/dijkstras-algorithm", "text": "finding shortest paths using Dijkstra's Algorithm" }, { "source": "/cs61b/abstract-data-types/collections/stacks-and-queues", "target": "/stacks-and-queues", "text": "Priority Queues" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/searching/depth-first-search-dfs", "text": "Depth First Search (DFS)" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/searching/breadth-first-search-bfs", "text": "Breadth First Search (BFS)" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/", "text": "Shortest Paths" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/shortest-paths/a-search", "text": "A* Search" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/prims-algorithm", "text": "Prim's Algorithm" }, { "source": "/cs61b/abstract-data-types/graphs", "target": "/../algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" }, { "source": "/cs61b/abstract-data-types/hashing", "target": "/../asymptotics/amortization", "text": "Amortization" }, { "source": "/cs61b/abstract-data-types/union-find-disjoint-sets", "target": "/../algorithms/minimum-spanning-trees/kruskals-algorithm", "text": "Kruskal's Algorithm" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/./", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/union-find-disjoint-sets", "text": "Union Find (Disjoint Sets)" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/kruskals-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "PriorityQueue" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/./README", "text": "Minimum Spanning Trees" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "PriorityQueue" }, { "source": "/cs61b/algorithms/minimum-spanning-trees/prims-algorithm", "target": "/../shortest-paths/dijkstras-algorithm", "text": "Dijkstra's" }, { "source": "/cs61b/algorithms/searching/README", "target": "/binary-search", "text": "binary-search.md" }, { "source": "/cs61b/algorithms/searching/README", "target": "/depth-first-search-dfs", "text": "depth-first-search-dfs.md" }, { "source": "/cs61b/algorithms/searching/README", "target": "/breadth-first-search-bfs", "text": "breadth-first-search-bfs.md" }, { "source": "/cs61b/algorithms/searching/binary-search", "target": "/../../abstract-data-types/binary-trees/", "text": "binary trees" }, { "source": "/cs61b/algorithms/searching/breadth-first-search-bfs", "target": "/depth-first-search-dfs", "text": "Depth First Search (DFS)" }, { "source": "/cs61b/algorithms/searching/breadth-first-search-bfs", "target": "/../shortest-paths/dijkstras-algorithm", "text": "Dijkstra's Algorithm" }, { "source": "/cs61b/algorithms/shortest-paths/a-search", "target": "/dijkstras-algorithm", "text": "Dijkstra's Algorithm" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/../../abstract-data-types/graphs", "text": "Graphs" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/../../abstract-data-types/collections/stacks-and-queues", "text": "Stacks and Queues" }, { "source": "/cs61b/algorithms/shortest-paths/dijkstras-algorithm", "target": "/./", "text": "Shortest Paths" }, { "source": "/cs61b/asymptotics/amortization", "target": "/asymptotics", "text": "Asymptotic Analysis Basics" }, { "source": "/cs61b/asymptotics/asymptotics-practice", "target": "/asymptotics", "text": "Asymptotic Analysis Basics" }, { "source": "/cs61b/asymptotics/asymptotics", "target": "/asymptotics-practice", "text": "try some problems!" }, { "source": "/cs61b/asymptotics/asymptotics", "target": "/asymptotics", "text": "Simplify" }, { "source": "/cs61b/misc-topics/modular-arithmetic", "target": "/../oop/objects", "text": "Java Objects" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/inheritance", "text": "inheritance" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/access-control", "text": "access control" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/inheritance", "text": "Interfaces" }, { "source": "/cs61b/oop/dynamic-method-selection", "target": "/../abstract-data-types/collections/", "text": "Collections" }, { "source": "/cs61b/oop/generics", "target": "/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/oop/generics", "target": "/inheritance", "text": "inheritance rules" }, { "source": "/cs61b/oop/inheritance", "target": "/access-control", "text": "Access Control" }, { "source": "/cs61b/oop/inheritance", "target": "/objects", "text": "References, Objects, and Types in Java" }, { "source": "/cs61b/oop/inheritance", "target": "/generics", "text": "Generic Types" }, { "source": "/cs61b/oop/inheritance", "target": "/dynamic-method-selection", "text": "Dynamic Method Selection" }, { "source": "/cs61b/oop/objects", "target": "/../misc-topics/modular-arithmetic", "text": "Modular Arithmetic and Bit Manipulation" }, { "source": "/cs61b/oop/objects", "target": "/../abstract-data-types/collections/", "text": "collections" }, { "source": "/features/languages", "target": "/setup/config", "text": "config" }, { "source": "/setup/config", "target": "/features/language", "text": "Chinese, Japanese, and Korean support" }, { "source": "/setup/config", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/editing", "target": "/setup/obsidian", "text": "How to setup your Obsidian Vault to work with Amethyst" }, { "source": "/setup/editing", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/setup/editing", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/setup/editing", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/hosting", "target": "/setup/custom-Domain", "text": "Learn how to set it up with Amethyst" }, { "source": "/setup/hosting", "target": "/setup/ignore-notes", "text": "Excluding pages from being published" }, { "source": "/setup/hosting", "target": "/setup/config", "text": "Customizing Amethyst" }, { "source": "/setup/hosting", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/obsidian", "target": "/setup/setup", "text": "setup" }, { "source": "/setup/obsidian", "target": "/setup/preview-changes", "text": "Preview Changes" }, { "source": "/setup/preview-changes", "target": "/setup/hosting", "text": "Hosting Amethyst online!" }, { "source": "/setup/setup", "target": "/setup/editing", "text": "Editing Notes in Amethyst" }, { "source": "/setup/setup", "target": "/setup/troubleshooting", "text": "FAQ and Troubleshooting guide" }, { "source": "/setup/troubleshooting", "target": "/features/latex", "text": "LaTeX" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "hosting" }, { "source": "/setup/troubleshooting", "target": "/setup/ignore-notes", "text": "excluding pages from being published" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "hosting" }, { "source": "/setup/troubleshooting", "target": "/setup/obsidian", "text": "Obsidian" }, { "source": "/setup/troubleshooting", "target": "/setup/editing", "text": "the 'how to edit' guide" }, { "source": "/setup/troubleshooting", "target": "/setup/hosting", "text": "the hosting guide" }, { "source": "/setup/troubleshooting", "target": "/setup/config", "text": "customization guide" }, { "source": "/setup/troubleshooting", "target": "/setup/editing", "text": "local editing" } ] }