Getting started

• Prior Knowledge and Graphs
  • Manually creating a graph
  • Edge attributes
  • Importing graphs
  • Saving and reading
  • Hypergraphs
• Constrained Optimization
  • The Knapsack Problem
  • A more complex knapsack
• Multi-commodity Network Flows
• Acyclic Flows
  • Largest DAG from a given source and sink vertex
  • Largest DAG from any source to any sink