Transcription of Basic Graph Algorithms - Stanford University
{{id}} {{{paragraph}}}
Example: stock market
Basic Graph Algorithms - Stanford University
Basic Graph AlgorithmsJaehyun ParkCS 97 SIStanford UniversityJune 29, 2015 OutlineGraphsAdjacency Matrix and Adjacency ListSpecial GraphsDepth-First and Breadth-First SearchTopological SortEulerian CircuitMinimum Spanning Tree (MST)Strongly Connected Components (SCC)Graphs2 Graphs An abstract way of representing connectivity using nodes (alsocalled vertices) and edges We will label the nodes from1ton medges connect some pairs of nodes Edges can be either one-directional (directed) or bidirectional Nodes and edges can have some auxiliary informationGraphs3 Why Study Graphs? Lots of problems formulated and solved in terms of graphs Shortest path problems Network flow problems Matching problems 2-SAT problem Graph coloring problem Traveling Salesman Problem (TSP):still unsolved!
Basic Graph Algorithms Jaehyun Park CS 97SI Stanford University June 29, 2015. Outline Graphs ... Graphs 4. Outline Graphs Adjacency Matrix and Adjacency List Special Graphs ... Bipartite Graph: Nodes can be separated into two groups …
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: