Programming GRAPHS in C with GNO

https://www.geeksforgeeks.org/cc-programs/

Here is a list of programs in C about graphs, trees, lists, stacks and queues.

GNO cannot layout graphics so you may ask yourself :
"what programs can I do with GNO ?".

Here is a list of C programs in TEXT MODE.

Depth first traversal for a graph
Breadth first traversal for a graph
Detect cycle in a directed graph
Find if there is a path between two vertices in a directed graph
Hamiltonian cycle detection
Dynamic programming (Floyd Warshall algorithm)
Find the number of islands
Union find algorithm (Set 1 Detect cycle in an undirected graph)
Union find algorithm (Set 2 Union by rank and path compression)
Greedy algorithms (Set 2 Kruskal's minimum spanning tree algorithm)
Graph and its representations
Greedy algorithms (Set 5 Prim's minimum spanning tree (MST))
Greedy algorithms (Set 6 Prim's MST for adjacency list representation)
Greedy algorithms (Set 7 Dijkstra's shortest path algorithm)
Greedy algorithms (Set 8 Dijkstra's algorithm for adjacency list representation)
Dynamic programming (Set 23 Bellman-Ford algorithm)
Transitive closure of a graph
Check wether a given graph is bipartite or not
Topological sorting
Shortest path in directed acyclic graph
Strongly connected components
Articulation points (or cut vertices) in a graph
Bridges in a graph
Biconnected graph
Connectivity in a directed graph
Eulerian path and circuit
Ford-Fulherson algorithm for maximum flow problem
Maximum bipartite matching
Find minimum s-t cut in a flow network
Fleury's algorithm for printing eulerian path or circuit
Longest path in a directed acyclic graph
Find maximum number of edge disjoint paths between two vertices
Detect cycle in an undirected graph
Travelling salesman problem (Set 1 naive and dynamic programming)
Travelling salesman problem (Set 2 approximate using MST)
Johnson's algorithm for all pairs shortest paths
Graph coloring (Set 1 Introduction ans applications)
Graph coloring (Set 2 Greedy algorithms)
Some interesting shortest path questions
Reverse alternate levels of a perfect binary tree
Transform a BST to greater sum tree