Difference between revisions of "Orange: Network Generator"
Jump to navigation
Jump to search
Onnowpurbo (talk | contribs) |
Onnowpurbo (talk | contribs) |
||
| Line 2: | Line 2: | ||
| − | + | Membuat contoh graph. | |
==Output== | ==Output== | ||
| Line 8: | Line 8: | ||
Generated Network: An instance of Network Graph. | Generated Network: An instance of Network Graph. | ||
| − | Network Generator | + | Network Generator membangun network contoh. Ini dimaksudkan untuk pengajaran / pembelajaran tentang network. |
[[File:Network-generator.png|center|200px|thumb]] | [[File:Network-generator.png|center|200px|thumb]] | ||
| − | Graph | + | Graph option: |
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. | ||
| Line 27: | Line 27: | ||
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 | + | Press Regenerate Network untuk mengeluarkan graph instance yang baru. |
==Contoh== | ==Contoh== | ||
Revision as of 09:44, 22 February 2020
Sumber: https://orange.biolab.si/widget-catalog/networks/networkgenerator/
Membuat contoh graph.
Output
Generated Network: An instance of Network Graph.
Network Generator membangun network contoh. Ini dimaksudkan untuk pengajaran / pembelajaran tentang network.
Graph option:
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 untuk mengeluarkan graph instance yang baru.
Contoh
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.