answersLogoWhite

0

DFS and BFS are both searching algorithms.

DFS, or depth first search, is a simple to implement algorithm, especially when written recursively.

BFS, or breadth first search, is only slightly more complicated.

Both search methods can be used to obtain a spanning tree of the graph, though if I recall correctly, BFS can also be used in a weighted graph to generate a minimum cost spanning tree.

User Avatar

Wiki User

17y ago

Still curious? Ask our experts.

Chat with our AI personalities

EzraEzra
Faith is not about having all the answers, but learning to ask the right questions.
Chat with Ezra
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
JudyJudy
Simplicity is my specialty.
Chat with Judy

Add your answer:

Earn +20 pts
Q: Why you use DFS and BFS in graphs?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Games

Who is faster between dfs and bfs?

dfs better then from bfs..


Why is dfs better then from bfs?

It isn't necessarily better... They each have their own pros and cons


What is the difference between BFS and DFS?

BFS: This can be throught of as being like Dijkstra's algorithm for shortest paths, but with every edge having the same length. However it is a lot simpler and doesn't need any data structures. We just keep a tree (the breadth first search tree), a list of nodes to be added to the tree, and markings (Boolean variables) on the vertices to tell whether they are in the tree or list. Depth first search is another way of traversing graphs, which is closely related to preorder traversal of a tree. Recall that preorder traversal simply visits each node before its children. It is most easy to program as a recursive routine:


Difference between domain DFS and stand alone DFS in windows 2k?

Stand-alone DFS Namespace In a stand-alone DFS namespace, the path to access the root or a link starts with the root server name. The stand-alone DFS root can comprise of a single root target. Therefore, these are not fault tolerant. When the root target is not available, you cannot access the complete DFS namespace. You can enable fault tolerance on a stand-alone DFS namespace by creating these namespaces on a cluster of servers. A stand-alone DFS namespace has its configuration information stored in the local registry of eth root server. Domain-based DFS Namespace In a domain-based DFS namespace, the path to access the root or a link starts with the domain name of the host. The domain-based DFS root can comprise of single or multiple root targets that enables fault tolerance and load sharing. A domain-based DFS namespace has its configuration information stored in the Active Directory. Exemple : • \\DomainName\RootName: This is the format of the namespace when you select the Domain-based DFS namespace type. • \\ServerName\RootName: This is the format of the namespace when you select the Stand-alone DFS namespace type.


How many words can you make from dfs associate appreciation day?

How many words can you make from dfs associate appreciation day?