Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Updated README.md and added some description #5886

Merged
merged 3 commits into from
Oct 26, 2024

Conversation

dynoayush
Copy link
Contributor

Added Graph Terminologies: Introduced additional key graph concepts.
Expanded Graph Algorithms Section: Included popular algorithms like BFS, DFS, Dijkstra's, Prim's, and Bellman-Ford to provide practical use cases.
Detailed Graph Types: Added more details on types of graphs.
Included Real-World Applications: Enhanced the applications section with real-life use cases like Google Maps, job scheduling, and web crawling to connect theory to practice.
Complexity Comparison: Added time and space complexity analysis for better performance insight.
Graph Problems : Included common graph-based problems like graph coloring to illustrate practical problem-solving approaches.

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

Added Graph Terminologies: Introduced additional key graph concepts.
Expanded Graph Algorithms Section: Included popular algorithms like BFS, DFS, Dijkstra's, Prim's, and Bellman-Ford to provide practical use cases.
Detailed Graph Types: Added more details on types of graphs.
Included Real-World Applications: Enhanced the applications section with real-life use cases like Google Maps, job scheduling, and web crawling to connect theory to practice.
Complexity Comparison: Added time and space complexity analysis for better performance insight.
Graph Problems & Solutions: Included common graph-based problems like graph coloring to illustrate practical problem-solving approaches.
@codecov-commenter
Copy link

codecov-commenter commented Oct 17, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 72.31%. Comparing base (8b60485) to head (5f4be17).

Additional details and impacted files
@@             Coverage Diff              @@
##             master    #5886      +/-   ##
============================================
+ Coverage     72.30%   72.31%   +0.01%     
  Complexity     4959     4959              
============================================
  Files           650      650              
  Lines         17552    17552              
  Branches       3384     3384              
============================================
+ Hits          12691    12693       +2     
+ Misses         4383     4382       -1     
+ Partials        478      477       -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@dynoayush
Copy link
Contributor Author

I have updated the Readme file and added some more details about Graphs

@siriak siriak enabled auto-merge (squash) October 26, 2024 09:52
@siriak siriak merged commit 84522ba into TheAlgorithms:master Oct 26, 2024
6 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants