# graph-algorithm (59)

- Find groups of articulation points
- Finding nearest neighbours of a triangular tesellation
- Connect nodes to maximize total edge weight
- Find the shortest fence that encloses an area on a 2D grid
- Calculating the shortest route between two points
- Travelling salesman with a directional constraint
- How to keep track of depth in breadth first search?
- Pseudo-code for Network-only-bayes-classifier
- Efficiently build a graph of words with given Hamming distance
- How to find if a graph is bipartite?
- Grouping numbers based on occurrences?
- A* Algorithm for very large graphs, any thoughts on caching shortcuts?
- Edge classification during Breadth-first search on a directed graph
- Check if the given string follows the given pattern
- Why can't Prim's or Kruskal's algorithms be used on a directed graph?
- Why is depth-first search claimed to be space efficient?
- 'Stable' multi-dimensional scaling algorithm
- Find nearest edge in graph
- Why are back edges required in the Ford-Fulkerson algorithm?
- Finding Contiguous Areas of Bits in 2D Bit Array