blocks|key|3311053|text|如果你真的只是在寻找一个用来处理图形的第三方Java库，看看JUNG吧，它有很多图形操作的特性。然而，对于你试图实现的目标来说，这可能是矫枉过正。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3311054|entityMap|0|LINK|mutability|MUTABLE|url|http://jung.sourceforge.net/^0|U|4|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

If you are really just looking for a 3rd-Party Java Library to work with graphs take a look at <a href="http://jung.sourceforge.net/" rel="nofollow">JUNG</a> it has plenty of features for graph manipulation. However, it might be overkill for what you are trying to achieve.

blocks|key|3311103|text|以此为例-非常适合于图形操作，也适用于swing中的图形结构|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3311104|<dependency>
++++<groupId>jgraph</groupId>
++++<artifactId>jgraph</artifactId>
++++<version>5.13.0.0</version>
</dependency>|code-block|syntax|javascript|3311105|http://www.jgraph.com|offset|length|3311106|entityMap|0|LINK|mutability|MUTABLE|url|http://www.jgraph.com/^0|0|0|0|L|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|U|8|@]|9|@$I|V|J|W|1|X]]|A|$]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

take this one - really good for graph manipulations, and also for dispaying graph structure in swing

<pre><code>&lt;dependency&gt;
 &lt;groupId&gt;jgraph&lt;/groupId&gt;
 &lt;artifactId&gt;jgraph&lt;/artifactId&gt;
 &lt;version&gt;5.13.0.0&lt;/version&gt;
&lt;/dependency&gt;
</code></pre>

<a href="http://www.jgraph.com" rel="nofollow">http://www.jgraph.com</a>

blocks|key|3310951|text|这是一个相当简单的图构造和遍历问题。您不需要任何库。你可以在一个简单的java类中做到这一点。例如|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3310952|http://it-essence.xs4all.nl/roller/technology/entry/three_tree_traversals_in_java|offset|length|3310953|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|29|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|N|8|@]|9|@$D|O|E|P|1|Q]]|A|$]]|$1|F|3|-4|5|6|7|R|8|@]|9|@]|A|$]]]|G|$H|$5|I|J|K|A|$L|C]]]]

This is a fairly simple graph construction and traversal problem. You do not need any libraries. You can do it in a simple java class. For e.g.

<a href="http://it-essence.xs4all.nl/roller/technology/entry/three_tree_traversals_in_java" rel="nofollow">http://it-essence.xs4all.nl/roller/technology/entry/three_tree_traversals_in_java</a>

blocks|key|1586212|text|听起来你想要将节点实现为类实例，将链接实现为引用。使用map来实现图的边将是相当复杂和低效的。难怪你想要清理你的代码。我不确定我是否完全理解您的问题，但这应该很接近：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1586213|//+Null+nodes+are+the+simplest+type.+They+represent+missing+children.
class+NullNode+{

++++//+Get+the+values+of+all+leaves+descended+from+this+node+as+a+set.
++++Set<Integer>+getValues()+{+return+new+HashSet(0);+}

++++//+Get+the+values+descended+from+the+node+at+the+end+of+the+given
++++//+key+path+as+a+set.++For+a+null+node,+this+should+not+be+called.
++++Set<Integer>+getValues(int+[]+path,+int+i)+{+raise+new+IllegalOperationException();+}

++++//+Initiate+the+search+for+values.++The+only+way+that's+okay
++++//+for+null+nodes+is+when+the+path+is+empty.
++++Set<Integer>+getValues(int+[]+path)+{
++++++++if+(path.length+==+0)
++++++++++++return+new+HashSet(0);
++++++++else
++++++++++++raise+new+IllegalOperationException();
++++}
}

//+A+regular+node+is+a+null+node+with+a+key.+It+should
//+never+be+instantiated.+Use+Interior+or+Leaf+nodes+for+that.
abstract+class+Node+extends+NullNode+{

++++int+key;

++++//+Initiate+the+search+for+values.++Only+descend+if+the+key+matches.
++++Set<Integer>+getValues(int+[]+path)+{
++++++++return+(path.length+>+0+&&+path[0]+==+key)+?+getValues(path,+1)+:+new+HashSet(0);
++++}
}

