Orange: Network Generator - Revision history

Onnowpurbo at 04:57, 27 February 2020

2020-02-27T04:57:12Z

Onnowpurbo: /* Contoh */

2020-02-27T04:55:11Z

Contoh

Onnowpurbo: /* Contoh */

2020-02-27T04:54:48Z

Contoh

Onnowpurbo: /* Contoh */

2020-02-22T02:49:16Z

Contoh

Onnowpurbo: /* Contoh */

2020-02-22T02:45:20Z

Contoh

Onnowpurbo at 02:44, 22 February 2020

2020-02-22T02:44:34Z

Onnowpurbo at 05:10, 29 January 2020

2020-01-29T05:10:50Z

Onnowpurbo at 03:56, 25 January 2020

2020-01-25T03:56:22Z

Onnowpurbo: Created page with "Sumber: https://orange.biolab.si/widget-catalog/networks/networkgenerator/ Construct example graphs. Outputs Generated Network: An instance of Network Graph. Network..."

2020-01-20T01:45:02Z

Created page with "Sumber: https://orange.biolab.si/widget-catalog/networks/networkgenerator/ Construct example graphs. Outputs Generated Network: An instance of Network Graph. Network..."

New page

Sumber: https://orange.biolab.si/widget-catalog/networks/networkgenerator/

Construct example graphs.

Outputs

Generated Network: An instance of Network Graph.

Network Generator constructs exemplary networks. It is mostly intended for teaching/learning about networks.

Graph options:

Path: a graph that can be drawn so that all of its vertices and edges lie on a single straight line.
Cycle: a graph that consists of a single cycle, i.e. some number of vertices (at least 3) are connected in a closed chain.
Complete: simple undirected graph in which every pair of distinct vertices is connected by a unique edge.
Complete bipartite: a graph whose vertices can be divided into two disjoint and independent sets.
Barbell: two complete graphs connected by a path.
Ladder: planar undirected graph with 2n vertices and 3n-2 edges.
Circular ladder: Cartesian product of two path graphs.
Grid: a graph whose drawing, embedded in some Euclidean space, forms a regular tiling.
Hypercube: a graph formed from the vertices and edges of an n-dimensional hypercube.
Star: Return the Star graph with n+1 nodes: one center node, connected to n outer nodes.
Lollipop: a complete graph (clique) and a path graph, connected with a bridge.
Geometric: an undirected graph constructed by randomly placing N nodes in some metric space.

Press Regenerate Network to output a new graph instance.
Example

Network Generator is a nice tool to explore typical graph structures.

Here, we generated a Grid graph of height 4 and width 5 and sent it to Network Analysis. We computed node degrees and sent the data to Network Explorer. Finally, we observed the generated graph in the visualization and set the size and color of the nodes to Degree. This is a nice tool to observe and explain the properties of networks.

==Referensi==

* https://orange.biolab.si/widget-catalog/networks/networkgenerator/

==Pranala Menarik==

* [[Orange]]

← Older revision		Revision as of 04:57, 27 February 2020
Line 2:		Line 2:


−	Membuat contoh graph.	+	Membuat contoh network graph.

	==Output==		==Output==

@@ Line 35: / Line 35: @@
 [[File:Network-generator-example.png|center|200px|thumb]]
-Di sini, kita membuat graph Grid dengan tinggi 4 dan lebar 5 dan mengirimkannya ke Network Analysis. Kita menghitung derajat simpul dan mengirim data ke Network Explorer. Akhirnya, kita mengamati graph yang dihasilkan dalam visualisasi dan mengatur ukuran dan warna node ke Degree. Ini adalah tool yang bagus untuk mengamati dan menjelaskan sifat-sifat jaringan.
+Di sini, kita membuat graph Grid dengan tinggi 4 dan lebar 5 dan mengirimkannya ke Network Analysis. Kita menghitung derajat simpul dan mengirim data ke Network Explorer. Akhirnya, kita mengamati graph yang dihasilkan dalam visualisasi dan mengatur ukuran dan warna node ke Degree. Ini adalah tool yang baik untuk mengamati dan menjelaskan sifat-sifat jaringan.
 ==Referensi==

@@ Line 31: / Line 31: @@
 ==Contoh==
-Network Generator adalah tool yang baik untuk mengexploraso struktur graph.
+Network Generator adalah tool yang baik untuk mengexplorasi struktur graph.
 [[File:Network-generator-example.png|center|200px|thumb]]

@@ Line 35: / Line 35: @@
 [[File:Network-generator-example.png|center|200px|thumb]]
