Apache License 2.0

项目介绍

owant/ThinkMap 是一个托管在 GitHub 上的开源项目,主要使用 Java 编写,采用 Apache License 2.0 许可证,目前获得 354 个 Star、84 次 Fork。

仓库全名
owant/ThinkMap
开源许可证
Apache License 2.0
Star 数
354
Fork 数
84

README 摘要

Draw a tree in android,ThinkMap The Simple code following the simple code, you can build a tree. AppStore http://shouji.baidu.com/software/11238419.html Other https://blog.csdn.net/u012131702/article/details/54409193

完整内容见 GitHub 原始 README 或本页 。

常见问题

ThinkMap 用什么语言开发?

主要使用 Java 编写,采用 Apache License 2.0 许可证,目前有 354 个 Star。

ThinkMap 可以免费商用吗?

仓库采用 Apache License 2.0 许可证,可免费使用与修改,商业使用请遵守许可证条款(例如保留版权声明与许可声明)。

如何获取 ThinkMap 的源码?

可以直接克隆仓库:git clone https://github.com/owant/ThinkMap.git,默认分支为 master;安装与运行步骤见仓库 README。

ThinkMap 最近还在维护吗?

仓库最近一次更新为 2021年11月18日,当前没有未关闭的 Issue;Star 数为 354,可作为社区活跃度的参考。

简要分析

热度分
536
价值分
239
活跃状态
活跃

语言占比

Java

Release

README

Draw a tree in android,ThinkMap

The Simple code

following the simple code, you can build a tree.

        final NodeModel<String> nodeA = new NodeModel<>("A");
        final NodeModel<String> nodeB = new NodeModel<>("B");
        final NodeModel<String> nodeC = new NodeModel<>("C");
        final NodeModel<String> nodeD = new NodeModel<>("D");
        final NodeModel<String> nodeE = new NodeModel<>("E");
        final NodeModel<String> nodeF = new NodeModel<>("F");
        final NodeModel<String> nodeG = new NodeModel<>("G");
        final NodeModel<String> nodeH = new NodeModel<>("H");
        final NodeModel<String> nodeI = new NodeModel<>("I");
        final NodeModel<String> nodeJ = new NodeModel<>("J");
        final NodeModel<String> nodeK = new NodeModel<>("K");
        final NodeModel<String> nodeL = new NodeModel<>("L");
        final NodeModel<String> nodeM = new NodeModel<>("M");
        final NodeModel<String> nodeN = new NodeModel<>("N");
        final NodeModel<String> nodeO = new NodeModel<>("O");
        final NodeModel<String> nodeP = new NodeModel<>("P");
        final NodeModel<String> nodeQ = new NodeModel<>("Q");
        final NodeModel<String> nodeR = new NodeModel<>("R");
        final NodeModel<String> nodeS = new NodeModel<>("S");
        final NodeModel<String> nodeT = new NodeModel<>("T");
        final NodeModel<String> nodeU = new NodeModel<>("U");
        final NodeModel<String> nodeV = new NodeModel<>("V");
        final NodeModel<String> nodeW = new NodeModel<>("W");
        final NodeModel<String> nodeX = new NodeModel<>("X");
        final NodeModel<String> nodeY = new NodeModel<>("Y");
        final NodeModel<String> nodeZ = new NodeModel<>("Z");


        final TreeModel<String> tree = new TreeModel<>(nodeA);
        tree.addNode(nodeA, nodeB, nodeC, nodeD);
        tree.addNode(nodeC, nodeE, nodeF, nodeG, nodeH, nodeI);
        tree.addNode(nodeB, nodeJ, nodeK, nodeL);
        tree.addNode(nodeD, nodeM, nodeN, nodeO);
        tree.addNode(nodeF, nodeP, nodeQ, nodeR, nodeS);
        tree.addNode(nodeR, nodeT, nodeU, nodeV, nodeW, nodeX);
        tree.addNode(nodeT, nodeY, nodeZ);

        int dx = DensityUtils.dp2px(this, 20);
        int dy = DensityUtils.dp2px(this, 20);
        int mHeight = DensityUtils.dp2px(this, 720);
      
        testTreeView.setTreeLayoutManager(new RightTreeLayoutManager(dx, dy, mHeight));
        testTreeView.setTreeModel(tree);

AppStore

http://shouji.baidu.com/software/11238419.html

Other

https://blog.csdn.net/u012131702/article/details/54409193

评论

暂无评论