//+Interior+nodes+have+two+children,+which+may+be+Null,+Interior,+or+Leaf.
class+InteriorNode+extends+Node+{

++++Node+left,+right;

++++Set<Integer>+getValues()+{
++++++++Set<Integer>+v+=+left.getValues();
++++++++v.addAll(right.getValues());
++++++++return+v;
++++}

++++Set<Integer>+getValues(int+[]+path,+int+i)+{
++++++++if+(i+%2B+1+<+path.length)+{
++++++++++++//+Again+we+only+descend+if+the+key+matches.
++++++++++++if+(path[i+%2B+1]+==+left.key)++return+getValues(left,+i+%2B+1);
++++++++++++if+(path[i+%2B+1]+==+right.key)+return+getValues(right,+i+%2B+1);
++++++++++++return+new+HashSet(0);
++++++++}
++++++++return+getValues();+//+Get+values+from+both+children.
++++}
}

//+A+leaf+node+has+no+children+and+a+value.
class+LeafNode+extends+Node+{

++++int+value;

++++Set<Integer>+getValues()+{
++++++++HashSet<Integer>+v+=+new+HashSet(1);
++++++++v.add(value);
++++++++return+v;
++++}

++++Set<Integer>+getValues(int+[]+path,+int+i)+{
++++++++return+(i+%2B+1+>=+path.length)+?+getValues()+:+new+HashSet(0);
++++}|code-block|syntax|javascript|1586214|}|1586215|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

It sounds like you'd want to implement nodes as class instances and links as references. Using maps to implement graph edges would be quite complicated and inefficient. Little wonder you'd want to clean up your code. I'm not sure I understand your problem perfectly, but this ought to be close:

<pre><code>// Null nodes are the simplest type. They represent missing children.
class NullNode {

 // Get the values of all leaves descended from this node as a set.
 Set&lt;Integer&gt; getValues() { return new HashSet(0); }

 // Get the values descended from the node at the end of the given
 // key path as a set. For a null node, this should not be called.
 Set&lt;Integer&gt; getValues(int [] path, int i) { raise new IllegalOperationException(); }

 // Initiate the search for values. The only way that's okay
 // for null nodes is when the path is empty.
 Set&lt;Integer&gt; getValues(int [] path) {
 if (path.length == 0)
 return new HashSet(0);
 else
 raise new IllegalOperationException();
 }
}

// A regular node is a null node with a key. It should
// never be instantiated. Use Interior or Leaf nodes for that.
abstract class Node extends NullNode {

 int key;

 // Initiate the search for values. Only descend if the key matches.
 Set&lt;Integer&gt; getValues(int [] path) {
 return (path.length &gt; 0 &amp;&amp; path[0] == key) ? getValues(path, 1) : new HashSet(0);
 }
}

// Interior nodes have two children, which may be Null, Interior, or Leaf.
class InteriorNode extends Node {

 Node left, right;

 Set&lt;Integer&gt; getValues() {
 Set&lt;Integer&gt; v = left.getValues();
 v.addAll(right.getValues());
 return v;
 }

 Set&lt;Integer&gt; getValues(int [] path, int i) {
 if (i + 1 &lt; path.length) {
 // Again we only descend if the key matches.
 if (path[i + 1] == left.key) return getValues(left, i + 1);
 if (path[i + 1] == right.key) return getValues(right, i + 1);
 return new HashSet(0);
 }
 return getValues(); // Get values from both children.
 }
}

// A leaf node has no children and a value.
class LeafNode extends Node {

 int value;

 Set&lt;Integer&gt; getValues() {
 HashSet&lt;Integer&gt; v = new HashSet(1);
 v.add(value);
 return v;
 }

