CSC263H1 Lecture Notes - Lecture 9: Incidence Matrix, .Rs
Document Summary
Greflexiveedge directed graph undirected graph only directed edges only undirectededges operations addvertex s 9 remove vertex f. Tfw neighbourhood win return ka v un v but not va. Va vertices iv va pairs of vertices i set of set of set of ordered pairs. Vs planar can draw the edges w out crossing. Graph traversal vertex of a graph to accomplish visiting each some typically task seed source starting vertex is a. Only way to prove show one case where i or component. Sth is not a component is to vertex cannot get to another vertex. M path non empty sequence of distinct edges connected v vs length. Va vs end to end of edges l to have to match up. Connected componentdet t vi vj c component path between vi. Vj path with an vertices distinct redundant time vertex if repeat then repeat edge simp no repeated edges no repeated vertices.
