graphinius
graphinius copied to clipboard
Graphinius
Generic graph (analysis) library in Typescript
- if all edges in a graph have the same weight, there are exponentially many equal shortest paths between two nodes (u,v) - this drastically increases computational costs for calculating...
- We checked this against the python networkx implementation.. and those guys left it out - why? - put relevant comments into the code - write some test cases for...
- Create a new graph class inherited from Base Graph - Implement additional errors for duplicate edges and self loops - think about implications on graph algorithms and write up...
Implement it as a graph method with the option to return a new graph or apply the transformation in-place
For a multi-component graph, write a method such that: - given the graph and a specific DFS result - return a corresponding array containing entries [component_start_node_id: string, has_negative_cycle: boolean] -...
* Complete test cases / implementation of min-cut-max-flow * Complete test cases / implementation of POTTS model * Add some manual documentation and use case description * Prepare use case...