Skip to content
CodeMarvels
All's the Code !
  • Home
  • Privacy Policy
  • About

Tag: dfs

Algorithms

Path Finding

Posted on August 30, 2013 by saurabh / 0 Comment

Given an undirected,unweighted graph and two vertices u and v,the task is to find the path between these two vertices.u can be considered as the source vertex a...

Algorithms

Longest path in a tree

Posted on August 26, 2013 by saurabh / 0 Comment

Given an unweighted and undirected tree,the task is to find the length of the longest path (from one node to another) in that tree.The length of a path in this ...

Algorithms

Applications of DFS

Posted on August 26, 2013 by saurabh / 0 Comment

One of the applications of DFS is to find the number of connected components in a graph.In graph theory, a connected component of an undirected graph is a sub-g...

Categories

  • Algorithms
  • Android Development
  • BoshServlet
  • C++ projects
  • Code Philosophies
  • Conversational AI
  • Machine Learning
  • Miscellaneous
  • Notes
  • Society
  • Technology
  • Tutorial / Run-book
  • Uncategorized

Recent Posts

  • SSH without running .bashrc
  • Migrate data from one Cassandra server to another using medusa
  • A JS assistant to remind us to exercise during WFH days
  • Flush DNS cache in Ubuntu 20.xx and above
  • Change the datacenter set in cassandra-rackdc on Ubuntu

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
© 2022 CodeMarvels
Powered by WordPress | Theme: Graphy by Themegraphy