This page contains Wolfram Mathematica notebooks that complement DiscretePath.
The notebooks
- can handle large data sets
- and export the results as '.xlsx'-files for further use (in DiscretePath, ...)
- the current versions of the notebooks were built using Mathematica version 14.3
The downloads contain evaluated Wolfram Mathematica notebooks that were run for demonstration purposes with the files that are included in the downloads.
Use in the 'Input Section' of the notebooks the menu item : Insert -> File Path ... to evaluate the desired graph.
The first section of the notebooks guides you through the (simple) process.
Graph clustering
Graph similarity
Quantifies the similarity between two graphs with corresponding vertices. The presence/absence of vertices and/or edges can vary and/or the weights of the edges can vary.
Two graphs (GraphA and GraphB) with a similar layout are compared: identical vertices and edges, but the x,y positions of the vertices may differ.
Such an algorithm can be used for facial recognition, for example.
Random graph
The notebook creates a random graph and saves the graph data in an 'xlsx' and 'tgf' file.