Input Graph:
Input a directed graph as:
First line is always the string "dim 0". Second line is a list of n zeros, where n is the number of vertices. Third Line is always the string "dim 1". Each subsequent line is an edge i->j written as "i j". The edges must be inputted in lexicographic order! | ||
Select a File to Load:
Select a text file containing a graph  
and then load it into box above. Or load an example graph. |
||
Choose Function: | ||
Filtration:
If computing persistent Homology
choose a filtration: See paper for further details. | ||
Approximate:
Set an approximate value to skip certain computations when taking to long, see
documentation for further details.
|
||