英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

undirected    
a. 未受指导的,无收件人姓名的

未受指导的,无收件人姓名的

undirected
无向

undirected
adj 1: aimlessly drifting [synonym: {adrift(p)}, {afloat(p)},
{aimless}, {directionless}, {planless}, {rudderless},
{undirected}]

Undirected \Un`di*rect"ed\, a. [In senses 1 and 2, pref. un- not
directed; in sense 3 properly p. p. of undirect.]
1. Not directed; not guided; left without direction.
[1913 Webster]

2. Not addressed; not superscribed, as a letter.
[1913 Webster]

3. Misdirected; misled; led astray. [R.]
[1913 Webster]

94 Moby Thesaurus words for "undirected":
aberrant, aberrative, aimless, amorphous, capricious, casual,
causeless, circuitous, departing, designless, desultory, deviant,
deviating, deviative, deviatory, devious, digressive,
disarticulated, discontinuous, discursive, disjunct, disordered,
dispersed, disproportionate, driftless, dysteleological, errant,
erratic, excursive, fitful, formless, frivolous, gratuitous,
haphazard, hit-or-miss, immethodical, inchoate, incoherent,
indirect, indiscriminate, inexplicable, irregular, labyrinthine,
mazy, meandering, meaningless, mindless, misshapen, nonsymmetrical,
nonsystematic, nonuniform, orderless, out-of-the-way, planetary,
planless, promiscuous, purposeless, rambling, random, roving,
senseless, serpentine, shapeless, shifting, snaky, spasmodic,
sporadic, stochastic, straggling, straggly, stray, swerving,
systemless, turning, twisting, unaccountable, unarranged,
unclassified, ungraded, unjoined, unmethodical, unmotivated,
unordered, unorganized, unsorted, unsymmetrical, unsystematic,
ununiform, vagrant, vague, veering, wandering, winding, zigzag


请选择你想看的字典辞典：
单词字典翻译
undirected查看　undirected　在百度字典中的解释百度英翻中〔查看〕
undirected查看　undirected　在Google字典中的解释Google英翻中〔查看〕
undirected查看　undirected　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • vertices - Undirected connected graphs - Stack Overflow
    I'm confused as to whether an undirected graph can be considered connected? For example: A---B---C Say that we have three vertices, A, B and C If the graph is undirected like the one above, is it connected? A reaches B, but does it reach C? Another example: A--->B<---C Am I correct to say this directed graph is not connected because A cannot
  • Is Dijkstras algorithm for directed or undirected graphs?
    Yes Dijkstra work for both directed undirected graph but all edge weight should be +ve Because if any weight is -ve, then it may fail to give the correct answer It works on undirected graph because in Dijkstra, we should always seen that minimum edge weight From its source vertex
  • Are Trees Directed or Undirected Graphs? - Stack Overflow
    @VinothKumar The Wikipedia page describes trees in the context of graph theory, where a tree is indeed an special case of an undirected graph In the context of programming however, what we call trees are most of the time rooted trees with an implied direction from root to leaves
  • What is the difference between a directed and undirected graph
    In undirected graph 2-3 means the edge has no direction, i e 2-3 means you can go both from 2 to 3 and 3 to 2 Note that in the representation of your graph, if you are using an adjacency matrix, directed 2->3 means adj[2][3]=true but adj[3][2]=false
  • discrete mathematics - Can an undirected graph strongly connected . . .
    For an undirected graph, we simply say that it is connected when there is a path between any two vertices There are then (at least) two ways to generalize this notion to directed graphs: Weakly connected if there is an undirected path between any two vertices, not necessarily respecting the orientations on the edges
  • algorithm - Cycles in an Undirected Graph - Stack Overflow
    An undirected graph is acyclic (i e , a forest) if a DFS yields no back edges Since back edges are those edges (u, v) connecting a vertex u to an ancestor v in a depth-first tree, so no back edges means there are only tree edges, so there is no cycle So we can simply run DFS If find a back edge, there is a cycle
  • What is a good data structure to represent an undirected graph?
    Using them in an undirected fashion involves trade offs (space verses speed) this course material goes into more detail on the adjacency list style and provides some thoughts on the possible alterations for use in undirected usage
  • Graphviz Dot, mix directed and undirected - Stack Overflow
    For my application I need to represent simultaneously (on the same graph) two relations: one is simmetric, the other is not Targets: Ideally the two relation should result in edges having different
  • Finding length of shortest cycle in undirected graph
    I tried the following : 1) DFS, keeping track of level of each vertex in my DFS tree 2) Each time a back edge (x,y) is seen, I calculate cycle length = level[x] - level[y] + 1, and save it if it is
  • Topological sort on directed and undirected graphs using DFS algorithm
    For undirected graphs, the concept just doesn’t apply — there’s no direction, so no “ordering” between nodes But, you still can apply the idea of Topological Sort, to detect a cycle (ignoring backward link to the parent) like on the image below





中文字典-英文字典  2005-2009