Sentence examples for be an undirected graph from inspiring English sources

Let G be an undirected graph with nonnegative edge lengths.

Let G be an undirected graph with two edge costs (c-cost and d-cost).

Let G= V,E) be an undirected graph with costs on the edges specified by w :E↦R+.

Let G= V,E,w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r.

Let G= V,E,w) be an undirected graph with positive edge lengths and S⊂V a set of k specified sources.

Let G="(V,E) be an undirected graph with vertex set V and edge set E. The open neighborhood N e) of an edge e∈E is the set of all edges adjacent to e.

An undirected rooted tree T = (V,E) is an undirected graph which has exactly one vertex r∈V for which every edge is directed away from the root r.

Assume that G="(V,E) is an undirected graph, and C⊆V.

A network is an undirected graph G, where the edges in the graph correspond to the components in the system.

Chord is an undirected graph on $2^b $nodes arranged in a circle, with edges connecting pairs of nodes that are $2^k $positions apart for any $k \geq 0$.

A double-loop network is an undirected graph whose nodes are integers 0,1,…,n−1 and each node u is adjacent to four nodes u±h1(mod>n), u±h2(mod>n), where 0