Commitbbcea74

authored

Merge pull request#132 from dengelt/main

Fix Typo

2 parentsd383faa +f3486ed commitbbcea74Copy full SHA for bbcea74

File tree

-2

lines changed

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -172,7 +172,7 @@ is a data structure used for representing a sparse matrix. Since graphs can be m`
`172`	`172`	`matrix and are typically very sparse, i.e., not all possible pairs of nodes are connected`
`173`	`173`	`by an edge, the CSR representation is very well suited for representing a real-world graph topology.`
`174`	`174`
`175`		`-In our current implementation, we use two arraystwo model the edges. One array stores the adjacency`
	`175`	`+In our current implementation, we use two arraysto model the edges. One array stores the adjacency`
`176`	`176`	lists for all nodes consecutively which requires`O(edge_count)` space. The other array stores the
`177`	`177`	`offset for each node in the first array where the corresponding adjacency list can be found which`
`178`	`178`	requires`O(node_count)` space. The degree of a node can be inferred from the offset array.

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -175,7 +175,7 @@`
`175`	`175`	`//! matrix and are typically very sparse, i.e., not all possible pairs of nodes are connected`
`176`	`176`	`//! by an edge, the CSR representation is very well suited for representing a real-world graph topology.`
`177`	`177`	`//!`
`178`		`-//! In our current implementation, we use two arraystwo model the edges. One array stores the adjacency`
	`178`	`+//! In our current implementation, we use two arraysto model the edges. One array stores the adjacency`
`179`	`179`	//! lists for all nodes consecutively which requires `O(edge_count)` space. The other array stores the
`180`	`180`	`//! offset for each node in the first array where the corresponding adjacency list can be found which`
`181`	`181`	//! requires `O(node_count)` space. The degree of a node can be inferred from the offset array.

Comments

(0)