Find topologically sorted, strongly connected components in directed acyclic graphics

I am aware of the topological sorting and strongly connected components are very related algorithms, but I have been looking for an algorithm to compute both instead of one at a time, and I find it surprisingly difficult.

With the assumption of a directed acyclic graph, can one simultaneously find the list of strongly connected components and at the same time topologically sort the nodes in each of the components?

For clarity, the output would be a list of components, with each component being a topological order of the nodes included in that component.

Bonus points when the list of strongly connected components is sorted by the insertion order of the nodes in the graph (that is, the first connected component contains the first node ever inserted in the graph) regardless of global topological order; etc. for subsequent components).

Plotting – How are data stored and step sizes displayed when using NDSolve components and data structures?

In some applications, it is advantageous to access components of NDSolve,
However, it may also be necessary to consider the step size specified in the numerical integration as in the stiffness detection.
For example:

{ndssdata} = NDSolve`ProcessEquations[{D[u[t, x]t]==
0.1 d[u[t, x], x, x]+[t, x] D[u[t, x], x],
u[0, x] == Cos[2 Pi x]u[t, 0] == u[t, 1]}, u, t, {x, 0, 1},
Method -> "Stiffness Circuit"
(*Method[Rule]"ExplicitRungeKutta" *)]tm = 1;
NDSolve`Iterate[ndssdata, {0, tm}]
sol = NDSolve`ProcessSolutions[ndssdata]

My questions:

  1. So get and draw the step sizes as well as with StepDataPlot[] With NDSolve;

  2. How to save this interpolation u[t,x] to then load and plot it with Receive[...] and Plot3D[u[t, x] /. Sol...] after closing and reopening MMA.

I tried dumpsave["", sol] and Receive["...\"] what gives me

Get :: noopen: Can not open … >>
$ Failed

Please leave your comments and thoughts. Thank you for your suggestions and help.

How do you decide to group components in software architectures?

I am aware that this may be a question with only subjective answers, but I always come back to that idea.
Do you group components in designing a software architecture according to their type of task or their "theme"?

In the absence of a better example, you have many file exports in your application, one of which is billing, but you also have many other components that deal with this topic. Group them according to the type of work (which would be exported here) or their "theme" (which would be billing)?

Is there an objective way to determine when one is more useful than the other in some scenarios? Not to taste.

We have to see components used in Enzolast South Africa.

Currently, you can easily fulfill your sexual desires. Satisfy your accomplice and give him a shock by your trembling execution in the room. Enzolast Male Enhancement in Eire brings that kind of life into your life, decorating your sex life and sharing your time in the room. At the moment, you can make your night wild and long-term, and your days with well-being and …

We have to see components used in Enzolast South Africa.

How to create a random adjacency matrix with a certain number of components in the graph

I build a diagram package in C and part of the work involves creating a random graph with a certain number of components in the graph. For example, if I wanted to create a graph with 50 vertices and five components, the module would use 50 and 5 as parameters and should be able to generate an adjacency matrix of the graph (currently I implement them with adjacency) only matrix).
I have the idea that I can create cliques with a different number of vertices, and the number of cliques equals exactly the number of components. Then I can merge all the adjacency matrices corresponding to the cliques to form the adjacency matrix of the graph. The implementation in C seems to be quite complicated, and I think that this is not an optimal solution, because the graph is always tight and I can not achieve a sparse graph with this approach. Is there something I miss?

Java jpanel.removeAll does not remove the components

My problem is that I create some JPanels with a few buttons in it. When I press a button, I make a removeAll, but the window is not cleaned up, but I have to move the scrollbar a little so that everything is deleted. It's like it's not updated.

    public void clean () {// Theoretically, JPanel should stay clean, but not
jpActivitiesAll.removeAll ();
jpActivitiesAll.validate ();

@Run over
public void actionPerformed (ActionEvent e) {
String actionCommand = e.getActionCommand ();
switch (actionCommand) {


case "SHOWIN": // It's a UI button that works correctly

this.model.obteProximesActivitats (); ();

Design – Find examples of a complex user interface with multiple interdependent components using angle and reactive shapes

I can not find many examples of best practices on the Internet when using Angular and Reactive Forms to develop large, complicated user interfaces. For example, apps with multiple dynamic components and many rule-based, event-driven updates to specific fields.

Does anyone know of good open source projects or tutorials that could be used as a reference to gain experience in designing and maintaining these types of complicated user interfaces?

Web Development – Efficient and readable method for designing Javascript web components

I have a webpage that loads a very long list of custom web components, each with its own shadow DOM and a stylesheet shared by all instances.

Originally I have the stylesheet as a CSS file in one Day to code readable:

(Function () {
const template = document.createElement (& # 39; template & # 39;);
template.innerHTML = `
"; customElements.define (& # 39; my-element & # 39 ;, class extends HTMLElement { Constructor() {...} connectedCallback () {...} } }) ();

This has the unfortunate effect (I think) of the style being loaded after the content, and the element appears briefly as unstyled.

The problem is solved by inserting the styling between