Graph Classical Algorithms: Use classic algorithms like BFS and Edmonds Krap on graphs.
npm i gcaconst gca = require('gca');
const tool = new gca();
let graph = tool.CreateGraph();
graph.addNode(1);
graph.addNode(2);
graph.addEdge(1, 2);
let bfsGraph = tool.BFS(graph, 1);
let flowGraph = tool.CreateFlowGraph();
flowGraph.addEdge(flowGraph.s, flowGraph.t);
let maxFlow = tool.EdmondsKarp(flowGraph);Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Full documentation can be found here.
A changelog file can be found here.
Also, there an example.js page.
LinkedIn Profile
Github Profile
This project is licensed under the MIT License - see the LICENSE.md file for details.