This is an umbrella issue for various algorithms that might or should be implemented mid- to long-term.

Clustering

• Transitivity

Connectivity

• Is connected
• Strongly connected components
• Weakly connected components
• Condensation

Cycles

• Simple cycles (Add SimpleCycles function #39)
• Creates cycle

DAGs

• Topological sort
• Transitive reduction
• Transitive closure

Eulerian

• Eulerian circuit
• Eulerian path

Paths

• Dijkstra
• A*
• All simple paths between two vertices

Traversal

• DFS
• BFS
• DFS tree
• BFS tree

Trees

• Minimum spanning tree
• Maximum spanning tree

Isomorphism & Comparisons

• Tree isomorphism
• Graph isomorphism (Add graph isomorphism computation #47)
• Equals

Sets

• Union-find

These algorithms along with their tests should live in a file named after their category, e.g. DFS is located in traversal.go and tested in traversal_test.go. They should accept a Graph[K comparable, T any] instance and vertex values (T) or vertex hashes (K) where appropriate.