| Topics |
- Graphs: (un-)directed, mixed, weighted, simple, complete, multi-, sub-, induced, conflict, bipartite, planar
- Isomorphism, degree, adjacency matrixes, adjacency lists, incidence matrixes
- Paths, cycles, connected components, cut, big O notation
- Shortest paths: breadth-first search, Dijkstra's algorithm, A*-algorithm
- Vertex coloring: chromatic number, greedy coloring, ColorFirst algorithm, breadth-first search
- Trees, Forests, rootet trees, binary trees, search trees, AVL trees, minimum spanning tree, Kruskal's algorithm
- Networks, flow networks, maximum flows, Ford-Fulkerson algorithm
- Matchings, eulerian tour/cycle, Fleury's algorithm, Hamiltonian paths/cycles, travelling salesman problem
- Graph transformation systems, graph grammars, graph homomorphisms, composition, examples: flowcharts, Turing machines
- Petri nets: place/transition nets, P/T nets with capacities, condition/event nets
|
