CSE 2321 Lecture Notes - Lecture 33: Adjacency Matrix

10 views6 pages
Published on 30 Nov 2019
Course
Professor
iRE 33
Directed Graphs
Path in adigraph
asequence of distinct verticies
Such that there exists adirected edge
from each vertex to the next vertex
on the page i
abC
abcde
cannot getfrom atoe
weaklyconnected replacing all directed
wundirected edges produces aconnected
undirected graph
in vun v
IIII
xyxy
weaklyconnected This undirected
graph
is connected
Unlock document

This preview shows pages 1-2 of the document.
Unlock all 6 pages and 3 million more documents.

Already have an account? Log in
Strongly Connected every 2vertices
are teachable from each other
ugh
Vyou can go from atoy
ytou Vto X
There is adirect path
xcyFom every vertex to another
C
ALSO weakly connected
The whole graphshould only have 7
SCC
StronglyConnectedComponents SCC
Gof adigraph Gis amaximal
strongly connected subgraph of G
Ex
II
mvYl
fIiiff i
lll
lLlllsCC
X2I
IImmopnognthfonnectedi Subgraph
subgraph
Unlock document

This preview shows pages 1-2 of the document.
Unlock all 6 pages and 3 million more documents.

Already have an account? Log in

Get OneClass Notes+

Unlimited access to class notes and textbook notes.

YearlyBest Value
75% OFF
$8 USD/m
Monthly
$30 USD/m
You will be charged $96 USD upfront and auto renewed at the end of each cycle. You may cancel anytime under Payment Settings. For more information, see our Terms and Privacy.
Payments are encrypted using 256-bit SSL. Powered by Stripe.