Proper Graph

A fast and lightweight library that aims to make graphs easy to use. It is built to be powerful on the inside and simple on the outside.

You don't need to know any graph theory to use this library, as long as you can draw circles and arrows on a piece of paper you are good to go!

Supports undirected and directed graphs.

Install

NodeJS

npm install --save proper-graph

Browser

<script src="https://cdn.jsdelivr.net/npm/[email protected]/browser/proper-graph.min.js"></script>

<script>
   var g = new Graph();

   // ...
</script>

Usage

Simple example

const Graph = require('proper-graph');

const g = new Graph(); // or 'new Graph({directed: true})' for a directed graph

// add nodes
g.addNode("3"); // node can be a string or a number
g.addNode("4");
g.addNode("5");
// g: ("3") ("4") ("5")

// add edges 3-4 and 4-5
g.addEdge("3", "4");
g.addEdge("4", "5");
// g: ("3")-("4")-("5")

g.shortestPath("3", "5"); // returns { nodes: ["3", "4", "5"], length: 2 }

"Real world" example: calculate the cheapest flight ticket between two cities

const Graph = require('proper-graph');

const g = new Graph({
   directed: true,
   weighted: true
});

// add cities
g.addNode("Tokyo");
g.addNode("San Francisco");
g.addNode("Toronto");
g.addNode("New York City");
g.addNode("Singapore");

// add prices for flight tickets between cities
g.addEdge("New York City", "Singapore", 1500);
g.addEdge("New York City", "Toronto", 100);
g.addEdge("Toronto", "San Francisco", 280);
g.addEdge("Toronto", "Tokyo", 640);
g.addEdge("Tokyo", "Singapore", 170);
g.addEdge("San Francisco", "Tokyo", 400);
g.addEdge("San Francisco", "Singapore", 550);

// g: ("Tokyo")<--- 640 ---("Toronto")<--- 100 ----("New York City")
//      |   /\                |                         /
//      |    \               280                       /
//      |    400              |                       / 
//     170     \              V                      /
//      |      ("San Francisco")                    /    
//      |        |                               1500
//      |       550                              /
//      |        |                              /
//      V        V                             /
//    ("Singapore")<--------------------------


// Now this is too complicated, I just want to know what is 
// the cheapest way to get from New York City to Singapore...
// Is it the $1500 direct flight?

g.shortestPath("New York City", "Singapore"); 
// returns { nodes: ["New York City", "Toronto", "Tokyo", "Singapore"], length: 910 }

// Just $910 if we go through Toronto and Tokyo, I almost paid $1500. 
// So much money saved, thanks proper-graph!

// How about from San Francisco to Singapore? Should I go through Tokyo?

g.shortestPath("San Francisco", "Singapore");
// returns { nodes: ["San Francisco", "Singapore"], length: 550 }

// Nope, the direct flight is the cheapest this time, proper-graph saves the day again!

Methods

`.addNode(node)`

Adds node to the graph. node is a string or a number that will uniquely identify the node.

Example:

const g = new Graph();

g.addNode(1);
g.addNode("Alice");
// g: (1) ("Alice")
// note that the nodes are not connected

`.addEdge(node1, node2[, weight])`

Adds an edge between the two nodes. The third parameter weight is only for weighted graphs.

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");

g.addEdge("1", "2");
// nodes "1" and "2" are now connected
// g: ("1")-("2") ("3") 
// note that the node "3" is not connected to the rest

Click to see a description for directed graph:

For directed graphs it adds an edge from node1 to node2.

Example:

