π‘ How do I apply Dijkstra's algorithm for this graph?
π‘ What steps determine a Hamiltonian circuit in this graph?
π‘ Guide me through creating a minimum spanning tree with Prim's algorithm.
π‘ How do I identify the graph shape from an adjacency matrix?