Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options answers only user 96774

Questions about properties of and problems on graphs, discrete data structures that have the form of nodes connected by edges, that is networks.

2
votes
You can do one graph traversal to find all the connected components of your graph. Then add an edge from each connected component to the next : the graph is fully connected and you did only one trave …
answered Aug 16 by GBat
4
votes
A result about BFS is that what you call the depth of the BFS of a node $v$ is the length of a shortest path from the source to $v$. Assume the exists an instance where the depth of the DFS $<$ BFS. …
answered Jul 10 by GBat