const g = new Graph({
   directed: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");

// adds an edge from "1" to "2"
g.addEdge("1", "2");
// g: ("1")->("2") ("3")

// adds an edge from "2" to "1"
g.addEdge("2", "1");
// g: ("1")<->("2") ("3")

Click to see a description for weighted graph:

For weighted graphs it adds an edge from node1 to node2 with weight weight.

Weight is a number. Can be negative, float, or even Infinity.

Example:

const g = new Graph({
   directed: true,
   weighted: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");

// adds an edge from "1" to "2"
g.addEdge("1", "2", 5);
// g: ("1")- 5 ->("2") ("3")

// adds an edge from "2" to "1"
g.addEdge("2", "3", -10);
// g: ("1")- 5 ->("2")- -10 ->("3")

`.areConnected(node1, node2)`

Returns true if there is a path between the nodes, and false otherwise.

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");

g.addEdge("1", "2");
g.addEdge("2", "3");
// nodes "1", "2" and "3" are now connected, 
// g: ("1")-("2")-("3") ("4") 
// note that the node "4" is not connected to the rest

g.areConnected("1", "3"); // returns true
g.areConnected("3", "4"); // returns false

Click to see a description for directed graph:

Returns true if there is a path either from node1 to node2, or from node2 to node1.

Example:

const g = new Graph({
   directed: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");

g.addEdge("1", "2");
g.addEdge("2", "3");
// nodes "1", "2" and "3" are now connected, 
// g: ("1")->("2")->("3") ("4") 
// note that the node "4" is not connected to the rest

g.areConnected("3", "4"); // returns false

g.areConnected("1", "3"); // returns true
g.areConnected("3", "1"); // returns true because there is a path from "1" to "3", even though there is no path from "3" to "1"

`.contains(node)`

Returns true if the node node exists in the graph, and false otherwise.

Example:

const g = new Graph();

g.addNode("Alice");
// g: ("Alice")

g.contains("Alice"); // returns true
g.contains("Bob");  // returns false

`.removeNode(node)`

Removes the node. Returns false if the node does not exist, and true otherwise. Also removes all the edges incident to the node.

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")-("2")
//   |      \
//   |     ("3")
//   |      /
// ("5")-("4")

g.removeNode("1"); // returns true

// g:
//       ("2")
//          \
//         ("3")
//          /
// ("5")-("4")

g.removeNode("1"); // returns false because the node does not exist anymore

g.addNode("1");

// now after we added the node back, the edges previosly incident to the node don't exist anymore
// g:
// ("1") ("2")
//          \
//         ("3")
//          /
// ("5")-("4")

`.shortestPath(node1, node2)`

Returns an object that contains the nodes that comprise the shortest path between the two nodes, and the path's length (number of edges).

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");
g.addNode("77");

g.addEdge("1", "2");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")-("2")
//   |      \
//   |     ("3")
//   |      /
// ("5")-("4")     ("77")

let path;
path = g.shortestPath("1", "5"); 
// path: {
//     nodes: ["1", "5"],
//     length: 1
// }

path = g.shortestPath("1", "4"); 
// path: {
//     nodes: ["1", "5", "4"],
//     length: 2
// }

path = g.shortestPath("1", "3"); 
// path: {
//     nodes: ["1", "2", "3"],
//     length: 2
// }

// note that there is no path between the nodes "1" and "77"
path = g.shortestPath("1", "77");
// path: {
//     nodes: [],
//     length: undefined
// }

Click to see a description for directed graph:

Example:

const g = new Graph({
   directed: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "1");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")<->("2")->("3")
//   |              |
//   |              |
//   V              V
// ("5")<---------("4")

let path;
path = g.shortestPath("1", "4"); 
// path: {
//     nodes: ["1", "2", "3", "4"],
//     length: 3
// }
// note that the path is not "1", "5", "4", since there is no edge from "5" to "4"

path = g.shortestPath("2", "3"); 
// path: {
//     nodes: ["2", "3"],
//     length: 1
// }

path = g.shortestPath("3", "2"); 
// path: {
//     nodes: [],
//     length: undefined
// }
// note that there is no way to reach "2" from "3". It's a directed graph so direction matters, makes sense!

Click to see a description for weighted graph:

Returns an object that contains the nodes that comprise the shortest path between the two nodes, and the path's length (sum of weights of edges in the path).

Example:

const g = new Graph({
   directed: true,
   weighted: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2", 1);
g.addEdge("2", "3", 2);
g.addEdge("3", "4", 5);
g.addEdge("4", "5", -6);
g.addEdge("1", "5", 3);

// g:
// ("1")- 1 ->("2")- 2 ->("3")
//   |                     |
//   3                     5
//   |                     |
//   V                     V
// ("5")<------ -6 ------("4")

let path;
path = g.shortestPath("1", "4"); 
// path: {
//     nodes: ["1", "2", "3", "4"],
//     length: 8
// }

path = g.shortestPath("1", "5"); 
// path: {
//     nodes: ["1", "2", "3", "4", "5"],
//     length: 2
// }
// note that it's cheaper to go all the way around instead of taking the direct edge "1"->"5"

`.containsEdge(node1, node2)`

Returns true if the graph has an edge between the two nodes, and false otherwise

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")-("2")
//   |      \
//   |     ("3")
//   |      /
// ("5")-("4")

g.containsEdge("1", "2"); // returns true
g.containsEdge("2", "1"); // returns true
g.containsEdge("5", "4"); // returns true
g.containsEdge("1", "5"); // returns true

g.containsEdge("1", "3"); // returns false
g.containsEdge("3", "1"); // returns false
g.containsEdge("2", "4"); // returns false

Click to see a description for directed graph:

Returns true if the graph has an edge from node1 to node2, and false otherwise

Example:

const g = new Graph({
   directed: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "1");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")<->("2")->("3")
//   |              |
//   |              |
//   V              V
// ("5")<---------("4")

g.containsEdge("1", "2"); // returns true
g.containsEdge("2", "1"); // returns true

g.containsEdge("2", "3"); // returns true
g.containsEdge("3", "2"); // returns false

`.removeEdge(node1, node2)`

Removes the edge between the two nodes. Returns false if the edge does not exist, and true otherwise.

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")-("2")
//   |      \
//   |     ("3")
//   |      /
// ("5")-("4")

g.removeEdge("1", "3"); // returns false because there is no such edge
g.removeEdge("2", "4"); // returns false because there is no such edge

g.removeEdge("1", "2"); // returns true
g.removeEdge("1", "5"); // returns true

// g:
// ("1") ("2")
//          \
//         ("3")
//          /
// ("5")-("4")

g.removeEdge("1", "2"); // returns false because the edge does not exist anymore, hence there is nothing to remove

Click to see a description for directed graph:

Removes the edge from node1 to node2. Returns false if the edge does not exist, and true otherwise.

Example:

const g = new Graph({
   directed: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "1");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")<->("2")->("3")
//   |              |
//   |              |
//   V              V
// ("5")<---------("4")

g.removeEdge("1", "3"); // returns false because there is no such edge
g.removeEdge("3", "2"); // returns false because there is no such edge even though there is an edge "2"->"3"

g.removeEdge("1", "2"); // returns true
g.removeEdge("1", "5"); // returns true

// g:
// ("1")-->("2")->("3")
//                  |
//                  |
//                  V
// ("5")<---------("4")

`.iterateFrom(fromNode)`

A generator that iterates over every node that is connected to node

Example:

const g = new Graph();

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");
g.addNode("77");

g.addEdge("1", "2");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")-("2")
//   |      \
//   |     ("3")
//   |      /
// ("5")-("4")      ("77")
   
for (const node of g.iterateFrom("1")) {
   console.log(`Node: ${node}`);
}

// Output:
// Node: 1
// Node: 2
// Node: 5
// Node: 3
// Node: 4

// Note that the node "77" is not part of the output, 
// because it is not connected to the node "1", (see the graph above)

Click to see a description for directed graph:

A generator that iterates over every node accessible from node

Example:

const g = new Graph({
   directed: true
});

g.addNode("1");
g.addNode("2");
g.addNode("3");
g.addNode("4");
g.addNode("5");

g.addEdge("1", "2");
g.addEdge("2", "1");
g.addEdge("2", "3");
g.addEdge("3", "4");
g.addEdge("4", "5");
g.addEdge("1", "5");

// g:
// ("1")<->("2")->("3")
//   |              |
//   |              |
//   V              V
// ("5")<---------("4")

for (const node of g.iterateFrom("1")) {
   console.log(`Node: ${node}`);
}

// Output:
// Node: 1
// Node: 2
// Node: 5
// Node: 3
// Node: 4


for (const node of g.iterateFrom("3")) {
   console.log(`Node: ${node}`);
}

// Output:
// Node: 3
// Node: 4
// Node: 5

// note that "1" and "2" are not part of the output because they are not accessible from the node "3"

minderov / proper-graph Goto Github PK

proper-graph's Introduction

Proper Graph

Install

NodeJS

Browser

Usage

Simple example

"Real world" example: calculate the cheapest flight ticket between two cities

Methods

.addNode(node)

.addEdge(node1, node2[, weight])

.areConnected(node1, node2)

.contains(node)

.removeNode(node)

.shortestPath(node1, node2)

.containsEdge(node1, node2)

.removeEdge(node1, node2)

.iterateFrom(fromNode)

Recommend Projects

Recommend Topics

Recommend Org

`.addNode(node)`

`.addEdge(node1, node2[, weight])`

`.areConnected(node1, node2)`

`.contains(node)`

`.removeNode(node)`

`.shortestPath(node1, node2)`

`.containsEdge(node1, node2)`

`.removeEdge(node1, node2)`

`.iterateFrom(fromNode)`