• Algorithms on Graphs.
  • BFS/DFS
  • Connectivity - directed & undirected
  • Edge weighted graphs
  • Shortest Path algorithms - Single source
  • All pairs shortest paths
  • Diameter
  • Centrality
• Introduction to special classes of graphs
  • Bipartite graphs
  • Planar graphs
• Demonstration of a few algorithms above in networkX
• Examples in NetworkX on real networks (social, brain)
• Preferential attachment
• Small-world networks
• Activities
  • Generating and characterizing several graphs (both synthetic and real)
  • Counting triangles
  • Visualization using GraphViz