Graph theory Edit Classic editor History Talk0 855pages on this wiki Category page “Prim's algorithm yields a minimal spanning tree. Let be the spanning tree on generated by... Proof of Prim's algorithm “An angle is a two-dimensional geometric figure that consists of two rays with a common starting... Angle “Graph theory is the study of special structures called graphs. Graph - a graph is used to... Graph theory “Prim's algorithm is a common method for finding a minimal spanning tree of a connected... Prim's algorithm “Uniform cost search is a tree search algorithm related to breadth-first search. Whereas... Uniform cost search “Dijkstra's algorithm is one of the most widely used methods for finding single-source shortest... Dijkstra's algorithm “In graph theory, a vertex is a unit of a graph. The vertices may connect together to form a... Vertex (graph theory) “A tree is a connected acyclic graph. Tree Pages in category "Graph theory" The following 10 pages are in this category, out of 10 total. Graph theoryA AngleD Dijkstra's algorithmG Graph (graph theory) I Incidence matrixP Prim's algorithm Proof of Prim's algorithmT Tree U Uniform cost searchV Vertex (graph theory) Categories: Mathematics Add category Cancel Save