 Set&lt;Integer&gt; getValues(int [] path, int i) {
 return (i + 1 &gt;= path.length) ? getValues() : new HashSet(0);
 }
</code></pre>

}

blocks|key|3222655|text|我找到的最好的图形库不是用Java编写的，而是用Scala编写的，它利用了Java中没有的一些强大的scala特性，比如抽象类型。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3222656|它被称为Graph+for+Scala，非常全面，但我必须警告你，虽然Scala和Java是相互兼容的(你可以在同一个项目中构建它们，并从Scala类调用Java类，反之亦然)，当涉及到Java中没有的一些功能时，从Java调用Scala时可能会出现一些问题。|3222657|http://www.assembla.com/spaces/scala-graph/wiki|offset|length|3222658|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|1B|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Q|8|@]|9|@$F|R|G|S|1|T]]|A|$]]|$1|H|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|E]]]]

The best graph library which I have found is not written in Java but in Scala and makes usage of some powerful scala features not available in Java, such as abstract types.

It is called Graph for Scala and it is extremely comprehensive, but I have to warn you that while Scala and Java they are intercompatible (you can build them in the same project and call a Java class from a Scala class and vice-versa), some problems might rise when calling Scala from Java when it comes to some features which are not available in Java.

<a href="http://www.assembla.com/spaces/scala-graph/wiki" rel="nofollow">http://www.assembla.com/spaces/scala-graph/wiki</a>

blocks|key|1586130|text|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1586131|是否有任何自定义Map实现或第三方库可以解决我的情况，以便从手动操作(如String.split或循环和条件语句)中清理代码？|blockquote|offset|length|style|CODE|1586132|1586133|1586134|如果您想要取消编写代码的自由，那么您可以创建自己的库。通过将类导出到Jar文件中，您可以轻松地在Eclipse中创建库，我认为这在NetBeans中是一项微不足道的任务。|1586135|如果您想防止在构造后对图进行更改，那么您需要创建一个不可变的数据结构。对于不可变的图结构，您必须将图看作一个宇宙，并且每个操作都是一个GraphOperation。您永远不能修改图形，只能创建一个新图形，该图形是通过将图形与您的GraphOperations列表进行交叉而产生的。假设您的Graph结构包含唯一的节点值，这将不会带来太大的问题，因为您可以很高兴地使用值来描述关系。您的代码将如下所示：|1586136|Graph+graph2+=+graph1.process(graph1.GetTopNode().RemoveLeft());
graph2+=+graph2.process(graph2.GetNode(7).AddRight(8));|code-block|syntax|javascript|1586137|GetTopNode()返回一个仅提供节点视图的对象。RemoveLeft()返回一个GraphOperation对象，Graph.process()使用该对象从操作中创建新的图形。如果您愿意，它可以只返回一个在内部存储指向graph1的链接的Graph实现，以及传递给它的GraphOperation实例的列表，这样您就可以避免过于频繁地复制图结构(非常类似于字符串缓冲区)。|1586138|entityMap^0|0|8|3|10|C|0|0|0|0|0|0|0|C|R|C|17|E|1O|F|34|6|3E|5|3T|E|0^^$0|@$1|2|3|-4|4|5|6|W|7|@]|8|@]|9|$]]|$1|A|3|B|4|C|6|X|7|@$D|Y|E|Z|F|G]|$D|10|E|11|F|G]]|8|@]|9|$]]|$1|H|3|-4|4|5|6|12|7|@]|8|@]|9|$]]|$1|I|3|-4|4|5|6|13|7|@]|8|@]|9|$]]|$1|J|3|K|4|5|6|14|7|@]|8|@]|9|$]]|$1|L|3|M|4|5|6|15|7|@]|8|@]|9|$]]|$1|N|3|O|4|P|6|16|7|@]|8|@]|9|$Q|R]]|$1|S|3|T|4|5|6|17|7|@$D|18|E|19|F|G]|$D|1A|E|1B|F|G]|$D|1C|E|1D|F|G]|$D|1E|E|1F|F|G]|$D|1G|E|1H|F|G]|$D|1I|E|1J|F|G]|$D|1K|E|1L|F|G]]|8|@]|9|$]]|$1|U|3|-4|4|5|6|1M|7|@]|8|@]|9|$]]]|V|$]]

