2024-02-26 10:18:17 +0200 | received badge | ● Famous Question (source) |

2023-11-30 10:10:30 +0200 | received badge | ● Famous Question (source) |

2023-01-10 02:27:12 +0200 | received badge | ● Notable Question (source) |

2023-01-10 02:27:12 +0200 | received badge | ● Popular Question (source) |

2022-06-30 09:00:11 +0200 | received badge | ● Popular Question (source) |

2021-06-17 07:17:57 +0200 | received badge | ● Notable Question (source) |

2020-04-16 21:00:31 +0200 | received badge | ● Notable Question (source) |

2020-04-16 21:00:31 +0200 | received badge | ● Popular Question (source) |

2019-08-07 17:22:14 +0200 | received badge | ● Popular Question (source) |

2018-03-07 13:21:06 +0200 | asked a question | Flow gives error for disconnected vertices When calculating the flow between to vertices which are not connected in a graph, the method returns a ValueError. I would have assumed that it would just return 0. Here's a minimal example: If on the other hand one tries the shortest_path method it just returns a empty list, since there is not path between 0 and 1. |

2018-03-05 12:14:38 +0200 | received badge | ● Nice Question (source) |

2018-03-05 10:28:47 +0200 | asked a question | Error with is_prime I'm getting an error message when trying to check if a certain graph is prime with the following code: which gives me the following error message: |

2017-10-13 16:00:23 +0200 | asked a question | Edge color for undirected multiedge graphs It seems that there is a bug with specifying the color of undirected multiedges. Here's an example: The graph plotted has then four edges, two black and two red. It seems that the multiedge to be colored red is seen as a different one than the already present one, even though they are actually the same since the graph is undirected. I get the intended plot if I change the last line to: |

2017-03-14 14:50:46 +0200 | commented answer | Updating graph plot Thanks, using animations worked well :) |

2017-02-23 13:17:35 +0200 | received badge | ● Supporter (source) |

2017-02-23 11:27:23 +0200 | asked a question | to_directed() affects original graph I've stumbled on what I think is a bug. When you create a directed graph from some original graph and then making changes on the new, this can affect the old one. I'm not sure if it should be like this and one should always copy the graph first. Here's a minimal example that for be gives an error "KeyError: 0". |

2017-01-19 09:29:05 +0200 | asked a question | Updating graph plot I wish to visualize a algorithm running on a graph. How can I update the plot of a graph after for example deleting a vertex or to change color of a vertex without generating another plot window? |

2017-01-08 13:28:44 +0200 | received badge | ● Scholar (source) |

2017-01-08 13:28:39 +0200 | commented answer | Legend for histogram Perfect, thanks! :) |

2017-01-08 05:45:07 +0200 | received badge | ● Student (source) |

2017-01-07 13:52:15 +0200 | asked a question | Legend for histogram I can't make the legend for histograms work as I want it to. I can make a legend with the labels appear but the corresponding indicator doesn't show the colors just two black vertical lines. Here's a minimial example: Any ideas? |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.