FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaScriptAlgorithm/Graphs/ConnectedComponents.js at master · me-hasan/JavaScriptAlgorithm · GitHub
me-hasan
/
JavaScriptAlgorithm
Public
forked from
RabibHossain/JavaScriptAlgorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaScriptAlgorithm
/
Graphs
/
ConnectedComponents.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
56 lines (48 loc) · 1.78 KB
Breadcrumbs
JavaScriptAlgorithm
/
Graphs
/
ConnectedComponents.js
Copy path
File metadata and controls
56 lines (48 loc) · 1.78 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
class
GraphUnweightedUndirectedAdjacencyList
{
// Unweighted Undirected Graph class
constructor
(
)
{
this
.
connections
=
{
}
}
addNode
(
node
)
{
// Function to add a node to the graph (connection represented by set)
this
.
connections
[
node
]
=
new
Set
(
)
}
addEdge
(
node1
,
node2
)
{
// Function to add an edge (adds the node too if they are not present in the graph)
if
(
!
(
node1
in
this
.
connections
)
)
{
this
.
addNode
(
node1
)
}
if
(
!
(
node2
in
this
.
connections
)
)
{
this
.
addNode
(
node2
)
}
this
.
connections
[
node1
]
.
add
(
node2
)
this
.
connections
[
node2
]
.
add
(
node1
)
}
DFSComponent
(
components
,
node
,
visited
)
{
// Helper function to populate the visited set with the nodes in each component
// adding the first visited node in the component to the array
components
.
push
(
node
)
const
stack
=
[
node
]
// populating the visited set using DFS (Iterative)
while
(
stack
.
length
>
0
)
{
const
curr
=
stack
.
pop
(
)
visited
.
add
(
curr
.
toString
(
)
)
for
(
const
neighbour
of
this
.
connections
[
curr
]
.
keys
(
)
)
{
if
(
!
visited
.
has
(
neighbour
.
toString
(
)
)
)
{
stack
.
push
(
neighbour
)
}
}
}
}
connectedComponents
(
)
{
// Function to generate the Connected Components
// Result is an array containing 1 node from each component
const
visited
=
new
Set
(
)
const
components
=
[
]
for
(
const
node
of
Object
.
keys
(
this
.
connections
)
)
{
if
(
!
visited
.
has
(
node
.
toString
(
)
)
)
{
this
.
DFSComponent
(
components
,
node
,
visited
)
}
}
return
components
}
}
export
{
GraphUnweightedUndirectedAdjacencyList
}
// Example
// const graph = new GraphUnweightedUndirectedAdjacencyList()
// graph.addEdge(1, 2) // Component 1
// graph.addEdge(3, 4) // Component 2
// graph.addEdge(3, 5) // Component 2
// const components = graph.connectedComponents()
Back
|
FazBrowse Home
|
New Git URL