Distance Query On Graph

Правка en2, от Erickde, 2022-03-05 23:32:20

There is a way to find the diameter of an undirected connected graph if I am removing some nodes from the graph?

I know I can run BFS every time I remove a node, but can I do better?

Теги diameter, graphs, graph, bfs, query

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Erickde 2022-03-05 23:32:51 8 Tiny change: 'There is a way to ' -> 'Is there a way to '
en2 Английский Erickde 2022-03-05 23:32:20 54 Tiny change: 'I was solving this problem., and I was wondering if there is a ' -> 'There is a '
en1 Английский Erickde 2022-03-05 23:31:33 260 Initial revision (published)