<blockquote>
 Is there any custom <code>Map</code> implementation or third-party library for solve my situation for cleanup my code from manipulation manually such as <code>String.split</code> or loop and condition statements?
</blockquote>

If you want to remove the freedom to written manipulate code then you can create your own libraries. You can easily create libraries in Eclipse by exporting your classes into a Jar file, which I would presume is a trivial task in NetBeans.

If you want to protect against changes to the graph after construction then you need to create an immutable data structure. With an immutable graph structure you have to view the Graph as a Universe, and each operation is a GraphOperation. You can never modify a Graph, only create a new Graph that results from crossing the Graph with your list of GraphOperations. Presuming your Graph structure holds unique node values, this will not pose too much of a problem, since you can happily describe relations using values. Your code will look something like this:

<pre><code>Graph graph2 = graph1.process(graph1.GetTopNode().RemoveLeft());
graph2 = graph2.process(graph2.GetNode(7).AddRight(8));
</code></pre>

<code>GetTopNode()</code> returns an object that only provides a view of the nodes. <code>RemoveLeft()</code> returns a <code>GraphOperation</code> object, which <code>Graph.process()</code> uses to create a new graph from the operation. If you want, it could just return a <code>Graph</code> implementation that internally stores a link to <code>graph1</code>, and the list of <code>GraphOperation</code> instances that have been passed into it, allowing you to avoid copying the graph structures too often (pretty much like a string buffer).

blocks|key|1847006|text|如果您正在寻找Java中的图形数据库和操作，Neo4j可能会对您有所帮助。如果您正在寻找一个完美的Graph+DB和操纵API，这可能会超出您的期望。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1847007|它为您提供了非常高级的选项来遍历图形节点、关系、审计。跨组织使用Neo4j来存储非常复杂的分层数据，对于复杂的分层数据库，Neo4j的性能远远优于基于oracle的R-DB。|1847008|entityMap|0|LINK|mutability|MUTABLE|url|http://neo4j.org/resources/^0|M|5|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

If you are looking for Graph database and manipulation in Java, <a href="http://neo4j.org/resources/" rel="nofollow">Neo4j</a> might help you. This can be more than what you have bargained for if you are looking for a perfect Graph DB and manipulation API.

It gives you very advanced options to traverse the graph nodes, relationships, auditing. Neo4j is being used across organizations to store very complex hierarchical data, the performance by Neo4j is far better than oracle based R-DB's for complex hierarchical databases.

I needed a graph structure of <code>key ==&gt;&gt; value</code> such as following image:

<img src="https://i.stack.imgur.com/I6gNN.png" alt="enter image description here">

Numbers in circle are key of its node.

I wanted access to stored value in key <code>2-7-6-5</code> and I wanted by <code>2-7</code> key retrieve a sub-graph contains collectin of <code>2</code>, <code>6-5</code>, <code>6-11</code> keys-values , so I wrote my implementation by nested maps and it worked fine but my question is :

Is there any custom <code>Map</code> implementation or third-party library for solve my situation for cleanup my code from manipulation manually such as <code>String.split</code> or loop and condition statements?

Utility for graph manipulation in java

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我需要key ==>> value的图形结构，如下图所示：​​圆圈中的数字是其节点的关键字。我想要访问key 2-7-6-5中的存储值，我想通过2-7 key检索一个包含2、6-5、6-11键值集合的子图，所以我通过嵌套映射编写了我的实现，它工作得很好，但我的问题是：是否有任何自定义Map实现或第三方库可以解决我的情况，以便从手动操作中清理代码，如String.split或循环和条件语句？

问java中用于图形操作的实用程序
EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问java中用于图形操作的实用程序EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问java中用于图形操作的实用程序
EN