# Java Programming Examples on Graph Problems & Algorithms

This section covers Java Programming Examples on Graph Problems & Algorithms. Every example program includes the description of the program, Java code as well as output of the program. Here is the listing of Java programming examples:

**1. Java Programming examples on “Connected Components”**

**2. Java Programming examples on “Topological Sorting”**

**3. Java Programming examples on “Minimum Spanning Tree”**

Java Program to Apply the Prim’s Algorithm to Find the Minimum Spanning Tree of a Graph Java Program to Apply the Kruskal’s Algorithm to Find the Minimum Spanning Tree of a Graph Java Program to Use Boruvka’s Algorithm to Find the Minimum Spanning Tree Java Program to Create a MST of a Set of Points Spread in Two Dimensions Using Delaunay Triangulation Java Program to Give an Efficient Algorithm to Compute the Second-Best Minimum Spanning Tree of G |

**4. Java Programming examples on “Shortest Path”**

**5. Java Programming examples on “Transitive Closure and Reduction”**

Java Program to Find the Transitive Closure of a Given Graph G Java Program to Construct Transitive Closure Using Warshall’s Algorithm Java Program to Find Transpose of a Graph Matrix |

**6. Java Programming examples on “Matching”**

Java Program to Solve a Matching Problem for a Given Specific Case Java Program to Rearrange Letters of a String such that no More than 1 Letters should Retain the Same Position Java Program to Solve a Matching Problem for a Given Specific Case Java Program to Implement the Hungarian Algorithm for Bipartite Matching Java Program to Implement the Edmond’s Algorithm for Maximum Cardinality Matching Java Program to Solve a Matching Problem for a Given Specific Case Java Program to Implement Hopcroft Algorithm |

**7. Java Programming examples on “Eulerian Cycle/Chinese Postman”**

**8. Java Programming examples on “Edge and Vertex Connectivity”**

**9. Java Programming examples on “Drawing Trees”**

**10. Java Programming examples on “Planarity Detection and Embedding”**

Java Program to Check Whether a Graph is Planar or Not Java Program to Implement the Hopcroft and Tarjan Algorithm Java Program to Implement the Booth and Lueker Algorithm to Check for Planarity |

**11. Java Programming examples on “Graph Search”**

**12. Java Programming examples on “Others”**

If you want to learn implementations of all algorithms and programs in Java,

**Here’s the list of 1000 Java Algorithms, Problems & Programming Examples.**