Commit 528fcef

authored

adding graph structure

1 parent bea291d commit 528fcefCopy full SHA for 528fcef

File tree

+10

-10

lines changed

+10

-10

lines changed

Lines changed: 10 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`This repo covers basic graph algorithms for directed and undirected graphs with/without weights on edges. Graph description is read from a file with ascii format.`
`6`	`6`
`7`		`-Base graph data structure is targeted for sparse graphs efficiency. For example, it maintains adjancy list and pointrs. Here are bigO time and space complexities.`
	`7`	`+Base graph data structure is targeted for sparse graphs efficiency. For example, it maintains adjancy list and pointrs. Here are big-O time and space complexities.`
`8`	`8`
`9`	`9`
`10`	`10`	`\| \| RAM \| node-add \| edge-add \| node-remove \| edge-remove \| query \|`
`@@ -25,22 +25,22 @@ Legend:`
`25`	`25`	`private:`
`26`	`26`	`string name_; // node name`
`27`	`27`	`set<const bEdge*, edgeCompare> edgelist_; // incident list`
`28`		`-...`
`29`		`-}/`
`30`		`-class bEdge {`
	`28`	`+...`
	`29`	`+}/`
	`30`	`+class bEdge {`
`31`	`31`	`private:`
`32`	`32`	`const bNode* n1_; // from node for directd graphs`
`33`	`33`	`const bNode* n2_; // to node for directed graphs`
`34`		`-...`
`35`		`-};`
`36`		`-...`
`37`		`-class bGraph {`
	`34`	`+...`
	`35`	`+};`
	`36`	`+...`
	`37`	`+class bGraph {`
`38`	`38`	`private:`
`39`	`39`	`bool isDirected_;`
`40`	`40`	`set<const bNode*, nodeCompare> nodeset_;`
`41`	`41`	`set<const bEdge*, edgeCompare> edgeset_;`
`42`		`-...`
`43`		`-};`
	`42`	`+...`
	`43`	`+};`
`44`	`44`
`45`	`45`	```
`46`	`46`

Comments

(0)