examples/example-connected-components.html

<html>
    <head>
        <title>
            Connected Components on Graph
        </title>
        <script src="../third-party-libs/vis/vis.js" type="text/javascript"></script>
        <script src="../src/jsgraphs.js" type="text/javascript"></script>
        <link href="../third-party-libs/vis/vis.css" type="text/css" />
    </head>
    
    <body>
        <h2>Connected Components on Graph</h2>
        <div id="mynetwork"></div>
        
        <script type="text/javascript">
            (function(){
               var g = new jsgraphs.Graph(13);
                g.addEdge(0, 5);
                g.addEdge(4, 3);
                g.addEdge(0, 1);
                g.addEdge(9, 12);
                g.addEdge(6, 4);
                g.addEdge(5, 4);
                g.addEdge(0, 2);
                g.addEdge(11, 12);
                g.addEdge(9,10);
                g.addEdge(0, 6);
                g.addEdge(7, 8);
                g.addEdge(9, 11);
                g.addEdge(5, 3); 

                var cc = new jsgraphs.ConnectedComponents(g);
                console.log(cc.componentCount()); // display 3
                for (var v = 0; v < g.V; ++v) {
                    console.log('id[' + v + ']: ' + cc.componentId(v));
                }
                
                var g_nodes = [];
                var g_edges = [];
                for(var v=0; v < g.V; ++v){
                    g.node(v).label = 'Node ' + v; // assigned 'Node {v}' as label for node v
                    g_nodes.push({
                       id: v,
                       label: g.node(v).label,
                       group: cc.componentId(v)
                    });
                    
                    var adj_v = g.adj(v);
                    for(var i = 0; i < adj_v.length; ++i) {
                        var w = adj_v[i];
                        if(w > v) continue; // make sure only one edge between w and v since the graph is undirected
                        g_edges.push({
                            from: v,
                            to: w
                        });
                    };
                }

                console.log(g.V); // display 6, which is the number of vertices in g
                console.log(g.adj(0)); // display [5, 1, 2], which is the adjacent list to vertex 0
                
                var nodes = new vis.DataSet(g_nodes);

                // create an array with edges
                var edges = new vis.DataSet(g_edges);

                // create a network
                var container = document.getElementById('mynetwork');
                var data = {
                    nodes: nodes,
                    edges: edges
                };
                var options = {};
                var network = new vis.Network(container, data, options);
            })();
        </script>
    </body>
</html>