FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
javascript-algorithms/src/data-structures/graph/Graph.js at master · rmdort/javascript-algorithms · GitHub
rmdort
/
javascript-algorithms
Public
forked from
trekhleb/javascript-algorithms
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
javascript-algorithms
/
src
/
data-structures
/
graph
/
Graph.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
197 lines (167 loc) · 4.44 KB
Breadcrumbs
javascript-algorithms
/
src
/
data-structures
/
graph
/
Graph.js
Copy path
File metadata and controls
197 lines (167 loc) · 4.44 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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
export
default
class
Graph
{
/**
*
@param
{
boolean
} isDirected
*/
constructor
(
isDirected
=
false
)
{
this
.
vertices
=
{
}
;
this
.
edges
=
{
}
;
this
.
isDirected
=
isDirected
;
}
/**
*
@param
{
GraphVertex
} newVertex
*
@returns
{
Graph
}
*/
addVertex
(
newVertex
)
{
this
.
vertices
[
newVertex
.
getKey
(
)
]
=
newVertex
;
return
this
;
}
/**
*
@param
{
string
} vertexKey
*
@returns
GraphVertex
*/
getVertexByKey
(
vertexKey
)
{
return
this
.
vertices
[
vertexKey
]
;
}
/**
*
@param
{
GraphVertex
} vertex
*
@returns
{
GraphVertex[]
}
*/
getNeighbors
(
vertex
)
{
return
vertex
.
getNeighbors
(
)
;
}
/**
*
@return
{
GraphVertex[]
}
*/
getAllVertices
(
)
{
return
Object
.
values
(
this
.
vertices
)
;
}
/**
*
@return
{
GraphEdge[]
}
*/
getAllEdges
(
)
{
return
Object
.
values
(
this
.
edges
)
;
}
/**
*
@param
{
GraphEdge
} edge
*
@returns
{
Graph
}
*/
addEdge
(
edge
)
{
// Try to find and end start vertices.
let
startVertex
=
this
.
getVertexByKey
(
edge
.
startVertex
.
getKey
(
)
)
;
let
endVertex
=
this
.
getVertexByKey
(
edge
.
endVertex
.
getKey
(
)
)
;
// Insert start vertex if it wasn't inserted.
if
(
!
startVertex
)
{
this
.
addVertex
(
edge
.
startVertex
)
;
startVertex
=
this
.
getVertexByKey
(
edge
.
startVertex
.
getKey
(
)
)
;
}
// Insert end vertex if it wasn't inserted.
if
(
!
endVertex
)
{
this
.
addVertex
(
edge
.
endVertex
)
;
endVertex
=
this
.
getVertexByKey
(
edge
.
endVertex
.
getKey
(
)
)
;
}
// Check if edge has been already added.
if
(
this
.
edges
[
edge
.
getKey
(
)
]
)
{
throw
new
Error
(
'Edge has already been added before'
)
;
}
else
{
this
.
edges
[
edge
.
getKey
(
)
]
=
edge
;
}
// Add edge to the vertices.
if
(
this
.
isDirected
)
{
// If graph IS directed then add the edge only to start vertex.
startVertex
.
addEdge
(
edge
)
;
}
else
{
// If graph ISN'T directed then add the edge to both vertices.
startVertex
.
addEdge
(
edge
)
;
endVertex
.
addEdge
(
edge
)
;
}
return
this
;
}
/**
*
@param
{
GraphEdge
} edge
*/
deleteEdge
(
edge
)
{
// Delete edge from the list of edges.
if
(
this
.
edges
[
edge
.
getKey
(
)
]
)
{
delete
this
.
edges
[
edge
.
getKey
(
)
]
;
}
else
{
throw
new
Error
(
'Edge not found in graph'
)
;
}
// Try to find and end start vertices and delete edge from them.
const
startVertex
=
this
.
getVertexByKey
(
edge
.
startVertex
.
getKey
(
)
)
;
const
endVertex
=
this
.
getVertexByKey
(
edge
.
endVertex
.
getKey
(
)
)
;
startVertex
.
deleteEdge
(
edge
)
;
endVertex
.
deleteEdge
(
edge
)
;
}
/**
*
@param
{
GraphVertex
} startVertex
*
@param
{
GraphVertex
} endVertex
*
@return
{
(GraphEdge|null)
}
*/
findEdge
(
startVertex
,
endVertex
)
{
const
vertex
=
this
.
getVertexByKey
(
startVertex
.
getKey
(
)
)
;
if
(
!
vertex
)
{
return
null
;
}
return
vertex
.
findEdge
(
endVertex
)
;
}
/**
*
@return
{
number
}
*/
getWeight
(
)
{
return
this
.
getAllEdges
(
)
.
reduce
(
(
weight
,
graphEdge
)
=>
{
return
weight
+
graphEdge
.
weight
;
}
,
0
)
;
}
/**
* Reverse all the edges in directed graph.
*
@return
{
Graph
}
*/
reverse
(
)
{
/**
@param
{
GraphEdge
} edge */
this
.
getAllEdges
(
)
.
forEach
(
(
edge
)
=>
{
// Delete straight edge from graph and from vertices.
this
.
deleteEdge
(
edge
)
;
// Reverse the edge.
edge
.
reverse
(
)
;
// Add reversed edge back to the graph and its vertices.
this
.
addEdge
(
edge
)
;
}
)
;
return
this
;
}
/**
*
@return
{
object
}
*/
getVerticesIndices
(
)
{
const
verticesIndices
=
{
}
;
this
.
getAllVertices
(
)
.
forEach
(
(
vertex
,
index
)
=>
{
verticesIndices
[
vertex
.
getKey
(
)
]
=
index
;
}
)
;
return
verticesIndices
;
}
/**
*
@return
{
*[][]
}
*/
getAdjacencyMatrix
(
)
{
const
vertices
=
this
.
getAllVertices
(
)
;
const
verticesIndices
=
this
.
getVerticesIndices
(
)
;
// Init matrix with infinities meaning that there is no ways of
// getting from one vertex to another yet.
const
adjacencyMatrix
=
Array
(
vertices
.
length
)
.
fill
(
null
)
.
map
(
(
)
=>
{
return
Array
(
vertices
.
length
)
.
fill
(
Infinity
)
;
}
)
;
// Fill the columns.
vertices
.
forEach
(
(
vertex
,
vertexIndex
)
=>
{
vertex
.
getNeighbors
(
)
.
forEach
(
(
neighbor
)
=>
{
const
neighborIndex
=
verticesIndices
[
neighbor
.
getKey
(
)
]
;
adjacencyMatrix
[
vertexIndex
]
[
neighborIndex
]
=
this
.
findEdge
(
vertex
,
neighbor
)
.
weight
;
}
)
;
}
)
;
return
adjacencyMatrix
;
}
/**
*
@return
{
string
}
*/
toString
(
)
{
return
Object
.
keys
(
this
.
vertices
)
.
toString
(
)
;
}
}
Back
|
FazBrowse Home
|
New Git URL