-Here, we generated a Grid graph of height 4 and width 5 and sent it to Network Analysis. We computed node degrees and sent the data to Network Explorer. Finally, we observed the generated graph in the visualization and set the size and color of the nodes to Degree. This is a nice tool to observe and explain the properties of networks.
+Di sini, kita membuat graph Grid dengan tinggi 4 dan lebar 5 dan mengirimkannya ke Network Analysis. Kita menghitung derajat simpul dan mengirim data ke Network Explorer. Akhirnya, kita mengamati graph yang dihasilkan dalam visualisasi dan mengatur ukuran dan warna node ke Degree. Ini adalah tool yang bagus untuk mengamati dan menjelaskan sifat-sifat jaringan.
 ==Referensi==

@@ Line 31: / Line 31: @@
 ==Contoh==
-Network Generator is a nice tool to explore typical graph structures.
+Network Generator adalah tool yang baik untuk mengexploraso struktur graph.
 [[File:Network-generator-example.png|center|200px|thumb]]
 Here, we generated a Grid graph of height 4 and width 5 and sent it to Network Analysis. We computed node degrees and sent the data to Network Explorer. Finally, we observed the generated graph in the visualization and set the size and color of the nodes to Degree. This is a nice tool to observe and explain the properties of networks.
 ==Referensi==

@@ Line 2: / Line 2: @@
-Construct example graphs.
+Membuat contoh graph.
 ==Output==
@@ Line 8: / Line 8: @@
   Generated Network: An instance of Network Graph.
-Network Generator constructs exemplary networks. It is mostly intended for teaching/learning about networks.
+Network Generator membangun network contoh. Ini dimaksudkan untuk pengajaran / pembelajaran tentang network.
 [[File:Network-generator.png|center|200px|thumb]]
-Graph options:
+Graph option:
   Path: a graph that can be drawn so that all of its vertices and edges lie on a single straight line.
@@ Line 27: / Line 27: @@
   Geometric: an undirected graph constructed by randomly placing N nodes in some metric space.
-Press Regenerate Network to output a new graph instance.
+Press Regenerate Network untuk mengeluarkan graph instance yang baru.
 ==Contoh==

@@ Line 4: / Line 4: @@
 Construct example graphs.
-Outputs
+==Output==
-    Generated Network: An instance of Network Graph.
+ Generated Network: An instance of Network Graph.
 Network Generator constructs exemplary networks. It is mostly intended for teaching/learning about networks.
@@ Line 14: / Line 14: @@
 Graph options:
-    Path: a graph that can be drawn so that all of its vertices and edges lie on a single straight line.
+ Path: a graph that can be drawn so that all of its vertices and edges lie on a single straight line.
-    Cycle: a graph that consists of a single cycle, i.e. some number of vertices (at least 3) are connected in a closed chain.
+ Cycle: a graph that consists of a single cycle, i.e. some number of vertices (at least 3) are connected in a closed chain.
-    Complete: simple undirected graph in which every pair of distinct vertices is connected by a unique edge.
+ Complete: simple undirected graph in which every pair of distinct vertices is connected by a unique edge.
-    Complete bipartite: a graph whose vertices can be divided into two disjoint and independent sets.
+ Complete bipartite: a graph whose vertices can be divided into two disjoint and independent sets.
-    Barbell: two complete graphs connected by a path.
+ Barbell: two complete graphs connected by a path.
-    Ladder: planar undirected graph with 2n vertices and 3n-2 edges.
+ Ladder: planar undirected graph with 2n vertices and 3n-2 edges.
-    Circular ladder: Cartesian product of two path graphs.
+ Circular ladder: Cartesian product of two path graphs.
-    Grid: a graph whose drawing, embedded in some Euclidean space, forms a regular tiling.
+ Grid: a graph whose drawing, embedded in some Euclidean space, forms a regular tiling.
-    Hypercube: a graph formed from the vertices and edges of an n-dimensional hypercube.
+ Hypercube: a graph formed from the vertices and edges of an n-dimensional hypercube.
-    Star: Return the Star graph with n+1 nodes: one center node, connected to n outer nodes.
+ Star: Return the Star graph with n+1 nodes: one center node, connected to n outer nodes.
-    Lollipop: a complete graph (clique) and a path graph, connected with a bridge.
+ Lollipop: a complete graph (clique) and a path graph, connected with a bridge.
-    Geometric: an undirected graph constructed by randomly placing N nodes in some metric space.
+ Geometric: an undirected graph constructed by randomly placing N nodes in some metric space.
 Press Regenerate Network to output a new graph instance.