- iExcelNetwork is an Excel VSTO add-in written in C# designed to build network visualizations using the vis.js network library.
- iExcelNetwork does not require an internet connection and does not send data outside the local machine to build the network.
- iExcelNetwork does not aim to compete with professional graph visualization and analytics software. Its main goal is to provide a lightweight solution for visualizing and gaining insights from graphs as a standalone tool for MS Excel users.
The current PoC functionality:
- Select a specific range of data or nodes.
- Save the selected range as a JSON file.
- Build a network from the selected range.
- Modify and adjust the properties of the network to be built.
- Identify all directed paths within the network created from the selected range.
- Download a zip file iExcelNetwork_PoC_ver_1_2_1.zip. The zip file is included in release.
- The zip file's sha256 is 301d3fa9243f2c565039f0c36d5025af348622681e8c0a41ee0ec780e8161738.
- Extract.
- Install iExcelNetwork by executing setup.exe.
- Press the "How it Works" button to see instructions on how to use iExcelNetwork.
- A new Excel sheet named "How It Works" will open.
- Select a range and press the "Build Network" button.
- Note!!! that columns names should to be from and to. Another acepted range is with column names are from, to, count. It is possible to have duplicates.
- An HTML file named iExcelnetwork.html will be generated in the user's temp folder.
- The HTML file will open in your default browser.
- Set direction of thearrow.
- Set HTML file's name and output folder.
- Press button when data range A1:B8 is selected.
- If your source node is A and your destination node is C, press "Find" to generate the result.
- If your source node is C and your destination node is A, you will receive a message indicating that no path was found.
- Similarly, if you attempt to find a path between nodes F and A, no path will be found due to the direction of the connections: F -> B <- A.
Implement all paths find as non directional edges to find path from F to A as F -> B <- A.