Gephi

gephi.org-gephi-layout-plugin-openord

German

Translate

Zen

Translation

Key OpenOrd.description

English

German

Needs editing

Sign in to save the translation.

Skip

	Key	English	German	Actions
	OpenOrd.name	OpenOrd	OpenOrd
	OpenOrd.description	Force-Directed layout algorithm for real-world large-scale undirected graphs. Can scale to over 1 million nodes, making it ideal for large graphs. However, small graphs (hundreds or less) do not always end up looking so good. This algorithm expects undirected weighted graphs and aims to better distinguish clusters.	Kräfte-basierter Layout-Algorithmus für große, ungerichtete Graphen. Skaliert für bis über 1 Million Knoten. Allerdings werden kleine Graphen (hundert oder weniger Knoten) nicht immer gut gelayoutet. Dieser Algorithmus setzt ungerichtete, gewichtete Graphen voraus und zielt darauf ab, Cluster besser unterscheiden zu können.
	OpenOrd.properties.edgecut.name	Edge Cut	Schnitt
	OpenOrd.properties.edgecut.description	0 means no cutting and 1 maximum cutting. A higher cutting means a more clustered result.	0 bedeutet keinen Schnitt
	OpenOrd.properties.numthreads.name	Num Threads	Anzahl Threads
	OpenOrd.properties.numthreads.description	The number of threads to use to run the algorithm. Increase this number for multi-core computers. It's recommended to put the number of core minus 1 to keep a thread for display.	Anzahl Threads um Algorithmus auszuführen. Erhöhen Sie die Zahl für Mehrkern-Prozessoren. Es wird empfohlen, die als Wert Anzahl Kerne - 1 zu wählen, um einen Thread für die Anzeige zu behalten.
	OpenOrd.properties.numiterations.name	Num Iterations	Anzahl der Iterationen

	Key	English	German	Actions
	OpenOrd.description	Force-Directed layout algorithm for real-world large-scale undirected graphs. Can scale to over 1 million nodes, making it ideal for large graphs. However, small graphs (hundreds or less) do not always end up looking so good. This algorithm expects undirected weighted graphs and aims to better distinguish clusters.	Kräfte-basierter Layout-Algorithmus für große, ungerichtete Graphen. Skaliert für bis über 1 Million Knoten. Allerdings werden kleine Graphen (hundert oder weniger Knoten) nicht immer gut gelayoutet. Dieser Algorithmus setzt ungerichtete, gewichtete Graphen voraus und zielt darauf ab, Cluster besser unterscheiden zu können.
	OpenOrd.name	OpenOrd	OpenOrd
	OpenOrd.properties.edgecut.description	0 means no cutting and 1 maximum cutting. A higher cutting means a more clustered result.	0 bedeutet keinen Schnitt
	OpenOrd.properties.edgecut.name	Edge Cut	Schnitt
	OpenOrd.properties.numiterations.description	Increase this number only for very large graphs. More iterations, more time it takes and less dense the result will be. Minimum is 100 iterations, and default is 750.	Erhöhen Sie diese Zahl nur für sehr große Graphen. Je höher die Anzahl Iterationen, um so länger die Dauer und um so weniger dicht das Resultat. Minimum sind 100 Iterationen, Standard sind 750.

Loading…

No matching activity found.

Browse all string changes

Things to check

Trailing space

Source and translation do not both end with a space

Mismatched full stop

Source and translation do not both end with a full stop

Glossary

English	German
directed		Gephi
directed		Gephi
in Graph theory: a graph in which the edges are a set of ordered paits of vertices
Directed		Gephi
in Graph theory: a graph in which the edges are a set of ordered pairs of vertices
undirected		Gephi
in Graph theory: a graph in which the edges are a set of unordered pairs of vertices

String information

Key

OpenOrd.description

String age

2 years ago

Last updated

a year ago

Source string age

2 years ago

Translation file

modules/LayoutPlugin/src/main/resources/org/gephi/layout/plugin/openord/Bundle_de.properties, string 2