chapter 9 GRAPH ALGORITHMs $I Definitions e G(V,E) where G: =graph, V=V(G): :=finite nonempty set of vertices, andE=E(G): : = finite set of edges. d' Undirected graph:(V;,vi)=(j,vi): =the same edge 6 Directed graph(digraph): :=2* I tailhead
(1) Hole particle current from E to B (2)Electron particle current from B to E (3)Recombination current in B (4) Hole particle current originating in E and reaching C (5)Reverse electron particle current from c to B (6) Reverse hole particle current from b to c (What is difference between \current\ and\particle current ? OE F Schubert, Rensselaer Polytechnic Institute, 2003