添加多种数据结构支持

This commit is contained in:
黎智洲 2021-04-22 21:39:29 +08:00
parent eaa58af42d
commit 579c72939c
5 changed files with 385 additions and 3 deletions

View File

@ -0,0 +1,66 @@
class DirectedGraph extends Graph {
defineOptions() {
return {
element: {
default: {
label: '[id]',
size: 30,
style: {
stroke: '#333',
fill: '#b83b5e'
}
}
},
link: {
neighbor: {
type: 'line',
style: {
stroke: '#333',
endArrow: {
path: G6.Arrow.triangle(8, 6, 0),
fill: '#333'
}
}
}
},
pointer: {
external: {
offset: 8,
style: {
fill: '#f08a5d'
}
}
},
layout: {
radius: 150
}
};
}
}
const DG = function(container) {
return{
engine: new DirectedGraph(container),
data: [[
{ id: 1, neighbor: 2 },
{ id: 2, neighbor: [ 3, 4, 5 ] },
{ id: 3, neighbor: [ 4, 6 ] },
{ id: 4, neighbor: 5 },
{ id: 5, neighbor: 6 },
{ id: 6, neighbor: 1 }
],
[
{ id: 1, neighbor: 3 },
{ id: 3 },
{ id: 4, neighbor: 5 },
{ id: 5, neighbor: 6 },
{ id: 6, neighbor: 1 }
]]
}
};

73
demo/dataStruct/Graph.js Normal file
View File

@ -0,0 +1,73 @@
class Graph extends Engine {
defineOptions() {
return {
element: {
default: {
type: 'circle',
label: '[id]',
size: 30,
style: {
stroke: '#333',
fill: '#b83b5e'
}
}
},
link: {
neighbor: {
style: {
stroke: '#333'
}
}
},
pointer: {
external: {
offset: 8,
style: {
fill: '#f08a5d'
}
}
},
layout: {
radius: 150
}
};
}
layout(elements, layoutOptions) {
let nodes = elements.default,
radius = layoutOptions.radius,
intervalAngle = 2 * Math.PI / nodes.length;
for (let i = 0; i < nodes.length; i++) {
let [x, y] = Vector.rotation(-intervalAngle * i, [0, -radius]);
nodes[i].set({x, y});
}
}
}
const G = function(container) {
return{
engine: new Graph(container),
data: [[
{ id: 1, neighbor: 2 },
{ id: 2, neighbor: [ 3, 4, 5 ] },
{ id: 3, neighbor: [ 4, 6] },
{ id: 4, neighbor: 5 },
{ id: 5, neighbor: 6 },
{ id: 6, neighbor: 1 }
],
[
{ id: 1, neighbor: 3 },
{ id: 3 },
{ id: 4, neighbor: 5 },
{ id: 5, neighbor: 6 },
{ id: 6, neighbor: 1 }
]]
}
};

View File

