Questions tagged [dynamic-graphs]

Consider a sequence of vertex and edge additions and removals to an initially empty (undirected, simple) graph. Is it possible to update the ordered list of vertex degrees in constant time (and space), for each addition or removal? How? Is it easier…

Let $G = (V, E)$ be a graph with edge weights $w: E \rightarrow \mathbb{R} \cup \{\infty\}$. Let $P := \{(a_i, b_i, w_i)\}$ be a set of tuples of nodes $a_i, b_i \in V$ with shortest distance $w_i$ from $a_i$ to $b_i$. We want to update the weights…

I have a few constraints in my path finding application for source to destination routing on a map: Server has a huge map and Client can only query a small chunk of it at a time because of data transfer and server processing time limits. Full map…

In static routing where the network parameters dont change, we can use Djikstra's or Bellman-Ford's algorithm to find the shortest path to send data from source to destination.However in dynamic routing how do we do that?