diff --git a/tr/incidence.md b/tr/incidence.md index 34a762f4f090b9fa79bdfbe06944124994496f72..b9e2a63dc9d4c34a77195f8b08e1f28bff795f2d 100644 --- a/tr/incidence.md +++ b/tr/incidence.md @@ -138,9 +138,9 @@ FooEdge includeFoobar(BarVertex bar, Valid return types: `EdgeFrame` -Yeni bir kenar oluşturur ve bunu yeni bir köşeye bağlar. The newly created vertex will have a type, as well as be initiated, according to the details specified in the first ClassInitializer argument. Similarly the newly created edge will hava a type, and be initiated, using the second ClassInitializer argument. Java generics can, and should, be used to narrow the return type. The returned object will be the newly created `EdgeFrame`. +Yeni bir kenar oluşturur ve bunu yeni bir köşeye bağlar. The newly created vertex will have a type, as well as be initiated, according to the details specified in the first ClassInitializer argument. Similarly the newly created edge will hava a type, and be initiated, using the second ClassInitializer argument. Java generics can, and should, be used to narrow the return type. Döndürülen nesne, yeni oluşturulan `EdgeFrame` olacaktır. -example: +örnek: ```java @Incidence("Foo") @@ -166,13 +166,13 @@ FooEdge includeFoobar(ClassInitializer<? extends BarVertex> vertexInitializer, ClassInitializer<? extends FooEdge> edgeInitializer); ``` -## GET Operation +## İŞLEM alma -Valid method signatures: `()`, `(Class)` +Geçerli yöntem imzaları: `()`, `(Class)` -Get's one or more adjacent edgesd from the graph. +Grafikten bir veya daha fazla bitişik kenarı alın. -### Signature: `( )` +### İmza: `( )` Valid return types: `VertexFrame` or `Iterator` or `List` or `Set` @@ -282,9 +282,9 @@ Set<FooEdge> getFoobar(Class<? extends FooEdge> filter); FooEdge obtainFoobar(Class<? extends FooEdge> filter); ``` -## REMOVE Operation +## İşlem KALDIRMA -Valid method signatures: `(EdgeFrame)` +Geçerli yöntem imzaları: `(EdgeFrame)` Removes an edges which cause an adjacency, leaving the vertex in place.