differentiate between (UN)weighted, (UN)typed (sub)graph adjacency (dict/matrix)

Graphinius / graphinius

Generic graph (analysis) library in Typescript

MIT License

33 stars 6 forks source link

differentiate between (UN)weighted, (UN)typed (sub)graph adjacency (dict/matrix) #105

Closed cassinius closed 5 years ago

cassinius commented 5 years ago

[ ] formulation
[ ] diagram (upload here)
[x] test-cases & implementation
[x] abstract out into compute graph class !?

cassinius commented 5 years ago

actually, we implicitly do this by reading a graph in a directed / undirected way. HOWEVER, since we support mixed mode (with explicit directionality encoding within input files), we don't get such nice, pure differentiation as in other libraries... Going to think about how to handle this (= if mixed mode is still such a good idea)