Paths in network, degree of vertices
 Definitions of paths in graph
 walk, chain and path
 closed walk, cycle, closed chain, loop
 length and value of path
 the shortest path, diameter
 kneighbor
 depth of vertex in acyclic graph
 Degree of vertex
 input degree
 output degree
 all degree
 Paths and degrees in Pajek
Examples
 Find degrees, shortest paths, paths with the lowest value and distances
from selected vertex.
 Find depths in acyclic networks.
Assignment
 Find diameter, draw the longest shortest path.
Find out if there exist any loops in the network.
Is the network acyclic
(in this case find depths of vertices)?
Determine input, output and all degrees of vertices.
Present results in one table  you can use Tools / Excel / Send to Excel / All Partitions.
Find distances from the vertex with the highest output degree.
Find the shortest path between two vertices with the lowest all degrees (if the shortest path exists).
 Interpretation of all results.
Slides Pajek 2.05 (PDF)
Slides  the latest version of Pajek (PDF)
