Graph theory Edit Classic editor History Talk0 872pages 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 “Dijkstra's algorithm is one of the most widely used methods for finding single-source shortest... Dijkstra's algorithm “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 “In graph theory, the incidence matrix of a graph is a |E(G)| × |V(G)| matrix where each edge of... Incidence matrix “A tree is a connected acyclic graph. Tree “A graph is an ordered pair of a set of its vertices and a multiset of its edges. The graph is... Graph (graph theory) 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