gap> G:=SymmetricMatrixToFilteredGraph(S,10,100);;
#Filtration length T=10, distances greater than 100 discarded.
gap> N:=SimplicialNerveOfFilteredGraph(G,2);;
gap> C:=SparseFilteredChainComplexOfFilteredSimplicialComplex(N);;
Filtered sparse chain complex of length 2 in characteristic 0 .
| Messung V0.5 |
|---|
| | | |
¤ Dauer der Verarbeitung: 0.0 Sekunden
(vorverarbeitet)
¤
*© Formatika GbR, Deutschland