English term
Germany
loop-free directed graph structures
| 4 +1 | gerichteter azyklischer Graph |
muttersprachler
|
| 4 | see explanation |
Ken Cox
|
Apr 29, 2005 08:12: Ken Cox changed "Language pair" from "German to English" to "English to German"
PRO (1): ------ (X)
When entering new questions, KudoZ askers are given an opportunity* to classify the difficulty of their questions as 'easy' or 'pro'. If you feel a question marked 'easy' should actually be marked 'pro', and if you have earned more than 20 KudoZ points, you can click the "Vote PRO" button to recommend that change.
How to tell the difference between "easy" and "pro" questions:
An easy question is one that any bilingual person would be able to answer correctly. (Or in the case of monolingual questions, an easy question is one that any native speaker of the language would be able to answer correctly.)
A pro question is anything else... in other words, any question that requires knowledge or skills that are specialized (even slightly).
Another way to think of the difficulty levels is this: an easy question is one that deals with everyday conversation. A pro question is anything else.
When deciding between easy and pro, err on the side of pro. Most questions will be pro.
* Note: non-member askers are not given the option of entering 'pro' questions; the only way for their questions to be classified as 'pro' is for a ProZ.com member or members to re-classify it.
Proposed translations
gerichteter azyklischer Graph
Alternativ für azyklisch: maschenfrei, schleifenlos
| agree |
VerenaH (X)
: actually "azyklischer gerichteter Graph", und die Struktur muss noch rein irgendwie :-) http://de.wikipedia.org/wiki/Gerichteter_Graph
7 hrs
|
see explanation
'Loop-free' means there are no paths throug the graph structure that allow one to return back to a node that has already been visited (i.e., there are no closed paths).
--------------------------------------------------
Note added at 31 mins (2005-04-29 07:45:10 GMT)
--------------------------------------------------
A directed graph structure can also be used to define or represent a processing system (as in your example). In that case each of the nodes would represent some sort of processing operation, and the directed graph structure would define/represent the sequence of operations performed on the data.
Discussion