'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj
'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj
'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
V. <strong>Batagelj</strong>: <strong>Analysis</strong> and visulization of large networks with <strong>Pajek</strong> 60<br />
✬<br />
✫<br />
Connectivity<br />
Weak and strong connectivity are equivalence relations.<br />
Equivalence classes induce weak/strong components.<br />
Vertex u is reachable from vertex v iff<br />
there exists a walk with initial vertex v<br />
and terminal vertex u.<br />
Vertex v is weakly connected with vertex<br />
u iff there exists a semiwalk with v<br />
and u as its end-vertices.<br />
Vertex v is strongly connected with vertex<br />
u iff they are mutually reachable.<br />
Methodenforum der Fakultät für Sozialwissenschaften, Universität Wien, 21-22. 6. 2007 ▲<br />
❙ ▲<br />
▲<br />
▲<br />
● ❙ ▲<br />
▲<br />
☛ ✖<br />
✩<br />
✪