tech-interview-handbook/algorithms/graph.md

Graph
==

- Given a list of sorted words from an alien dictionary, find the order of the alphabet.
  - Alien Dictionary Topological Sort question.
- Find if a given string matches any path in a labeled graph. A path may contain cycles.
- Given a bipartite graph, separate the vertices into two sets.
- You are a thief trying to sneak across a rectangular 100 x 100m field. There are alarms placed on the fields and they each have a circular sensing radius which will trigger if anyone steps into it. Each alarm has its own radius. Determine if you can get from one end of the field to the other end.
- Given a graph and two nodes, determine if there exists a path between them.
- Determine if a cycle exists in the graph.
Squash commit 7 years ago			`Graph`
			`==`

			`- Given a list of sorted words from an alien dictionary, find the order of the alphabet.`
			`- Alien Dictionary Topological Sort question.`
			`- Find if a given string matches any path in a labeled graph. A path may contain cycles.`
			`- Given a bipartite graph, separate the vertices into two sets.`
Fix links for awesome bot (#4) 7 years ago			`- You are a thief trying to sneak across a rectangular 100 x 100m field. There are alarms placed on the fields and they each have a circular sensing radius which will trigger if anyone steps into it. Each alarm has its own radius. Determine if you can get from one end of the field to the other end.`
Squash commit 7 years ago			`- Given a graph and two nodes, determine if there exists a path between them.`
			`- Determine if a cycle exists in the graph.`