Groups
Groups
Sign in
Groups
Groups
scala-graph
Conversations
Labels
About
Send feedback
Help
scala-graph
Contact owners and managers
1–30 of 191
Welcome to the
Graph for Scala
user forum. Have fun with version
2
!
Mark all as read
Report group
0 selected
francisc...@haloradius.com
,
empen...@gmail.com
3
Aug 18
Future of graph-json support for Scala 3
Here you go: JSON for Scala 3 empen...@gmail.com schrieb am Donnerstag, 20. Februar 2025 um 11:38:22
unread,
Future of graph-json support for Scala 3
Here you go: JSON for Scala 3 empen...@gmail.com schrieb am Donnerstag, 20. Februar 2025 um 11:38:22
Aug 18
Ilias Soto
,
empen...@gmail.com
3
10/1/24
Looking to contribute
Hi Peter, yes, I got the answer, thank you very much. I am happy to contribute using two of the
unread,
Looking to contribute
Hi Peter, yes, I got the answer, thank you very much. I am happy to contribute using two of the
10/1/24
Allan Brighton
,
empen...@gmail.com
4
2/24/24
Change in behavior of scala-graph 2.0 for multiple edges between same two nodes
Yes, that was it (MultiEdge). Thanks, Allan On Saturday, February 24, 2024 at 5:27:21 PM UTC+1 empen.
unread,
Change in behavior of scala-graph 2.0 for multiple edges between same two nodes
Yes, that was it (MultiEdge). Thanks, Allan On Saturday, February 24, 2024 at 5:27:21 PM UTC+1 empen.
2/24/24
Tim Barclay
,
empen...@gmail.com
4
5/1/23
Having trouble with Labelled Edge implicits
Btw, predefined labeled edges have been superseded by easy-to-define custom edges in version 2. timrb
unread,
Having trouble with Labelled Edge implicits
Btw, predefined labeled edges have been superseded by easy-to-define custom edges in version 2. timrb
5/1/23
Simon Parten
,
empen...@gmail.com
6
5/1/23
Design advice / suggestions
Check out the enhanced support for edge ADTs in version 2! empen...@gmail.com schrieb am Mittwoch, 26
unread,
Design advice / suggestions
Check out the enhanced support for edge ADTs in version 2! empen...@gmail.com schrieb am Mittwoch, 26
5/1/23
Jose Emilio Labra Gayo
,
empen...@gmail.com
6
5/1/23
How can I define a generic custom hyperedge
This is now much easier with version 2. jel...@gmail.com schrieb am Samstag, 27. April 2013 um 20:13:
unread,
How can I define a generic custom hyperedge
This is now much easier with version 2. jel...@gmail.com schrieb am Samstag, 27. April 2013 um 20:13:
5/1/23
Tilman Zuckmantel
2
11/15/22
Support for HTML-like labels in DOT representation
Hi again, I noticed while creating a minimal example that the mistake was on my side. Indeed the
unread,
Support for HTML-like labels in DOT representation
Hi again, I noticed while creating a minimal example that the mistake was on my side. Indeed the
11/15/22
Ewa Habierska
,
empen...@gmail.com
2
3/19/22
The newest version of the library for Scala 2.12
Hi Ewa, Not directly. At some point 2.12 support needs be discontinued. How comes you cannot switch
unread,
The newest version of the library for Scala 2.12
Hi Ewa, Not directly. At some point 2.12 support needs be discontinued. How comes you cannot switch
3/19/22
Simon Leischnig
,
empen...@gmail.com
3
1/30/22
type inference not working for .toOuter; Scala 3, scala-graph 1.13.2
see https://github.com/scala-graph/scala-graph/issues/217 simo...@gmail.com schrieb am Sonntag, 16.
unread,
type inference not working for .toOuter; Scala 3, scala-graph 1.13.2
see https://github.com/scala-graph/scala-graph/issues/217 simo...@gmail.com schrieb am Sonntag, 16.
1/30/22
Jose Tharail
,
Peter Empen
2
10/9/20
Graph edges filter returning a Set[Graph] instead of Set[Edge] ?
Hi Jose, I've just tried a simple example and the documentation seems to be correct:). What is
unread,
Graph edges filter returning a Set[Graph] instead of Set[Edge] ?
Hi Jose, I've just tried a simple example and the documentation seems to be correct:). What is
10/9/20
tampler
,
Peter Empen
8
4/25/20
Implement a chained Mul-Add operation
Hi Boris, From what I understand you require: Provided you have a single root node (node with no
unread,
Implement a chained Mul-Add operation
Hi Boris, From what I understand you require: Provided you have a single root node (node with no
4/25/20
tampler
, …
Daniel Sobral
5
4/15/20
Graph traversal
Thanks for a prompt reply guys. Worked like a charm for me. Here's my final code. The full source
unread,
Graph traversal
Thanks for a prompt reply guys. Worked like a charm for me. Here's my final code. The full source
4/15/20
Rodrigo Bonifacio
,
Peter Empen
2
3/25/20
[BasicQuestion] problem using pathUntil and pathTo methods
Hi Rodrigo, could you please paste your call of pathUntil here? The compile error tells that you are
unread,
[BasicQuestion] problem using pathUntil and pathTo methods
Hi Rodrigo, could you please paste your call of pathUntil here? The compile error tells that you are
3/25/20
Edmondo Porcu
, …
Peter Empen
8
3/25/20
Finding all the paths from A to B
I just meant https://github.com/scala-graph/scala-graph/issues where we will mark your issue as an
unread,
Finding all the paths from A to B
I just meant https://github.com/scala-graph/scala-graph/issues where we will mark your issue as an
3/25/20
lucas....@nubank.com.br
,
Peter Empen
3
3/25/20
How to extract path dependent types when wrapping graphs
Thank you for the clarification! Going to work with that. On Wednesday, March 25, 2020 at 11:16:05 AM
unread,
How to extract path dependent types when wrapping graphs
Thank you for the clarification! Going to work with that. On Wednesday, March 25, 2020 at 11:16:05 AM
3/25/20
Daniel Sobral
,
Peter Empen
4
3/1/20
Transitive edges
We have no direct support for this. What you are doing is fine. I'd brush it up a little to be
unread,
Transitive edges
We have no direct support for this. What you are doing is fine. I'd brush it up a little to be
3/1/20
tampler
, …
Simon Parten
6
1/24/20
Folding a DiGraph with a Node method
I copied and pasted tamplers code above into a scala worksheet in intellij. Then, I replaced tamplers
unread,
Folding a DiGraph with a Node method
I copied and pasted tamplers code above into a scala worksheet in intellij. Then, I replaced tamplers
1/24/20
Bruno Batarelo
,
Peter Empen
7
7/13/19
Traversal ordering
Hi Bruno, thanks for more clarity and the nice graphics. First, would you agree that we have the
unread,
Traversal ordering
Hi Bruno, thanks for more clarity and the nice graphics. First, would you agree that we have the
7/13/19
Ethan Kuarez
, …
Peter Empen
7
6/7/19
Multiple source nodes for DiHyperEdge
Hi Melvin, this is already done but need be shipped along with other changes so it is planned to be
unread,
Multiple source nodes for DiHyperEdge
Hi Melvin, this is already done but need be shipped along with other changes so it is planned to be
6/7/19
Bruno Batarelo
,
Peter Empen
8
4/20/19
Traversing multiple cycles or detecting a cycle after traversal stopped
No problem, Bruno, thank you for your patient. I'm sorry there is no direct support for this yet.
unread,
Traversing multiple cycles or detecting a cycle after traversal stopped
No problem, Bruno, thank you for your patient. I'm sorry there is no direct support for this yet.
4/20/19
fbd
,
Peter Empen
2
4/18/19
How to list all paths between two nodes, or findCycle
Unfortunately there exists no method like findPaths. Please scan this mailing list for this question
unread,
How to list all paths between two nodes, or findCycle
Unfortunately there exists no method like findPaths. Please scan this mailing list for this question
4/18/19
Alexey Tyurin
, …
Peter Empen
4
2/20/19
Possible issues to contribute
Hi Nikita, welcome at Graph for Scala!From the above selection I personally favour local graph
unread,
Possible issues to contribute
Hi Nikita, welcome at Graph for Scala!From the above selection I personally favour local graph
2/20/19
Sebastian Törnqvist
,
Peter Empen
2
10/12/18
weighted graph to json
After copying your code and calling println(smallSimGraph.toJson(quickJson)) I get {"nodes"
unread,
weighted graph to json
After copying your code and calling println(smallSimGraph.toJson(quickJson)) I get {"nodes"
10/12/18
Sergey Kokorin
,
Peter Empen
2
8/16/18
Node Labeling
Sergey, to discard labeled edges with a label type of String, you can do for instance: import scalax.
unread,
Node Labeling
Sergey, to discard labeled edges with a label type of String, you can do for instance: import scalax.
8/16/18
Milan Cvejic
,
Peter Empen
2
7/22/18
Finding nodes with only outer connections
Right, this operation will be O(V) if your predicate does not inspect edges, otherwise O(V + log(E))
unread,
Finding nodes with only outer connections
Right, this operation will be O(V) if your predicate does not inspect edges, otherwise O(V + log(E))
7/22/18
Martin Senne
,
Peter Empen
6
7/14/18
groupBy on graph not compiling
I now better understand. I'd suggest object Martin extends App { import scalax.collection.
unread,
groupBy on graph not compiling
I now better understand. I'd suggest object Martin extends App { import scalax.collection.
7/14/18
Anirudh Vyas
,
Peter Empen
4
6/9/18
scala-graph weighted DiEdge based graph json serializer
Hi Anirudh, concerning JSON serialization of weighted edges, did you check out TJson.scala? Did you
unread,
scala-graph weighted DiEdge based graph json serializer
Hi Anirudh, concerning JSON serialization of weighted edges, did you check out TJson.scala? Did you
6/9/18
bha...@yantranet.com
,
Peter Empen
2
6/9/18
Json serialization errors for DiEdge for play framework 2.6.10 and play-json 2.6.0
Which version of lift-json and paranamer do you have on your classpath? Also, please provide complete
unread,
Json serialization errors for DiEdge for play framework 2.6.10 and play-json 2.6.0
Which version of lift-json and paranamer do you have on your classpath? Also, please provide complete
6/9/18
Anirudh Vyas
2
6/4/18
Problems with extraction of Graph from a simple Stringified JSON
I was able to fix the issue by populating NON-BLANK values and making things Optional. This sort of
unread,
Problems with extraction of Graph from a simple Stringified JSON
I was able to fix the issue by populating NON-BLANK values and making things Optional. This sort of
6/4/18
alex
,
Peter Empen
4
3/18/18
toOuterNodes is a Traversable but acts as a Set
You are welcome. One more point: you can also go directly with the node set like g.nodes.toIterator.
unread,
toOuterNodes is a Traversable but acts as a Set
You are welcome. One more point: you can also go directly with the node set like g.nodes.toIterator.
3/18/18