<span class="searchmatch">undirected</span> <span class="searchmatch">path</span> (plural <span class="searchmatch">undirected</span> <span class="searchmatch">paths</span>) (graph theory) In a directed graph, a <span class="searchmatch">path</span> in which the edges are not all oriented in the same direction. A path...
<span class="searchmatch">undirected</span> <span class="searchmatch">paths</span> plural of <span class="searchmatch">undirected</span> <span class="searchmatch">path</span>...
paint on the jar close to the rim, and allowed it to trickle <span class="searchmatch">undirected</span> down the sides <span class="searchmatch">undirected</span> graph <span class="searchmatch">undirected</span> <span class="searchmatch">path</span> reinducted, uncredited, undercited...
(graph theory) In a directed graph, a path in which the edges are all oriented in the same direction. A path x→y→z is a directed <span class="searchmatch">path</span>. <span class="searchmatch">undirected</span> <span class="searchmatch">path</span>...
with at most one <span class="searchmatch">undirected</span> <span class="searchmatch">path</span> between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no <span class="searchmatch">undirected</span> cycles either...
right-handed <span class="searchmatch">path</span> right-hand <span class="searchmatch">path</span> sample <span class="searchmatch">path</span> shared use <span class="searchmatch">path</span> speech <span class="searchmatch">path</span> spirit <span class="searchmatch">path</span> subpath swept <span class="searchmatch">path</span> tool <span class="searchmatch">path</span> towing <span class="searchmatch">path</span> <span class="searchmatch">undirected</span> <span class="searchmatch">path</span> zombie <span class="searchmatch">path</span> bridle-path...
calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic <span class="searchmatch">paths</span>) between nodes in unweighted <span class="searchmatch">undirected</span> networks....
characterization of the connectivity in finite <span class="searchmatch">undirected</span> graphs in terms of the minimum number of disjoint <span class="searchmatch">paths</span> that can be found between any pair of vertices...
weighted <span class="searchmatch">undirected</span> graph connecting a set of geometric points with the property that, for every pair of points in the graph, their shortest <span class="searchmatch">path</span> has a length...
directed graph. (set theory) Having the properties of a directed set. <span class="searchmatch">undirected</span> antidirected bidirected child-directed speech digraph digraphoid directed...