@ -0,0 +1,237 @@
G6.registerNode('link-Queue-head', {
draw(cfg, group) {
cfg.size = cfg.size || [30, 10];
const width = cfg.size[0],
height = cfg.size[1];
const wrapperRect = group.addShape('rect', {
attrs: {
x: width / 2,
y: height / 2,
width: width,
height: height,
stroke: cfg.style.stroke,
fill: 'transparent'
},
name: 'wrapper'
});
group.addShape('rect', {
attrs: {
x: width / 2,
y: height / 2,
width: width,
height: height / 2,
fill: cfg.style.fill,
stroke: cfg.style.stroke
},
name: 'top-rect'
});
group.addShape('rect', {
attrs: {
x: width / 2,
y: height,
width: width,
height: height / 2,
fill: cfg.style.fill,
stroke: cfg.style.stroke
},
name: 'bottom-rect'
});
group.addShape('text', {
attrs: {
x: width,
y: height * (3 / 4),
textAlign: 'center',
textBaseline: 'middle',
text: 'front',
fill: '#000',
fontSize: 16
},
name: 'front'
});
group.addShape('text', {
attrs: {
x: width,
y: height * (5 / 4),
textAlign: 'center',
textBaseline: 'middle',
text: 'rear',
fill: '#000',
fontSize: 16
},
name: 'rear'
});
return wrapperRect;
},
getAnchorPoints() {
return [
[1, 0.25],
[1, 0.75]
];
}
});
class LinkQueue extends Engine {
defineOptions() {
return {
element: {
head: {
type: 'link-Queue-head',
label: '[id]',
size: [60, 80],
style: {
stroke: '#333',
fill: '#b83b5e'
}
},
node: {
type: 'link-list-node',
label: '[id]',
size: [60, 30],
style: {
stroke: '#333',
fill: '#b83b5e'
}
}
},
link: {
front: {
type: 'line',
sourceAnchor: 0,
targetAnchor: 0,
style: {
stroke: '#333',
endArrow: {
path: G6.Arrow.triangle(8, 6, 0),
fill: '#333'
}
}
},
rear: {
type: 'polyline',
sourceAnchor: 1,
targetAnchor: 3,
style: {
stroke: '#333',
endArrow: {
path: G6.Arrow.triangle(8, 6, 0),
fill: '#333'
}
}
},
next: {
type: 'line',
sourceAnchor: 1,
targetAnchor: 0,
style: {
stroke: '#333',
endArrow: {
path: G6.Arrow.triangle(8, 6, 0),
fill: '#333'
},
startArrow: {
path: G6.Arrow.circle(2, -1),
fill: '#333'
}
}
}
},
pointer: {
external: {
offset: 8,
style: {
fill: '#f08a5d'
}
}
},
layout: {
xInterval: 50,
yInterval: 50
}
};
}
/**
* 对子树进行递归布局
* @param node
* @param parent
*/
layoutItem(node, prev, layoutOptions) {
if(!node) {
return null;
}
let width = node.get('size')[0];
if(prev) {
node.set('y', prev.get('y'));
node.set('x', prev.get('x') + layoutOptions.xInterval + width);
}
if(node.next) {
this.layoutItem(node.next, node, layoutOptions);
}
}
layout(elements, layoutOptions) {
let head = elements.head[0];
if(head.front) {
let d = head.get('size')[1] / 2 - head.front.get('size')[1],
x = layoutOptions.xInterval * 2.5,
y = head.front.get('size')[1] / 2 + 1.5 * d;
head.front.set({ x, y });
}
if(head.front.next) {
this.layoutItem(head.front.next, head.front, layoutOptions);
}
}
}
const LQueue = function(container) {
return{
engine: new LinkQueue(container),
data: [{
head: [{
type: "QPtr",
id: 44,
front: 'node#1',
rear: 'node#13'
}],
node: [
{
id: 1,
next: 12,
root: true
},
{
id: 12,
next: 13
},
{
id: 13,
next: null
}
]
}]
}
};

View File

@ -35,7 +35,8 @@
const Engine = SV.Engine,
Group = SV.Group,
Bound = SV.Bound,
G6 = SV.G6;
G6 = SV.G6,
Vector = SV.Vector;
</script>
<script src="./dataStruct/BinaryTree.js"></script>
@ -44,11 +45,14 @@ const Engine = SV.Engine,
<script src="./dataStruct/ChainHashTable.js"></script>
<script src="./dataStruct/Stack.js"></script>
<script src="./dataStruct/LinkStack.js"></script>
<script src="./dataStruct/LinkQueue.js"></script>
<script src="./dataStruct/Graph.js"></script>
<script src="./dataStruct/DirectedGraph.js"></script>
<script>
const engines = [BTree, LList, A, CHT, St, LStack];
const engines = [BTree, LList, A, CHT, St, LStack, LQueue, G, DG];
let cur = engines[5](document.getElementById('container'));
let cur = engines[8](document.getElementById('container'));
cur.engine.render(cur.data[0]);

View File

@ -6,12 +6,14 @@ import * as G6 from "./Lib/g6.js";
import linkListNode from "./RegisteredShape/linkListNode";
import binaryTreeNode from "./RegisteredShape/binaryTreeNode";
import twoCellNode from "./RegisteredShape/twoCellNode";
import { Vector } from "./Common/vector";
export const SV = {
Engine: Engine,
Group: Group,
Bound: Bound,
Vector: Vector,
G6,
registeredShape: [
externalPointer, linkListNode, binaryTreeNode, twoCellNode