-
Notifications
You must be signed in to change notification settings - Fork 1
/
plugins.json
161 lines (150 loc) · 11.6 KB
/
plugins.json
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
{
"plugins": [
{
"id": "sigmajsexporter"
, "name": "Sigmajs Exporter"
, "catchphrase": "Export your network from Gephi to a predefined Sigma.js template."
, "types": [
"exports"
]
, "screenshots": [
"https://marketplace.gephi.org/wp-content/uploads/2013/01/twitter-620.png?71aaf5"
]
, "authors": [
{
"name": "Scott Hale"
, "link": "http://www.scotthale.net/"
}
]
, "sourcecode": "https://github.com/oxfordinternetinstitute/gephi-plugins/tree/JSONExporter/sigmaExporter"
, "license": "GPL v3"
, "supported_platforms": [
"linux"
, "macos"
, "windows"
]
, "versions": {
"0.8.2": "http://google.com"
, "0.8.1-beta": "http://google.com"
, "0.8-beta": "http://google.com"
, "0.8-alpha": "http://google.com"
}
, "last_update": "August 9, 2013"
, "description": "Export your network from Gephi to a predefined Sigma.js template. Choose to include search, group selection, explanatory text, etc. without having to do any HTML/JavaScript coding. Upload the output to any webserver and enjoy a rich HTML5 interactive visualization of your network.\n\nExample output is available at: [http://blogs.oii.ox.ac.uk/vis/?page_id=115](http://blogs.oii.ox.ac.uk/vis/?page_id=115) More features are coming and better validation is needed, but I’m making this alpha version of the code available quickly because of the demand I’ve received for it. More [information on the project](http://blogs.oii.ox.ac.uk/vis/) is available on [our blog](http://blogs.oii.ox.ac.uk/vis/). The underlying[HTML5/CSS/JS framework used to render the graphs](https://github.com/oxfordinternetinstitute/InteractiveVis/) is also available on [GitHub as a separate project](https://github.com/oxfordinternetinstitute/InteractiveVis/) and changes / pull requests are welcome.\n\nOnce installed, restart Gephi and you will see a **Export to sigma.js **option on the **File->Export** menu. Choose a location to export to, set export customization options, and click OK. The resulting folder can be uploaded to any webserver to showcase your network. Please note, due to browser security restrictions in Chrome you will not be able to view the result without a webserver (Other browsers may work locally).\n\nPlease report any issues or feature requests on the [GitHub page](https://github.com/oxfordinternetinstitute/gephi-plugins/issues/).\n\n \n\nRelease notes:\n\n1.0 (6 Nov 2012) Initial release\n\n1.1 (Jan 2013) Updated for 0.8.2 Gephi release\n\n1.1.1 (Feb 2013) Store edge weight to the ‘size’ attribute in the data so that this is displayed by Sigma.js. It is likely necessary to tweak the minEdgeSize and maxEdgeSize values in config.json for your particular configuration. The config.json files Export your network from Gephi to a predefined Sigma.js template. Choose to include search, group selection, explanatory text, etc. without having to do any HTML/JavaScript coding. Upload the output to any webserver and enjoy a rich HTML5 interactive visualization of your network.\n\nExample output is available at: [http://blogs.oii.ox.ac.uk/vis/?page_id=115](http://blogs.oii.ox.ac.uk/vis/?page_id=115) More features are coming and better validation is needed, but I’m making this alpha version of the code available quickly because of the demand I’ve received for it. More [information on the project](http://blogs.oii.ox.ac.uk/vis/) is available on [our blog](http://blogs.oii.ox.ac.uk/vis/). The underlying[HTML5/CSS/JS framework used to render the graphs](https://github.com/oxfordinternetinstitute/InteractiveVis/) is also available on [GitHub as a separate project](https://github.com/oxfordinternetinstitute/InteractiveVis/) and changes / pull requests are welcome.\n\nOnce installed, restart Gephi and you will see a **Export to sigma.js **option on the **File->Export** menu. Choose a location to export to, set export customization options, and click OK. The resulting folder can be uploaded to any webserver to showcase your network. Please note, due to browser security restrictions in Chrome you will not be able to view the result without a webserver (Other browsers may work locally).\n\nPlease report any issues or feature requests on the [GitHub page](https://github.com/oxfordinternetinstitute/gephi-plugins/issues/).\n\n \n\nRelease notes:\n\n1.0 (6 Nov 2012) Initial release\n\n1.1 (Jan 2013) Updated for 0.8.2 Gephi release\n\n1.1.1 (Feb 2013) Store edge weight to the ‘size’ attribute in the data so that this is displayed by Sigma.js. It is likely necessary to tweak the minEdgeSize and maxEdgeSize values in config.json for your particular configuration. The config.json files is now in pretty-print mode to make it easier to view and edit.\n\n1.2 (Aug 2013)\n\n- Fix error in configuration causing ‘dim’ option not to work\n- Force UTF-8 encoding on Mac/Windows for data/config files\n- Fix error when graph had no edges\n- Export edge color if given; if not use blend of source and target nodes’ colors\n- Fix error when export path given was invalid\n- Offer option to replace node ids with numbers (can be more compact for large graphs)\n\nis now in pretty-print mode to make it easier to view and edit.\n\n1.2 (Aug 2013)\n\n- Fix error in configuration causing ‘dim’ option not to work\n- Force UTF-8 encoding on Mac/Windows for data/config files\n- Fix error when graph had no edges\n- Export edge color if given; if not use blend of source and target nodes’ colors\n- Fix error when export path given was invalid\n- Offer option to replace node ids with numbers (can be more compact for large graphs)"
}
, {
"id": "openord"
, "name": "OpenOrd Layout"
, "catchphrase": "Force-Directed layout algorithm for real-world large-scale undirected graphs."
, "types": [
"layout"
]
, "screenshots": [
"https://marketplace.gephi.org/wp-content/uploads/2012/10/openorb_medium.png?71aaf5"
, "https://marketplace.gephi.org/wp-content/uploads/2012/10/openorb_medium.png?71aaf5"
, "https://marketplace.gephi.org/wp-content/uploads/2012/10/openorb_medium.png?71aaf5"
]
, "authors": [
{
"name": "Mathieu Bastian"
, "link": "http://gephi.org/"
}
]
, "sourcecode": "https://github.com/gephi/gephi-plugins/tree/openord-layout"
, "license": "GPL v3"
, "supported_platforms": [
"linux"
, "macos"
, "windows"
]
, "versions": {
"0.8.2": "http://google.com"
, "0.8.1-beta": "http://google.com"
, "0.8-beta": "http://google.com"
, "0.8-alpha": "http://google.com"
, "0.7-beta": "http://google.com"
}
, "last_update": "January 4, 2013"
, "description": "#### Introduction\n\nForce-Directed layout algorithm for real-world large-scale undirected graphs.\n\n#### Plugin Owner’s Notes\n\nIt is one of the few force-directed layout algorithms that 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. It can be run in parallel to speed up computing.\n\nThe algorithm is originally based on Frutcherman-Reingold and works with a fixed number of iterations. The algorithm is using simulated annealing and has five different phases: liquid, expansion, cool-down, crunch, and simmer. Each stage is a fraction of the total iterations and several parameters like temperature, attraction and damping are changing. The default schedule spends approximately 25% of its time in the liquid stage, 25% in the expansion stage, 25% in the cool-down stage, 10% in the crunch stage, and 15% in the simmer stage.\n\nThe original OpenOrd C++ implementation is available at the following address : [http://www.cs.sandia.gov/~smartin/software.html](http://www.cs.sandia.gov/~smartin/software.html). This plug-in version doesn’t include the multi-level version of the algorithm. The algorithm was formerly known as DrL, and before that VxOrd. \nParallel\n\nOpenOrd can be run in parallel to speed up computation. Each thread will work on a subset of the nodes of the graph. It’s recommended to put the number of core minus 1 to keep a thread for display. For example on a quad-core computer, it’s good to use three threads.\n\n##### Edge-Cutting\n\nEdge-cutting in OpenOrd is specified using a fraction from 0 to 1. An edge-cutting value of 0 corresponds to the standard Frutcherman-Reingold layout algorithm (no cutting), while an edge-cutting value of 1 corresponds to aggressive cutting. Aggressive cutting promotes clustering but will not cut every edge. The default value for edge-cutting in OpenOrd is 0.8.\n\n##### Layout on a grid\n\n[Gephi OpenOrd layout on a grid](http://vimeo.com/24731034) from [gephi](http://vimeo.com/gephi) on [Vimeo](http://vimeo.com/).\n\n##### Reference\n\nS. Martin, W. M. Brown, R. Klavans, and K. Boyack (to appear, 2011), “OpenOrd: An Open-Source Toolbox for Large Graph Layout,” SPIE Conference on Visualization and Data Analysis (VDA).\n\n##### Release history\n\n- **0.4** (Feb 11): Configure time spent in each stage (liquid, expansion, cool-down, crunch and simmer)\n- **0.3** (Nov 10): First plugin release"
}
, {
"id": "dummy"
, "name": "Dummy Plugin With A Very Long And Annoying Name Whose Purpose Is To Try To Break The UI - And Trust Me People Can Actually Use Such Long Names"
, "catchphrase": "A fictional test plugin"
, "types": [
"exports"
, "layout"
, "import"
, "filter"
]
, "screenshots": [
]
, "authors": [
{
"name": "Sangoku From Dragon Ball Z II bis Prime The Return Ultimate Vengeance Of Final Chapter"
, "link": "http://google.com"
}
]
, "sourcecode": "http://google.com"
, "license": "GPL v3"
, "supported_platforms": [
"linux"
, "macos"
, "windows"
]
, "versions": {
"0.8.2": "http://google.com"
}
, "last_update": "January 1, 2000"
, "description": "Lorem ipsum dolor sit amet, consectetur adipiscing elit. Aenean sit amet leo sed libero feugiat cursus. Nulla mattis augue at tortor dignissim laoreet. Suspendisse dapibus tortor non malesuada lobortis. Ut ut erat ex. Duis bibendum nec erat eu vehicula. Maecenas augue odio, eleifend sit amet ligula eu, rutrum volutpat eros. Fusce at leo eu mi egestas scelerisque. Integer ac risus nec magna venenatis blandit. Interdum et malesuada fames ac ante ipsum primis in faucibus. Lorem ipsum dolor sit amet, consectetur adipiscing elit. Integer tincidunt non nisl vel sagittis. Maecenas vel sagittis elit."
}
, {
"id": "dummy"
, "name": "Almost Empty Plugin"
, "catchphrase": "Does nothing"
, "types": "layout"
, "screenshots": [
]
, "authors": [
{
"name": "Poney"
}
]
, "supported_platforms": [
"windows"
]
, "versions": {
"0.9-alpha": "http://google.com"
}
, "last_update": "January 1, 2000"
, "description": "Lorem ipsum dolor sit amet, consectetur adipiscing elit."
}
, {
"name": "Empty Plugin"
}
, {
"id": "Damaged#"
, "name": "Damaged Plugin"
, "types": [
"Exports"
, "layout"
, "layout"
, "Layout"
]
, "screenshots": "http://google.com"
, "Authors": [
{
"name": "Bug Man"
}
]
, "sourcecode": "http:wrong//URL"
, "license": null
, "supported_platforms": [
"linux"
, "beOS"
]
, "last_update": "1er Brumaire -25"
, "description": ""
}
]
}