Skip to content

This repo contains utilities like DFS, BFS and connected components. Using them you can validate if there exists a path between vertices and find it too. You can also find shortest path between two vertices of graph using these classes.

License

Notifications You must be signed in to change notification settings

AayushyaVajpayee/Undirected-Graph-Utilities

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Undirected-Graph-Utilities

This project provides utilites pertaining to undirected Graphs. This project can be used as an API for storing graphs as adjacency Lists, computing paths between vertices or many other applications of Breadth First Search, Depth First Search and Connected Components which are provided in this project.

Built With

  • Java - The programming language used
  • Gradle - Build Tool

Authors

  • Aayushya Vajpayee

License

For License - see the LICENSE.md file for details

Acknowledgments

  • The concepts in the code have been majorly learnt from Robert Sedgewick (Instructor of the algorithms course of Princeton University on coursera)

About

This repo contains utilities like DFS, BFS and connected components. Using them you can validate if there exists a path between vertices and find it too. You can also find shortest path between two vertices of graph using these classes.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages