Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
tianyazhichiC
algorithm-visualizer
提交
2a36705f
A
algorithm-visualizer
项目概览
tianyazhichiC
/
algorithm-visualizer
与 Fork 源项目一致
从无法访问的项目Fork
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
A
algorithm-visualizer
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
2a36705f
编写于
2月 28, 2017
作者:
R
Rajkumar Sriramulu
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Updated layout stratergy to draw nodes
上级
21374adc
变更
1
显示空白变更内容
内联
并排
Showing
1 changed file
with
63 addition
and
52 deletion
+63
-52
js/module/tracer/directed_graph_construct.js
js/module/tracer/directed_graph_construct.js
+63
-52
未找到文件。
js/module/tracer/directed_graph_construct.js
浏览文件 @
2a36705f
...
...
@@ -73,10 +73,17 @@ class DirectedGraphConstructTracer extends Tracer {
return
this
;
}
_clearTraversal
()
{
this
.
manager
.
pushStep
(
this
.
capsule
,
{
type
:
'
clear
'
});
return
this
;
}
processStep
(
step
,
options
)
{
switch
(
step
.
type
)
{
case
'
setTreeData
'
:
this
.
setTreeData
.
apply
(
this
,
step
.
argument
s
);
case
'
clear
'
:
this
.
clear
.
apply
(
thi
s
);
break
;
case
'
setNodePositions
'
:
$
.
each
(
this
.
graph
.
nodes
(),
(
i
,
node
)
=>
{
...
...
@@ -159,7 +166,6 @@ class DirectedGraphConstructTracer extends Tracer {
}
}
}
nodeObject
.
updateBreadth
();
this
.
nodeCollection
.
push
(
nodeObject
);
return
nodeObject
;
}
...
...
@@ -169,23 +175,10 @@ class DirectedGraphConstructTracer extends Tracer {
id
:
this
.
n
(
val
),
originalVal
:
val
,
isNew
:
true
,
visited
:
false
,
children
:
[],
breadth
:
0
,
level
:
1
,
parent
:
null
,
visited
:
false
,
updateBreadth
:
function
()
{
var
oldBreadth
=
nodeObject
.
breadth
;
if
(
nodeObject
.
children
.
length
>
0
)
{
nodeObject
.
breadth
=
nodeObject
.
children
.
length
%
2
?
0
:
1
;
for
(
let
j
=
0
;
j
<
nodeObject
.
children
.
length
;
j
++
)
{
nodeObject
.
breadth
+=
nodeObject
.
children
[
j
].
breadth
;
}
}
else
{
nodeObject
.
breadth
=
1
;
}
if
(
oldBreadth
!==
nodeObject
.
breadth
&&
nodeObject
.
parent
)
{
nodeObject
.
parent
.
updateBreadth
();
}
}
parent
:
null
}
return
nodeObject
;
}
...
...
@@ -194,43 +187,60 @@ class DirectedGraphConstructTracer extends Tracer {
const
nodes
=
[];
const
edges
=
[];
var
tracer
=
this
;
var
drawNode
=
function
(
node
,
parentNode
,
occupiedBreadth
)
{
var
calculatedX
=
node
.
breadth
;
if
(
parentNode
)
{
calculatedX
=
parentNode
.
breadth
+
occupiedBreadth
-
node
.
breadth
;
}
else
if
(
node
.
children
.
length
>
0
)
{
calculatedX
=
Math
.
ceil
(
calculatedX
/
node
.
children
.
length
);
var
arrangeChildNodes
=
function
(
node
,
offsetWidth
)
{
if
(
node
.
children
.
length
>
1
){
var
midPoint
=
Math
.
floor
(
node
.
children
.
length
/
2
);
for
(
let
i
=
0
;
i
<
node
.
children
.
length
;
i
++
)
{
if
(
i
===
midPoint
)
{
offsetWidth
+=
(
node
.
children
.
length
%
2
===
0
?
1
:
0
);
addGraphNode
(
node
,
offsetWidth
);
}
offsetWidth
=
arrangeChildNodes
(
node
.
children
[
i
],
offsetWidth
);
addEdge
(
node
,
node
.
children
[
i
]);
}
}
else
{
if
(
node
.
children
.
length
===
0
)
{
offsetWidth
+=
1
;
}
else
{
offsetWidth
=
arrangeChildNodes
(
node
.
children
[
0
],
offsetWidth
);
addEdge
(
node
,
node
.
children
[
0
]);
}
addGraphNode
(
node
,
offsetWidth
);
}
return
offsetWidth
;
};
var
addGraphNode
=
function
(
node
,
calculatedX
)
{
var
color
=
getColor
(
node
.
isNew
,
node
.
visited
,
tracer
.
color
);
nodes
.
push
({
id
:
node
.
id
,
label
:
''
+
node
.
originalVal
,
x
:
calculatedX
,
y
:
node
.
level
-
1
,
size
:
1
,
color
:
node
.
isNew
?
tracer
.
color
.
selected
:
(
node
.
visited
?
tracer
.
color
.
visited
:
tracer
.
color
.
default
)
,
color
:
color
,
weight
:
0
});
};
if
(
node
.
children
.
length
>
0
)
{
var
midPoint
=
node
.
children
.
length
/
2
;
var
occupiedBreadth
=
0
;
for
(
let
j
=
0
;
j
<
node
.
children
.
length
;
j
++
)
{
var
childNode
=
node
.
children
[
j
];
var
addEdge
=
function
(
node
,
childNode
)
{
var
color
=
getColor
(
node
.
visited
&&
childNode
.
isNew
,
node
.
visited
&&
childNode
.
visited
,
tracer
.
color
);
edges
.
push
({
id
:
tracer
.
e
(
node
.
originalVal
,
childNode
.
originalVal
),
source
:
node
.
id
,
target
:
childNode
.
id
,
color
:
node
.
visited
&&
childNode
.
visited
?
tracer
.
color
.
visited
:
tracer
.
color
.
default
,
color
:
color
,
size
:
1
,
weight
:
refineByType
(
childNode
.
originalVal
)
});
drawNode
(
childNode
,
node
,
occupiedBreadth
);
occupiedBreadth
+=
node
.
breadth
;
}
}
};
drawNode
(
this
.
rootObject
);
var
getColor
=
function
(
isNew
,
isVisited
,
colorPalete
)
{
return
isNew
?
colorPalete
.
selected
:
(
isVisited
?
colorPalete
.
visited
:
colorPalete
.
default
);
};
arrangeChildNodes
(
this
.
rootObject
,
0
);
this
.
graph
.
clear
();
this
.
graph
.
read
({
...
...
@@ -269,8 +279,9 @@ class DirectedGraphConstructTracer extends Tracer {
}
clearGraphColor
()
{
var
tracer
=
this
;
this
.
nodeCollection
.
forEach
(
function
(
node
){
node
.
isNew
=
false
;
node
.
visited
=
node
.
isNew
=
false
;
});
this
.
graph
.
nodes
().
forEach
(
function
(
node
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录